MétaCan
Menu
Back to cohort
Record W1506372962

Iterative learning strategy for a class of nonlinear controllers applied to constrained batch processes

2004· article· en· W1506372962 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

VenueAsian Control Conference · 2004
Typearticle
Languageen
FieldEngineering
TopicIterative Learning Control Systems
Canadian institutionsMcMaster University
Fundersnot available
KeywordsIterative learning controlComputer scienceTrajectoryConvergence (economics)Process (computing)Mathematical optimizationNonlinear systemControl theory (sociology)ExploitBatch processingClass (philosophy)Scheme (mathematics)Iterative methodControl (management)Iterative and incremental developmentAlgorithmArtificial intelligenceMathematics
DOInot available

Abstract

fetched live from OpenAlex

In this paper, we apply an iterative learning strategy to improve the performance of a class of nonlinear controllers, when they are applied to constrained batch processes. The idea is to exploit the control error information from the previous batches so that the corrected control inputs will iteratively improve the control performance. In this iterative learning scheme, we provide the convergence proof of the feed-forward input correction strategy as the batch cycle progresses. Furthermore, we extend the proposed strategy for handling input constraints, which in some cases the constraints may result in an accumulated error during the iteration process. To deal with this problem, we propose a segmented reference trajectory, where the learning strategy is applied for each segment with the assumption that a smooth transition between segments is established. Throughout the paper, a batch reactor control problem is used to illustrate how the proposed methods work in practice.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.964
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.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.013
GPT teacher head0.238
Teacher spread0.225 · 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