University of Cambridge > > Microsoft Research Cambridge, public talks > Syntactic Foundations for Machine Learning

Syntactic Foundations for Machine Learning

Add 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 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

Recent years have seen a rising interest in probabilistic programming languages for applying machine learning to data analysis problems. The promise of these languages is that users only need to write declarative specifications of their probabilistic models, leaving the details to the compiler regarding how to produce customized inference algorithms, which saves countless hours of development effort. In this talk, we present and argue for a new language that exhibits several features that are not simultaneously present in any existing language. These features include the ability to express optimization problems, a rigorous treatment of probability density functions, and a formal language definition. We conclude with some thoughts and questions about the design of future “languages for machine learning”.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity