Zero-Variance Principle for Monte Carlo Algorithms

By R. Assaraf, Michel Caffarel. 1999

We present a general approach to greatly increase at little cost the efficiency of Monte Carlo algorithms. To each observable to be computed we associate a renormalized observable (improved estimator) having the same average but a different variance. By writing down the zero-variance condition a fundamental equation determining the optimal choice for the renormalized observable is derived (zero-variance principle for each observable separately). We show, with several examples including classical and quantum Monte Carlo calculations, that the method can be very powerful.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

  1. Chris J. Oates
  2. Qiang Liu
  3. Mark A. Girolami
  4. Dustin Tran
  5. Theodore Papamarkou
  6. David M. Blei
  7. Rajesh Ranganath
  8. Nial Friel

Citations in the corpus