Computable Probability Theory

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

• Daniel Roy (MIT)
• Tuesday 28 July 2009, 14:00-15:00
• Engineering Department, CBL Room 438.

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

How much of statistics can we automate? At MIT , I’m working as a member of a team to develop a probabilistic programming language, Church, suitable for rigorously and formally specifying probabilistic models and a language implementation, MIT -Church, capable of performing automatic inference. In this talk, I’ll discuss some of the theoretical limits of this endeavor, in particular work concerning universality, representational equivalence, and computability of conditioning. I might even wax philosophical on the last point.

This is joint work with Nate Ackerman (UPenn) and Cameron Freer (MIT).

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

This talk is included in these lists:

• Seminar
• All Talks (aka the CURE list)
• Biology
• CBL important
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge Neuroscience Seminars
• Cambridge talks
• Chris Davis' list
• Creating transparent intact animal organs for high-resolution 3D deep-tissue imaging
• Engineering Department, CBL Room 438
• Featured lists
• Guy Emerson's list
• Hanchen DaDaDash
• Inference Group Summary
• Information Engineering Division seminar list
• Interested Talks
• Joint Machine Learning Seminars
• Life Science
• Life Sciences
• ML
• Machine Learning @ CUED
• Machine Learning Summary
• Neuroscience
• Neuroscience Seminars
• Neuroscience Seminars
• Required lists for MLG
• Simon Baker's List
• Stem Cells & Regenerative Medicine
• Trust & Technology Initiative - interesting events
• bld31
• dh539
• kt532's list
• ndk22's list
• ob366-ai4er
• rp587
• yk373's list

Note that ex-directory lists are not shown.