University of Cambridge > > Isaac Newton Institute Seminar Series > Step size control for Newton type MCMC samplers Jonathan Goodman

Step size control for Newton type MCMC samplers Jonathan Goodman

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

GCS - Geometry, compatibility and structure preservation in computational differential equations

ABSTRACT : MCMC sampling can use ideas from the optimization community.  Optimization via Newton’s method can fail without line search, even for smooth strictly convex problems.  Affine invariant Newton based MCMC sampling uses a Gaussian proposal based on a quadratic model of the potential using the local gradient and Hessian.  This can fail (conjecture: give a transient Markov chain) even for smooth strictly convex potentials.  We describe a criterion that allows a sequence of proposal distributions from X_n with decreasing “step sizes” until (with probability 1) a proposal is accepted.  “Very detailed balance” allows the whole process to preserve the target distribution.  The method works in experiments but the theory is missing.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity