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

Recurrent Neural Network-Based Joint Chance Constrained Stochastic Model Predictive Control*

2022· article· en· W4289878049 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIFAC-PapersOnLine · 2022
Typearticle
Languageen
FieldEngineering
TopicAdvanced Control Systems Optimization
Canadian institutionsUniversity of Alberta
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsQuantileRecurrent neural networkMathematical optimizationConstraint (computer-aided design)Model predictive controlComputer scienceOptimization problemArtificial neural networkNonlinear systemSolverMathematicsArtificial intelligenceControl (management)Econometrics

Abstract

fetched live from OpenAlex

A novel recurrent neural network (RNN)-based approach is proposed in this work to handle joint chance-constrained stochastic model predictive control (SMPC) problem. In the proposed approach, the joint chance constraint (JCC) is first reformulated as a quantile-based inequality to reduce the complexity in approximation. Then, the quantile function (QF) in the quantile-based inequality is replaced by the empirical QF using sample average approximation (SAA). Afterwards, the empirical QF is approximated via an RNN-based surrogate model, which is embedded into the SMPC problem formulation to predict quantile values at different sampling instants. By employing the RNN-based approximation, the resulting deterministic optimization problem is finally solved through a nonlinear optimization solver. The proposed approach is applied to a hydrodesulphurisation process to demonstrate its efficiency in handling the SMPC problem.

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: Methods · Consensus signal: none
Teacher disagreement score0.948
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.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.011
GPT teacher head0.206
Teacher spread0.195 · 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