Inducing Probabilistic Programs by Bayesian Program Merging

Details Inducing Probabilistic Programs by Bayesian Program Merging Inducing Probabilistic Programs by Bayesian Program Merging

2011-10-25

arxiv.org/abs/1110.5667v1

Computer Science

Artificial Intelligence

Scientific paper

This report outlines an approach to learning generative models from data. We express models as probabilistic programs, which allows us to capture abstract patterns within the examples. By choosing our language for programs to be an extension of the algebraic data type of the examples, we can begin with a program that generates all and only the examples. We then introduce greater abstraction, and hence generalization, incrementally to the extent that it improves the posterior probability of the examples given the program. Motivated by previous approaches to model merging and program induction, we search for such explanatory abstractions using program transformations. We consider two types of transformation: Abstraction merges common subexpressions within a program into new functions (a form of anti-unification). Deargumentation simplifies functions by reducing the number of arguments. We demonstrate that this approach finds key patterns in the domain of nested lists, including parameterized sub-functions and stochastic recursion.

Affiliated with

Also associated with

No associations

Rating

Inducing Probabilistic Programs by Bayesian Program Merging does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inducing Probabilistic Programs by Bayesian Program Merging, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inducing Probabilistic Programs by Bayesian Program Merging will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-716778