MétaCan
Menu
Back to cohort
Record W2142701970 · doi:10.1109/acc.1995.533796

A new framework for iterative identification and control

2005· article· en· W2142701970 on OpenAlexaff
M.M. Livstone, Munther A. Dahleh, Jay A. Farrell

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicControl Systems and Identification
Canadian institutionsAlpha Technologies (Canada)
Fundersnot available
KeywordsComputer scienceIterative and incremental developmentProcess (computing)Identification (biology)Set (abstract data type)Iterative methodController (irrigation)Iterative learning controlRobust controlIterative refinementRank (graph theory)Control theory (sociology)Control (management)Scheme (mathematics)System identificationMathematical optimizationAlgorithmControl systemData miningMathematicsArtificial intelligenceEngineeringMeasure (data warehouse)

Abstract

fetched live from OpenAlex

In this paper we present a new framework for iterative modeling and control. We begin by describing the unknown process with an uncertain model whose parameterization depends on prior information, available control design tools and other modeling preferences. The next step is an iterative procedure for refining the uncertainty set via robust control based model invalidation and can be viewed as a systematic way of efficiently searching for a controller delivering a certain desired level of performance to the unknown process. As a result, either the performance goal will be met or the entire uncertainty set will be invalidated in accordance with our modeling and control method prejudice. An iterative scheme based on a fixed pole model structure and rank one mixed /spl mu/ synthesis is described in detail and a specific example is used to illustrate the ideas.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0010.001
Science and technology studies0.0010.004
Scholarly communication0.0030.003
Open science0.0030.003
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0050.001

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.226
Teacher spread0.219 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicControl Systems and IdentificationFrench-language works237,207