Accelerated integration of stiff reactive systems using gradient-informed autoencoder and neural ordinary differential equation
Bibliographic record
Abstract
A combined autoencoder (AE) and neural ordinary differential equation (NODE) framework has been used as a data-driven reduced-order model for time integration of a stiff reacting system. In this study, a new loss term using a latent variable gradient is proposed, and its impact on model performance is analysed in terms of robustness, accuracy, and computational efficiency. A data set was generated by a chemical reacting solver, Cantera, for the ignition of homogeneous hydrogen-air and ammonia/hydrogen-air mixtures in homogeneous constant pressure reactors over a range of initial temperatures and equivalence ratios. The AE-NODE network was trained with the data set using two different loss functions based on the latent variable mapping and the latent gradient. The results show that the model trained using the latent gradient loss significantly improves the predictions at conditions outside the range of the trained data. The study demonstrates the importance of incorporating time derivatives in the loss function. Upon proper design of the latent space and training method, the AE+NODE architecture is found to predict the reaction dynamics at high fidelity at substantially reduced computational cost by the reduction of the dimensionality and temporal stiffness.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".