A-Star Sampling Review
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Zoubin Ghahramani.
In this talk we review the A-Star Sampling algorithm. We consider in more depth its connection to adative rejection algorithms that use the same information, and conjecture why A-Star Sampling appears to make more efficient use of this information. We also discuss how we might chain A-Star Sampling runs to exploit structure when sampling from graphical models.
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.
|