Rare Event Analysis via Stochastic Optimal Control

• URL: http://arxiv.org/abs/2604.13213v1
• Date: Tue, 14 Apr 2026 18:34:38 GMT
• Title: Rare Event Analysis via Stochastic Optimal Control
• Abstract summary: We introduce a framework that casts committor estimation as an optimal control (SOC) problem.<n>We develop two complementary objectives: a direct backpropagation loss and a principled off-policy Value Matching loss.<n>On benchmark systems, the framework yields more accurate committor estimates, reaction rates, and equilibrium constants than existing methods.
• Score: 39.211234628277744
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Rare events such as conformational changes in biomolecules, phase transitions, and chemical reactions are central to the behavior of many physical systems, yet they are extremely difficult to study computationally because unbiased simulations seldom produce them. Transition Path Theory (TPT) provides a rigorous statistical framework for analyzing such events: it characterizes the ensemble of reactive trajectories between two designated metastable states (reactant and product), and its central object--the committor function, which gives the probability that the system will next reach the product rather than the reactant--encodes all essential kinetic and thermodynamic information. We introduce a framework that casts committor estimation as a stochastic optimal control (SOC) problem. In this formulation the committor defines a feedback control--proportional to the gradient of its logarithm--that actively steers trajectories toward the reactive region, thereby enabling efficient sampling of reactive paths. To solve the resulting hitting-time control problem we develop two complementary objectives: a direct backpropagation loss and a principled off-policy Value Matching loss, for which we establish first-order optimality guarantees. We further address metastability, which can trap controlled trajectories in intermediate basins, by introducing an alternative sampling process that preserves the reactive current while lowering effective energy barriers. On benchmark systems, the framework yields markedly more accurate committor estimates, reaction rates, and equilibrium constants than existing methods.

Related papers

• IADD-TR: Intervention-Aware Dynamics Decoupling with Targeted Regularization for Model-Based Reinforcement Learning [57.16513298507272]
  We propose IADD-TR, a unified framework combining Intervention-Aware Dynamics Decoupling (IADD) and Targeted Regularization (TR)<n>IADD factorizes transitions into an action-intervention stage and an action-free natural evolution stage, using a zero-action anchor to resolve the non-uniqueness of this two-stage factorization for robust generalization.<n>For policy learning, we derive TR from the efficient influence function of a replay-state policy-gradient functional.
  arXiv  Detail & Related papers  (2026-08-11T08:20:02Z)
• Reactive Flux Matching: Mechanism Discovery and Adaptive Sampling of Rare Events [13.883896077426597]
  We introduce Flux Matching, a framework that learns two complementary objects directly from reactive trajectory data.<n>F Flux Matching is validated through the generation of current velocity trajectories and rate constant calculations on molecular systems.
  arXiv  Detail & Related papers  (2026-06-04T15:31:50Z)
• Entropy Polarity in Reinforcement Fine-Tuning: Direction, Asymmetry, and Control [77.8471519867791]
  Empirically, we show that entropy polarity reliably predicts entropy changes.<n>We propose Polarity-Aware Policy Optimization (PAPO), which preserves both polarity branches and implements entropy control through advantage reweighting.
  arXiv  Detail & Related papers  (2026-05-12T08:47:05Z)
• Generative optimal transport via forward-backward HJB matching [0.23332469289621782]
  Controlling the evolution of a many-body system from a disordered reference state to a structured target ensemble, arises naturally in non-equilibrium statistical mechanics and control.<n>We present a framework that provides a physically interpretable description of transport in terms of path-space free energy, risk-sensitive control, and spatial cost geometry.<n>Our results establish a unifying connection between optimal control, Schrdinger bridge theory, and non-equilibrium statistical mechanics.
  arXiv  Detail & Related papers  (2026-04-09T03:31:25Z)
• Driving Reaction Trajectories via Latent Flow Matching [21.71509185571088]
  LatentRxnFlow is a new reaction prediction paradigm that models reactions as continuous latent trajectories anchored at the thermodynamic product state.<n>LatentRxnFlow achieves strong accuracy with improved transparency, diagnosability, and uncertainty awareness.
  arXiv  Detail & Related papers  (2026-02-11T03:28:20Z)
• Rediscovering Entropy Regularization: Adaptive Coefficient Unlocks Its Potential for LLM Reinforcement Learning [55.59724323303857]
  We propose a framework that balances exploration and exploitation via three components: difficulty-aware coefficient allocation, initial-anchored target entropy, and dynamic global coefficient adjustment.<n>Experiments on multiple mathematical reasoning benchmarks show that AER consistently outperforms baselines, improving both reasoning accuracy and exploration capability.
  arXiv  Detail & Related papers  (2025-10-13T03:10:26Z)
• Drift No More? Context Equilibria in Multi-Turn LLM Interactions [58.69551510148673]
  contexts drift is the gradual divergence of a model's outputs from goal-consistent behavior across turns.<n>Unlike single-turn errors, drift unfolds temporally and is poorly captured by static evaluation metrics.<n>We show that multi-turn drift can be understood as a controllable equilibrium phenomenon rather than as inevitable decay.
  arXiv  Detail & Related papers  (2025-10-09T04:48:49Z)
• Learning from Samples: Inverse Problems over measures via Sharpened Fenchel-Young Losses [20.246040671823557]
  We introduce a new class of loss functions, called sharpened Fenchel-Young losses, which measure the sub-optimality gap of the optimization problem over the space of probability measures.<n>We provide explicit stability guarantees for two relevant settings in the context of optimal transport.<n>We present optimization algorithms specifically tailored to efficiently solve iUOT and iJKO problems.
  arXiv  Detail & Related papers  (2025-05-11T21:26:44Z)
• Electron flow matching for generative reaction mechanism prediction obeying conservation laws [8.136277960071032]
  This work recasts the problem of reaction prediction as a problem of electron redistribution using the modern deep generative framework of flow matching.<n>Our model, FlowER, overcomes limitations by enforcing exact mass conservation, thereby resolving hallucinatory failure modes.<n>FlowER additionally enables estimation of thermodynamic or kinetic feasibility and manifests a degree of chemical intuition in reaction prediction tasks.
  arXiv  Detail & Related papers  (2025-02-18T16:01:17Z)
• Time-series Generation by Contrastive Imitation [87.51882102248395]
  We study a generative framework that seeks to combine the strengths of both: Motivated by a moment-matching objective to mitigate compounding error, we optimize a local (but forward-looking) transition policy. At inference, the learned policy serves as the generator for iterative sampling, and the learned energy serves as a trajectory-level measure for evaluating sample quality.
  arXiv  Detail & Related papers  (2023-11-02T16:45:25Z)
• Gaussian Process-based Min-norm Stabilizing Controller for Control-Affine Systems with Uncertain Input Effects and Dynamics [90.81186513537777]
  We propose a novel compound kernel that captures the control-affine nature of the problem. We show that this resulting optimization problem is convex, and we call it Gaussian Process-based Control Lyapunov Function Second-Order Cone Program (GP-CLF-SOCP)
  arXiv  Detail & Related papers  (2020-11-14T01:27:32Z)

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.