How Sophisticated Are Neural Networks Needed to Predict Long-Term Nonadiabatic Dynamics?
Bibliographic record
Abstract
Nonadiabatic dynamics is key for understanding solar energy conversion and photochemical processes in condensed phases. This often involves the non-Markovian dynamics of the reduced density matrix in open quantum systems, where knowledge of the system's prior states is necessary to predict its future behavior. In this study, we explore time-series machine learning methods for predicting long-time nonadiabatic dynamics based on short-time input data, comparing these methods with the physics-based transfer tensor method (TTM). To understand the impact of memory time on these approaches, we demonstrate that non-Markovian dynamics can be represented as a linear map within the Nakajima-Zwanzig generalized quantum master equation framework. We further propose a practical method to estimate the effective memory time, within a given tolerance, for reduced density matrix propagation. Our predictive models are applied to various physical systems, including spin-boson models, multistate harmonic (MSH) models with Ohmic spectral densities and for a realistic organic photovoltaic system composed of a carotenoid-porphyrin-fullerene triad dissolved in tetrahydrofuran. Results indicate that the simple linear-mapping fully connected neural network (FCN) outperforms the more complicated nonlinear-mapping networks including the gated recurrent unit (GRU) and the convolutional neural network/long short-term memory (CNN-LSTM) in systems with short memory times, such as spin-boson and MSH models. Conversely, the nonlinear CNN-LSTM and GRU models yield higher accuracy in the triad MSH systems characterized by long memory times. These findings offer valuable insights into the role of effective memory time in non-Markovian quantum dynamics, providing practical guidance for the application of time-series machine learning models to complex chemical systems.
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.010 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.007 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".