Data-driven auto-tuning strategy for RTO-MPC based on Bayesian 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
Real-time optimization (RTO) and model predictive control (MPC) are extensively employed in industrial processes to enhance economic objectives. However, the tuning of the system remains a challenge, in particular, for cases where an explicit model relating the RTO objective and the process dynamics is unknown. To address this issue, an online data-driven auto-tuning strategy leveraging two Bayesian optimization (BO) techniques is proposed. This strategy is useful for situations where the RTO objective and the process dynamics are detectable but their exact functional forms are unclear. The proposed strategy views the RTO objective as a black-box objective and interprets the steady-state conditions as black-box equality constraints within the RTO layer. In this context, the upper-trust-bound based constrained BO (UTB-CBO) method is adopted to optimize the setpoints and enhance solution feasibility. Additionally, the proposed approach can take into account measurable disturbance inputs explicitly and account for their consequential influence on objective optimization by considering disturbance variations as contextual information. Simultaneously, another contextual BO scheme is implemented to automatically tune the MPC controller parameters for improving tracking performance upon accepting the setpoints optimized by the RTO. Simulation results based on a continuous stirred-tank reactor system are given to illustrate the effectiveness of the proposed approach.
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.000 |
| 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