Performance Analysis of Perturbation-Based Methods for Real-Time Optimization
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.
Bibliographic record
Abstract
This paper provides a comprehensive performance analysis approach for Real-Time Optimization (RTO) technologies, which incorporates systematic approaches to estimating bounds on the convergence behaviour and performance effects of on-line experiments used by a given RTO approach. The performance analysis method is illustrated by an investigation of the conventional two-phase approach and representative techniques drawn from the three main classes of perturbation-based RTO methods which attempt to directly compensate for plant/model mismatch through adaptation. The proposed approach is applied to two simulation-based case studies: a heat exchanger system and a continuous bioreactor. On présente dans cet article une méthode complète d'analyse de performance pour les technologies d'optimisation en temps réel (RTO), qui comporte des approches systématiques pour l'estimation des bornes de convergence et les effets de performance sur des expériences en ligne utilisées dans une approche RTO donnée. L'analyse de performance est illustrée par une étude de l'approche conventionnelle à deux phases et des techniques représentatives issues des trois catégories principales de méthodes RTO basées sur des perturbations et qui tentent de compenser directement l'incompatibilité usine/modèle par l'adaptation. La méthode proposée est appliquée à deux études de cas basées sur des simulations : un système d'échangeur de chaleur et un bioréacteur continu.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it