Can a Computer “Learn” Nonlinear Chromatography?: Experimental Validation of Physics-Based Deep Neural Networks for the Simulation of Chromatographic Processes
Bibliographic record
Abstract
This article presents the capabilities of machine learning in addressing the challenges related to the accurate description of adsorption equilibria in the design of chromatographic processes. Our previously developed physics-based artificial neural network framework for adsorption and chromatography emulation (PANACHE) approach is extended to simulate the dynamics of chromatographic columns without using adsorption isotherms. The incorporation of underlying conservation laws in the form of a physics-constrained loss function during training enables PANACHE models to infer the complex dynamics of chromatographic columns, even without the knowledge of adsorption isotherms. The isotherm-agnostic abilities of PANACHE models are tested by considering two binary systems with complex adsorption equilibria: 1) mixed Langmuir M 1 -type binary system and 2) Tröger’s base enantiomers on Chiralpak AD that show inflection in the isotherm. For each case study, unique feed-forward deep neural networks with an input layer, five hidden layers, and an output layer are trained for two solute components using the elution data either from simulations or experiments. The results show that PANACHE models are successful in predicting the dynamics of binary solute mixtures in chromatographic columns even in the absence of adsorption isotherms, with prediction errors in the order of 10 –2 in the measure of relative L 2 -norm, for most of the cases. The ability of PANACHE models to infer the adsorption isotherms is also demonstrated.
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.004 |
| 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.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".