MétaCan
Menu
Back to cohort

A robust batch-to-batch optimization framework for pharmaceutical applications

2024· article· en· W4404630784 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

VenueComputers & Chemical Engineering · 2024
Typearticle
Languageen
FieldEngineering
TopicProcess Optimization and Integration
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceProcess engineeringBiochemical engineeringMathematical optimizationMathematicsEngineering

Abstract

fetched live from OpenAlex

The study proposes a robust algorithm for batch-to-batch optimization in the presence of model-mismatch. Robustness is achieved by the implementation of the following features: i — the gradient correction step is modified to consider the gradients of the cost function and constraints at both final and intermediate points, ii — Economic Model Predictive Control is applied to mitigate the impact of unmeasured disturbances on the optimum, and iii — an optimal design of experiments is performed to expedite convergence. Significant improvements of the proposed algorithm in convergence to the process optimum and robustness to noise, unmeasured disturbances, and model error are demonstrated using a fed-batch fermentation for penicillin production. • Traditional batch-to-batch optimization algorithm was enhanced by incorporating 3 novel steps. • Proposed gradient correction reduced noise sensitivity and improved optima. • Economic predictive control is used to reject unmeasured disturbances in the batch. • Application of optimal experimental design reduced costs and time to achieve the optimum. • Fed-batch penicillin process was used to show the improvements in performance.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.128
Threshold uncertainty score0.869

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.001
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.018
GPT teacher head0.255
Teacher spread0.237 · 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