Quasi-Reliable Estimates of Effective Sample Size

  title={Quasi-Reliable Estimates of Effective Sample Size},
  author={Youhan Fang and Yudong Cao and R. Skeel},
  journal={arXiv: Computation},
The efficiency of a Markov chain Monte Carlo algorithm might be measured by the cost of generating one independent sample, or equivalently, the total cost divided by the effective sample size, defined in terms of the integrated autocorrelation time. To ensure the reliability of such an estimate, it is suggested that there be an adequate sampling of state space--- to the extent that this can be determined from the available samples. A possible method for doing this is derived and evaluated. 

Figures and Tables from this paper

Comparing Markov Chain Samplers for Molecular Simulation
Lifted worm algorithm for the Ising model.
A generalized class of strongly stable and dimension-free T-RPMD integrators
Choice of Damping Coefficient in Langevin Dynamics


Practical Markov Chain Monte Carlo
Rational Construction of Stochastic Numerical Methods for Molecular Sampling
Postprocessed Integrators for the High Order Integration of Ergodic SDEs
  • G. Vilmart
  • Mathematics, Computer Science
  • SIAM J. Sci. Comput.
  • 2015
A generalized guided Monte Carlo algorithm
The computation of averages from equilibrium and nonequilibrium Langevin molecular dynamics
Hybrid Monte Carlo
Monte Carlo Methods in Statistical Mechanics: Foundations and New Algorithms
Exponential convergence of Langevin distributions and their discrete approximations
Bayesian Data Analysis
The Fokker-Planck Equation