Search arXiv⌕ Search

arXiv · physics/0005073

Efficient Dynamic Importance Sampling of Rare Events in One Dimension

Abstract

Exploiting stochastic path integral theory, we obtain \emph{by simulation} substantial gains in efficiency for the computation of reaction rates in one-dimensional, bistable, overdamped stochastic systems. Using a well-defined measure of efficiency, we compare implementations of ``Dynamic Importance Sampling'' (DIMS) methods to unbiased simulation. The best DIMS algorithms are shown to increase efficiency by factors of approximately 20 for a $5 k_B T$ barrier height and 300 for $9 k_B T$, compared to unbiased simulation. The gains result from close emulation of natural (unbiased), instanton-like crossing events with artificially decreased waiting times between events that are corrected for in rate calculations. The artificial crossing events are generated using the closed-form solution to the most probable crossing event described by the Onsager-Machlup action. While the best biasing methods require the second derivative of the potential (resulting from the ``Jacobian'' term in the action, which is discussed at length), algorithms employing solely the first derivative do nearly as well. We discuss the importance of one-dimensional models to larger systems, and suggest extensions to higher-dimensional systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel M. Zuckerman, Thomas B. Woolf. 2000-10-25. Efficient Dynamic Importance Sampling of Rare Events in One Dimension. https://doi.org/10.1103/physreve.63.016702

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Universal Hamiltonian learning with rotational and basis equivariance

Deep learning has the potential to transform computational materials research by making electronic-structure calculations more efficient and scalable. The Hamiltonian matrix in the localized atomic-orbital basis is a promising target for deep-learning electronic structure, yet enforcing rotational equivariance can be computationally costly, and the matrix depends on the choice of basis set. Here we introduce DeepH-2, a physics-guided neural-network framework that reduces the computational cost of enforcing rotational equivariance through a local-coordinate formulation and incorporates basis equivariance by mapping a shared latent Hamiltonian to the target atomic-orbital basis. DeepH-2 achieves sub-meV test-set error on a diverse materials dataset and demonstrates transferability across material dimensions. These results highlight the value of encoding physics priors into deep-learning electronic structure models, and pave the way for developing the electronic-structure foundation models.

physics.comp-ph↗

Complex Hyperspin Machine and Symmetry Quenching: Benchmark and scaling up to millions of degrees of freedom

Driven-dissipative oscillator networks have been proposed to simulate spin models on physical hardware, mostly focusing on systems of binary (Ising) spins, or systems of spin vectors in low dimensions. The equalized hyperspin machine was recently introduced to provide a single platform to simulate general models of $N$ coupled spin vectors with tunable dimension $D$, realizing dynamical annealing protocols to vary the spin dimensionality in time. These schemes are limited to real spins coupled via real coupling matrices. We propose a generalization of the hyperspin machine that works with complex fields and deals with complex Hermitian coupling matrices, implementing an amplitude equalization scheme. This system, which we name complex hyperspin machine, can work on optimization problems with complex valued hyperspins that can be cast on complex $D$-vector Hamiltonians. We benchmark the machine against a differential evolution (DE) algorithm on complex $D=2$ hyperspins up to $N=80$, showing that the fraction of instances where a lower-energy solution is found grows with system size and coupling density, reaching $92.5\%$ at the largest considered sizes. When the DE finds a lower-energy solution, the machine still reaches a median relative energy deviation that lies between $10^{-15}$ and $10^{-12}$ while running at substantially lower computational cost. Using the complex nature of the field, we introduce a new dimensional reduction protocol that we name symmetry quenching, which collapses complex variables that map to XY spins onto real Ising spins by switching on the parametric pump. We show on Max-Cut instances with known ground states that symmetry quenching outperforms a fixed-pump Ising machine, reaching exact ground states in the presence of equalization. We scale the system to $N=10^6$ hyperspins, or $8\times10^6$ dynamical variables, on a Hermitian sparse two-dimensional lattice.

physics.comp-ph↗

Learning Stiff Dynamical Operators: Scaling, Fast-Slow Excitation, and Eigen-Consistent Neural Models

Stiff dynamical systems represent a central challenge in multi scale modeling across combustion, chemical kinetics, and nonlinear dynamical systems. Neural operator learning has recently emerged as a promising approach to approximate dynamical generators from data, yet stiffness imposes severe obstacles: training errors concentrate on slow manifold states, collapse of fast dynamics occurs, and the learned operator may fail to reproduce the true eigenstructure. We demonstrate three key advances enabling accurate learning of stiff operators and preserving spectral fidelity: (i) stiffness aware scaling of time derivatives, (ii) fast direction excitation via local trajectory cloud bursts, and (iii) autograd-based Jacobian diagnostics ensuring eigenstructure fidelity. Applied to the Davis-Skodje system, the approach recovers both slow and fast modes across stiffness regimes, reducing fast eigenvalue error by an order of magnitude while improving rollout fidelity. These results argue that spectral fidelity - not trajectory accuracy alone - should be a first-class target in data driven learning of stiff operators.

physics.comp-ph↗