|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Efficient Sampling with Kernel Herding
If you have a question about this talk, please contact Zoubin Ghahramani.
The herding algorithm was proposed as a deterministic dynamic system that integrates learning and inference for discrete Markov Random Fields. In this talk, we take a dual view of herding and extend it to continuous spaces by using the kernel trick. The resulting “kernel herding” is an infinite memory deterministic algorithm that approximates a PDF with a collection of samples. We show that kernel herding decreases the error of expectations of functions in the Hilbert space much faster than the usual iid random samples. If time permits, I’ll also talk about the recent development and applications of the herding algorithm.
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 listsIntroduction to Fractional Calculus Cambridge Cancer Centre seminars Beyond Profit
Other talksFlexible Electronics Based On Polycrystalline Silicon And Integration Technologies For Smart Electronic Systems Digital Literacy - A Cultural Perspective on Knowledge Mediation Duplicating the Human genome: The Origin Recognition Complex et al Putting life into numbers - how statistical science has transformed health care Winton 2nd Annual Symposium on Materials Discovery Localization of electronic excitations in organic semiconductors: theoretical views from different angles