Simple Monte Carlo and the Metropolis Algorithm
Peter Mathe, Erich Novak
Abstract
We study the integration of functions with respect to an unknown density. We compare the simple Monte Carlo method (which is almost optimal for a certain large class of inputs) and compare it with the Metropolis algorithm (based on a suitable ball walk). Using MCMC we prove (for certain classes of inputs) that adaptive methods are much better than nonadaptive ones. Actually, the curse of dimension (for nonadaptive methods) can be broken by adaption.
Create a lesson
Related papers
Real-Arithmetic Sketched Eigensolvers for Symmetric Matrices
Jingyu Liu, Yuqi Liu
The ReLU Matrix Decomposition: NP-Hardness, Ill-Posedness, and ReLU-Rank
Giovanni Seraghiti, Arnaud Vandaele, Nicolas Gillis
Finite Volume Convergence for a Heat Equation with a Measure-Valued Source
Matthias Gobbert, Martin Kruž\'ık, Andreas Meister et al.
A Hybridizable Discontinuous Galerkin Method for Time-Modulated Drude--Lorentz Media
Jeonghun J. Lee
High-order positivity-preserving well-balanced schemes: combining flux globalization with modified Patankar deferred correction methods
Philipp Öffner, Michael Redle, Davide Torlo
An IMEX multi-level domain-decomposition method for the Boltzmann equation on unstructured meshes
Domenico Caparello, Lorenzo Pareschi, Thomas Rey