DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2018 · 82 citations · 30 references
Natural SciencesPhysicsComputational PhysicsOptimizationStochastic ProcessesApproximation AlgorithmsApproximation MethodsConvex OptimizationMonte Carlo MethodsMonte Carlo SimulationNumerical ConvergenceCondition Number AnalysisConvex RelaxationsHamiltonian Monte CarloMonte Carlo SamplingOptimal Convergence Rates
We study Hamiltonian Monte Carlo (HMC) for sampling from a strongly logconcave density proportional to e^{-f} where f:R^d -> R is mu-strongly convex and L-smooth (the condition number is kappa = L/mu). We show that the relaxation time (inverse of the spectral gap) of ideal HMC is O(kappa), improving on the previous best bound of O(kappa^{1.5}); we complement this with an example where the relaxation time is Omega(kappa). When implemented using a nearly optimal ODE solver, HMC returns an epsilon-approximate point in 2-Wasserstein distance using O~((kappa d)^{0.5} epsilon^{-1}) gradient evaluations per step and O~((kappa d)^{1.5}epsilon^{-1}) total time.
30
Brownian motion in a field of force and the diffusion model of chemical reactions
H. A. Kramers · Physica · 1940 · 8.6K citations
Natural Sciences, Chemistry, Physics +16
Monte Carlo Statistical Methods
Hoon Kim, Christian P. Robert, George Casella · Technometrics · 2000 · 5.6K citations