Kernel Thinning and Stein Thinning

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

• Lester Mackey (Microsoft Research)
• Friday 15 October 2021, 16:00-17:00
• https://maths-cam-ac-uk.zoom.us/j/93998865836?pwd=VzVzN1VFQ0xjS3VDdlY0enBVckY5dz09.

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

This talk will introduce two new tools for summarizing a probability distribution more effectively than independent sampling or standard Markov chain Monte Carlo thinning:

1. Given an initial n point summary (for example, from independent sampling or a Markov chain), kernel thinning finds a subset of only square-root n points with comparable worst-case integration error across a reproducing kernel Hilbert space.

2. If the initial summary suffers from biases due to off-target sampling, tempering, or burn-in, Stein thinning simultaneously compresses the summary and improves the accuracy by correcting for these biases.

These tools are especially well-suited for tasks that incur substantial downstream computation costs per summary point like organ and tissue modeling in which each simulation consumes 1000s of CPU hours.

This talk is part of the Statistics series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge talks
• Chris Davis' list
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Guy Emerson's list
• Hanchen DaDaDash
• Interested Talks
• Machine Learning
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Statistics
• Statistics Group
• bld31
• custom
• https://maths-cam-ac-uk.zoom.us/j/93998865836?pwd=VzVzN1VFQ0xjS3VDdlY0enBVckY5dz09
• rp587

Note that ex-directory lists are not shown.