Efficient Machine Learning with High Order and Combinatorial Structures
- π€ Speaker: Danny Tarlow
- π Date & Time: Thursday 05 April 2012, 09:30 - 10:30
- π Venue: Large lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
Abstract
Two challenges facing machine learning researchers are (a) how to build models that more accurately reflect prior beliefs and constraints relevant to the domain being modeled, and (b) how to model more complexly structured data. In both of these cases, there are tradeoffs between the expressibility of the model and the computational efficiency of learning and inference procedures. In this talk, I will discuss several recent approaches towards building more expressive and more efficient models of structured domains. The focus will be on learning and inference procedures for models that have non-local (high order) and/or combinatorial structure.
Series This talk is part of the Microsoft Research Cambridge, public talks series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- Guy Emerson's list
- Interested Talks
- Large lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
- Microsoft Research Cambridge, public talks
- ndk22's list
- ob366-ai4er
- Optics for the Cloud
- personal list
- PMRFPS's
- rp587
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Danny Tarlow
Thursday 05 April 2012, 09:30-10:30