MétaCan
Menu
Back to cohort
Record W2944703700 · doi:10.1002/rnc.4581

Iterative ‐conic controller synthesis

2019· article· en· W2944703700 on OpenAlex
Leila Bridgeman, James Richard Forbes

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Journal of Robust and Nonlinear Control · 2019
Typearticle
Languageen
FieldEngineering
TopicStability and Control of Uncertain Systems
Canadian institutionsMcGill University
Fundersnot available
KeywordsConic sectionConic optimizationControl theory (sociology)Norm (philosophy)Mathematical optimizationController (irrigation)Convex optimizationLinear matrix inequalityMathematicsRegular polygonComputer scienceControl (management)Convex combination

Abstract

fetched live from OpenAlex

Summary This paper proposes a method to synthesize controllers that minimize an upper bound on the closed‐loop ‐norm while imposing desired controller conic bounds. An initial conic controller is synthesized and iteratively improved. Conic sectors can be used to characterize a variety of input‐output properties, such as gain, phase, and minimum gain. If such plant properties hold robustly to uncertainty present, then closed‐loop stability can be ensured robustly via the Conic Sector Theorem by imposing desired controller conic bounds. Consequently, this paper provides a versatile optimal and robust controller synthesis method. Moreover, it relies only on the solution of convex optimization problems subject to linear matrix inequality constraints, making it readily implementable.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.355
Threshold uncertainty score0.430

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.007
GPT teacher head0.205
Teacher spread0.198 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it