COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Computational foundations of Bayesian inference and probabilistic programming
Computational foundations of Bayesian inference and probabilistic programmingAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins. This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending The complexity, scale, and variety of data sets we now have access to have grown enormously, and present exciting opportunities for new applications. Just as high-level programming languages and compilers empowered experts to solve computational problems more quickly, and made it possible for non-experts to solve them at all, a number of high-level probabilistic programming languages with computationally universal inference engines have been developed with the potential to similarly transform the practice of Bayesian statistics. These systems provide formal languages for specifying probabilistic models compositionally, and general algorithms for turning these specifications into efficient algorithms for inference. In this talk, I will address three key questions at the theoretical and algorithmic foundations of probabilistic programming—-and probabilistic modelling more generally—-that can be answered using tools from probability theory, computability and complexity theory, and nonparametric Bayesian statistics. Which Bayesian inference problems can be automated, and which cannot? Can probabilistic programming languages represent the stochastic processes at the core of state-of-the-art nonparametric Bayesian models? And if not, can we construct useful approximations? I’ll close by relating these questions to other challenges and opportunities ahead at the intersections of computer science, statistics, and probability. This talk is part of the Microsoft Research Cambridge, public talks series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsArrol Adam Lectures - 'Responses to the First World War' Cambridge University Algorithmic Trading Society list srg Economics Modern Greek Lecture Series FERSA Kaleidoscope ConferenceOther talksmTORC1 signaling coordinates different POMC neurons subpopulations to regulate feeding Access to Medicines Zoo and Wildlife Work Developing a single-cell transcriptomic data analysis pipeline Adaptation in log-concave density estimation Cambridge - Corporate Finance Theory Symposium September 2017 - Day 2 From Euler to Poincare An SU(3) variant of instanton homology for webs Asclepiadaceae Political Thought, Time and History: An International Conference |