Active design of dynamic <scp>GP</scp> models for model predictive control using expected improvement
Bibliographic record
Abstract
Abstract Modelling is a basic and key requirement for model‐based controlling, monitoring, or other process strategies. In non‐linear model predictive control (NMPC), although data‐driven models can be more easily established than first‐principle ones, representative data may not be adequately included in advance to train a complete model, which is an attractive research topic. An actively improved Gaussian process (GP) model building strategy is developed, especially for incomplete models based on the idea of Bayesian optimization. The GP model can be used online as the internal model of model predictive control (MPC) directly. The model‐building objective is based on the expected improvement strategy, which can exploit information gained from the currently gathered data as well as explore uncharted regions. The proposed method is a real‐time design of experiments based on variance information of GP for efficient model building with insufficient initial training data for NMPC. Multi‐step ahead prediction model is considered to give full play to predicting features of NPMC. Besides, a novel disturbance rejection strategy is also proposed based on GP outputs. Two simulation results, including comparisons with some traditional algorithms, are presented to demonstrate the effectiveness of the proposed method.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".