University of Cambridge > Talks.cam > Machine Learning @ CUED > A* Sampling

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

A* Sampling

Download to your calendar using vCal

If you have a question about this talk, please contact Zoubin Ghahramani .

The problem of drawing samples from a discrete distribution can be converted into a discrete optimization problem. In this work, we show how sampling from a continuous distribution can be converted into an optimization problem over continuous space. Central to the method is a stochastic process recently described in mathematical statistics that we call the Gumbel process. We present a new construction of the Gumbel process and A-star sampling, a practical generic sampling algorithm that searches for the maximum of a Gumbel process using A-star search. We analyze the correctness and convergence time of A-star sampling and demonstrate empirically that it makes more efficient use of bound and likelihood evaluations than the most closely related adaptive rejection sampling-based algorithms.

This talk is part of the Machine Learning @ CUED series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

School of Pythagoras, St John's College, CB2 1TP St John's College Lightfoot Room Betty and Gordon Moore Library Wilberforce Road Cambridge CB3 0WD

Other talks

Human monogamy in mammalian context Complete and Submit Project Choice Forms In conversation: Louis Herns Marcelin and Ola Osman on legacies of enslavement and contemporary violence in Liberia and Haiti Title to be confirmed Favourite Plants: the common, the captivating, and the curious Online Causal Inference Seminar
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity