University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Meta-Interpretive Learning and Program Induction

Meta-Interpretive Learning and Program Induction

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

This talk will review work at Imperial College on the development of Meta-Interpretive Learning (MIL), a technique which supports efficient predicate invention and learning of recursive logic programs by way of abduction with respect to a meta-interpreter. The approach has been applied to the learning of regular and context-free grammars, and further extended to learn dyadic datalog programs. An extension of the approach uses a meta-interpreter of Stochastic Logic Programs (SLP) to implement a Bayesian posterior distribution over the hypothesis space. An ongoing application of MIL technology will be described in which MIL technology is applied to incrementally learn a series of string transformation program induction problems previously studied by Sumit Gulwani (Microsoft Redmond). In this case learning is constrained to the provision of a small number of examples supplied by a spreadsheet user.

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-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity