MétaCan
Menu
Back to cohort
Record W1748731374 · doi:10.1016/j.ifacol.2015.08.170

Moving-Horizon Predictive Input Design for Closed-Loop Identification

2015· article· en· W1748731374 on OpenAlex

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

VenueIFAC-PapersOnLine · 2015
Typearticle
Languageen
FieldEngineering
TopicControl Systems and Identification
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceIdentification (biology)Control theory (sociology)TRACE (psycholinguistics)SIGNAL (programming language)Model predictive controlQuadratic equationMathematical optimizationFunction (biology)Loop (graph theory)HorizonFisher informationSample (material)MathematicsArtificial intelligenceControl (management)Machine learning

Abstract

fetched live from OpenAlex

This paper presents a new approach to input design for closed-loop identification. The idea is to maximize the trace of the Fisher information matrix associated with the plant model, while enforcing explicit constraints on both inputs and outputs. The result is the richest possible excitation signal for which the operation of a running closed-loop system remains within acceptable bounds. The function to be maximized is a convex quadratic. A Moving Horizon Predictive (MHP) framework is used to solve the input design problem at each sample time. The method can be combined with a fixed model variable regressor technique to estimate time delays. The suggested technique is implemented and used to identify machine-directional processes in an industrial paper machine.

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.001
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.836
Threshold uncertainty score0.808

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.029
GPT teacher head0.244
Teacher spread0.216 · 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