analiza aiqbench
This research applies conditional normalizing flows to accelerate the Stochastic Simulation Algorithm (SSA) for chemical reaction networks by learning coarse-grained transition kernels directly from simulation data. By decoupling the time step from microscopic reaction events, the method significantly reduces computational costs while maintaining statistical consistency in trajectory generation. This represents a practical convergence of generative machine learning with stochastic dynamical systems to solve high-cost simulation problems.
Data-driven Effective Modeling of Stochastic Chemical Reaction Networks
arXiv:2608.25421v1 Announce Type: cross Abstract: The Stochastic Simulation Algorithm (SSA), widely considered an exact algorithm for stochastic chemical reaction networks, suffers from high computational cost. In this work, we propose a data-driven effective model that operates on a user-defined coarse time step independent of the underlying microscopic reaction-event scale. This is accomplished by directly approximating the finite-time transition kernel of the continuous-time Markov chain induced by SSA, using a generative machine learning model trained on short bursts of SSA simulation data. The trained model constructs a stochastic propagator that recursively generates statistically consistent trajectories at the constant coarse time step, with significantly reduced computational cost. In this paper, we employ conditional normalizing flow as the stochastic propagator. A comprehensive set of numerical examples is presented to demonstrate the accuracy and efficiency of the proposed method.
Abstract:The Stochastic Simulation Algorithm (SSA), widely considered an exact algorithm for stochastic chemical reaction networks, suffers from high computational cost. In this work, we propose a data-driven effective model that operates on a user-defined coarse time step independent of the underlying microscopic reaction-event scale. This is accomplished by directly approximating the finite-time transition kernel of the continuous-time Markov chain induced by SSA, using a generative machine learning model trained on short bursts of SSA simulation data. The trained model constructs a stochastic propagator that recursively generates statistically consistent trajectories at the constant coarse time step, with significantly reduced computational cost. In this paper, we employ conditional normalizing flow as the stochastic propagator. A comprehensive set of numerical examples is presented to demonstrate the accuracy and efficiency of the proposed method.
Numerical Analysis (math.NA); Machine Learning (cs.LG); Dynamical Systems (math.DS)
arXiv:2608.25421 [math.NA]
(or arXiv:2608.25421v1 [math.NA] for this version)
https://doi.org/10.48550/arXiv.2608.25421 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 230 cuvinte
Subiecte conexe
Synthesis Superintelligence: from Semiconductors to Superconductors — Periodic Labs’ Liam Fedus and Ekin Dogus Cubuk
Latent Space · 8 oct. 2026
Does preservation make sense before we know how to revive?
LessWrong · 15 iun. 2026

XtalPi Holdings Limited: XtalPi Holdings Announces 2026 Interim Results
finanznachrichten.de · 19 aug. 2026
Tracking large chemical reaction networks and rare events by neural networks
arXiv · 15 oct. 2026