University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Generative probabilistic programming: applications and new ideas

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Generative probabilistic programming: applications and new ideas

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

Probabilistic programming has recently attracted much attention in Computer Science and Machine Learning communities. I will briefly demonstrate two generative probabilistic graphics programs (models), which I contributed to develop. Then I will present ideas on two research directions I am interested in pursuing: a path to scaling up general-purpose approximate inference in probabilistic programs using parallelism, and a path to automatic programming via general-purpose approximate inference.

This is based on joint work with Frank Wood, Vikash Mansinghka, Tejas Kulkarni, Daniel Selsam, Joshua Tenenbaum, et al.

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 lists

HCR + ONLINE - Details to be sent by email Average on weekdays: 8953.83421053 kWh GR-05, Faculty of English, 9 West Rd (Sidgwick Site)

Other talks

Coming soon Science & the Public in Action: Can and should climate scientists be activists? Thelocactus title abstract tba Proteomics: Expression Analysis and Subcellular Localisation Title to be confirmed
 

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