Probing reaction channels via reinforcement learning

• URL: http://arxiv.org/abs/2305.17531v1
• Date: Sat, 27 May 2023 17:22:32 GMT
• Title: Probing reaction channels via reinforcement learning
• Authors: Senwei Liang, Aditya N. Singh, Yuanran Zhu, David T. Limmer, Chao Yang
• Abstract summary: We propose a reinforcement learning based method to identify important configurations that connect reactant and product states along chemical reaction paths. By shooting multiple trajectories from these configurations, we can generate an ensemble of configurations that concentrate on the transition path ensemble. The resulting solution, known as the committor function, encodes mechanistic information for the reaction and can in turn be used to evaluate reaction rates.
• Score: 4.523974776690403
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a reinforcement learning based method to identify important configurations that connect reactant and product states along chemical reaction paths. By shooting multiple trajectories from these configurations, we can generate an ensemble of configurations that concentrate on the transition path ensemble. This configuration ensemble can be effectively employed in a neural network-based partial differential equation solver to obtain an approximation solution of a restricted Backward Kolmogorov equation, even when the dimension of the problem is very high. The resulting solution, known as the committor function, encodes mechanistic information for the reaction and can in turn be used to evaluate reaction rates.

Related papers

• Approximating Families of Sharp Solutions to Fisher's Equation with Physics-Informed Neural Networks [8.487185704099925]
  This paper employs physics-informed neural networks (PINNs) to solve Fisher's equation. The focus is on investigating Fisher's equation under conditions of large reaction rate coefficients. A residual weighting scheme is introduced in the network training to mitigate the difficulties associated with standard PINN approaches.
  arXiv  Detail & Related papers  (2024-02-13T09:17:20Z)
• Differentiable Programming of Chemical Reaction Networks [63.948465205530916]
  Chemical reaction networks are one of the most fundamental computational substrates used by nature. We study well-mixed single-chamber systems, as well as systems with multiple chambers separated by membranes. We demonstrate that differentiable optimisation, combined with proper regularisation, can discover non-trivial sparse reaction networks.
  arXiv  Detail & Related papers  (2023-02-06T11:41:14Z)
• Exploring Complex Dynamical Systems via Nonconvex Optimization [0.0]
  We present an alternative, optimization-driven approach using tools from machine learning. We apply this approach to a novel, fully-optimizable, reaction-diffusion model which incorporates complex chemical reaction networks. This allows us to systematically identify new states and behaviors, including pattern formation, dissipation-maximizing nonequilibrium states, and replication-like dynamical structures.
  arXiv  Detail & Related papers  (2023-01-03T01:35:39Z)
• A Recursively Recurrent Neural Network (R2N2) Architecture for Learning Iterative Algorithms [64.3064050603721]
  We generalize Runge-Kutta neural network to a recurrent neural network (R2N2) superstructure for the design of customized iterative algorithms. We demonstrate that regular training of the weight parameters inside the proposed superstructure on input/output data of various computational problem classes yields similar iterations to Krylov solvers for linear equation systems, Newton-Krylov solvers for nonlinear equation systems, and Runge-Kutta solvers for ordinary differential equations.
  arXiv  Detail & Related papers  (2022-11-22T16:30:33Z)
• Tunable Complexity Benchmarks for Evaluating Physics-Informed Neural Networks on Coupled Ordinary Differential Equations [64.78260098263489]
  In this work, we assess the ability of physics-informed neural networks (PINNs) to solve increasingly-complex coupled ordinary differential equations (ODEs) We show that PINNs eventually fail to produce correct solutions to these benchmarks as their complexity increases. We identify several reasons why this may be the case, including insufficient network capacity, poor conditioning of the ODEs, and high local curvature, as measured by the Laplacian of the PINN loss.
  arXiv  Detail & Related papers  (2022-10-14T15:01:32Z)
• Decimation technique for open quantum systems: a case study with driven-dissipative bosonic chains [62.997667081978825]
  Unavoidable coupling of quantum systems to external degrees of freedom leads to dissipative (non-unitary) dynamics. We introduce a method to deal with these systems based on the calculation of (dissipative) lattice Green's function. We illustrate the power of this method with several examples of driven-dissipative bosonic chains of increasing complexity.
  arXiv  Detail & Related papers  (2022-02-15T19:00:09Z)
• A Grid-Structured Model of Tubular Reactors [61.38002492702646]
  The proposed model may be entirely based on the known form of the partial differential equations or it may contain generic machine learning components such as multi-layer perceptrons. We show that the proposed model can be trained using limited amounts of data to describe the state of a fixed-bed catalytic reactor.
  arXiv  Detail & Related papers  (2021-12-13T19:54:23Z)
• Towards Understanding Theoretical Advantages of Complex-Reaction Networks [77.34726150561087]
  We show that a class of functions can be approximated by a complex-reaction network using the number of parameters. For empirical risk minimization, our theoretical result shows that the critical point set of complex-reaction networks is a proper subset of that of real-valued networks.
  arXiv  Detail & Related papers  (2021-08-15T10:13:49Z)
• Learning second order coupled differential equations that are subject to non-conservative forces [0.0]
  We introduce a network that incorporates a difference approximation for the second order derivative in terms of residual connections between convolutional blocks. We optimize this map together with the solver network, while sharing their weights, to form a powerful framework capable of learning the complex physical properties of a dissipative dynamical system.
  arXiv  Detail & Related papers  (2020-10-17T23:31:31Z)
• Monte-Carlo wavefunction approach for the spin dynamics of recombining radicals [0.0]
  We adapt the Monte-Carlo wavefunction (MCWF) approach to treat the open-system spin dynamics of radical pairs. We show that this type of master equation can be accommodated in the MCWF approach, by introducing a second type of quantum jump.
  arXiv  Detail & Related papers  (2020-05-09T11:01:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.