University of Cambridge > Talks.cam > Machine Learning @ CUED > Title to be confirmed

Title to be confirmed

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

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

This talk has been canceled/deleted

In this informal talk we derive a streaming version of A Sampling to motivate an abstraction of Gumbel producing processes, working name Gumbel machines. We review OS, discuss the efficiency of A* on toy examples, and speculate how Gumbel Machines might be chained with the long term goal of sampling efficiently from arbitrary continuous chain or tree structured graphical models.

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

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.

 

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