Efficient Subset Simulation using Hamiltonian Neural Network enhanced Markov Chain Monte Carlo Methods
Conference
·
OSTI ID:2396329
- RWTH Aachen University
- Johns Hopkins University
- Idaho National Laboratory
The Monte Carlo method delivers an unbiased estimate of the probability of failure. However, the variance of the estimate depends on the number of evaluated samples. This number must be very large for estimations of a low probability of failure. If the evaluation of each sample is computationally expensive, the crude Monte Carlo simulation strategy is impracticable. Therefore, subset simulations are used to reduce the required number of evaluations. Subset simulations require a Markov Chain Monte Carlo sampler, such as the random walk Metropolis-Hastings algorithm. The algorithm, however, struggles with sampling in low-probability regions, especially if they are narrow. As a consequence, advanced Markov Chain Monte Carlo simulations have been developed. In particular, the Hamiltonian Monte Carlo method explores the target distribution rapidly. Driven by the idea of Hamiltonian dynamics, this sampler provides a non-random walk through the target distribution. The incorporation of subset simulation and Hamiltonian Monte Carlo methods has shown promising results for reliability analysis. One downside of the Hamiltonian Monte Carlo method is that gradient evaluations are computationally expensive, especially when dealing with high-dimensional problems and evaluating long trajectories. We show that integrating Hamiltonian neural networks in Hamiltonian Monte Carlo simulations significantly speeds up the sampling task. Furthermore, the enhancement of adaptive trajectory length within the Hamiltonian Monte Carlo results in the efficient proposal of the following states. Based on this recent enhancement, we provide a fast sampling strategy for subset simulations using Hamiltonian neural networks to replace the evaluation of the gradient and significantly speed up the Hamiltonian Monte Carlo simulation.
- Research Organization:
- Idaho National Laboratory (INL), Idaho Falls, ID (United States)
- Sponsoring Organization:
- 58
- DOE Contract Number:
- AC07-05ID14517
- OSTI ID:
- 2396329
- Report Number(s):
- INL/CON-23-70933-Rev000
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficient cosmological parameter estimation with Hamiltonian Monte Carlo technique
Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs
Journal Article
·
Sun Apr 15 00:00:00 EDT 2007
· Physical Review. D, Particles Fields
·
OSTI ID:21020367
Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs
Journal Article
·
Fri Feb 14 23:00:00 EST 2014
· Journal of Computational Physics
·
OSTI ID:22230867