Transition Path Sampling Using Koopman Operators and Exit-Time Optimal Control

arXiv:2610.10054 · eess.SY, cs.LG, cs.SY, stat.ML · Submitted 2026-10-07 · Read on arXiv

eess.SY, cs.LG, cs.SY, stat.ML

Submitted: 2026-10-07

Updated: 2026-10-07

Comments: 30 pages, 6 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Core — 16× in this paper · explained in 2 episodes
• Diffusion Process — 6× in this paper · explained in 2 episodes
• Hilbert Space — 4× in this paper · explained in 2 episodes
• Langevin Dynamics — 3× in this paper · explained in 3 episodes
• Benchmark — 2× in this paper · explained in 2 episodes
• Metastability — 2× in this paper · explained in 3 episodes
• Regularization — 2× in this paper · explained in 3 episodes
• Verification — 2× in this paper · explained in 2 episodes
• Admissibility — 1× in this paper · explained in 2 episodes
• Clustering — 1× in this paper · explained in 2 episodes
• Diffusion Processes — 1× in this paper · explained in 2 episodes
• Dynamic Mode Decomposition (DMD) — 1× in this paper · explained in 4 episodes
• Fidelity — 1× in this paper · explained in 2 episodes
• Information-Theoretic Framework — 1× in this paper · explained in 2 episodes
• Spectral Gap — 1× in this paper · explained in 5 episodes

Sources

• Rare Event Analysis via Stochastic Optimal Control

Related papers

• One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
• A Geometric Decision Procedure for STL Feasibility and Repair
• Scaling up statistical model checking of cyber-physical systems via algorithm ensemble and parallel simulations over HPC infrastructures
• From Asymptotic to Designer-Assigned-Time Control: A Review of Stability Notions, Design Mechanisms, and Controller Architectures
• Battery Second Life: A Review of Experimental Studies
• Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems