Fetching the paper…
Reading the bibliography…
We develop a technique for generalising from data in which models are samplers represented as program text.
A note on the generation of random normal deviates
George EP Box, Mervin E Muller, et al · 1958
Earlier work this paper cites.
A convenient method for generating normal variables
George Marsaglia and Thomas A Bray · 1964
Earlier work this paper cites.
Non-uniform random variate generation, 1986
Luc Devroye · 1986
Earlier work this paper cites.
Simplifying decision trees
J. Ross Quinlan · 1987
Earlier work this paper cites.
Simulated annealing
Peter JM Van Laarhoven and Emile HL Aarts · 1987
Earlier work this paper cites.
Efficient induction of logic programs
Stephen Muggleton and Cao Feng · 1992
Earlier work this paper cites.
Inductive logic programming: Theory and methods
Stephen Muggleton and Luc De Raedt · 1994
Earlier work this paper cites.
Stochastic logic programs
Stephen Muggleton · 1996
Earlier work this paper cites.
The art of computer programming, 3rd edn., vol. 2
Donald E Knuth · 1998
Earlier work this paper cites.
Markov chain monte carlo without likelihoods
Paul Marjoram, John Molitor, Vincent Plagnol, and Simon Tavaré · 2003
Earlier work this paper cites.
An inductive logic programming approach to statistical relational learning
Kristian Kersting · 2005
Earlier work this paper cites.
Functional genetic programming with combinators
Forrest Briggs and Melissa O’neill · 2006
Earlier work this paper cites.
Adaptor grammars: A framework for specifying compositional nonparametric bayesian models
Mark Johnson, Thomas L Griffiths, and Sharon Goldwater · 2007
Cited alongside, same era.
Church: A language for generative models
Noah D. Goodman, Vikash K. Mansinghka, Daniel M. Roy, Keith Bonawitz, and Joshua B. Tenenbaum · 2008
Cited alongside, same era.
Probabilistic inductive logic programming
Luc De Raedt and Kristian Kersting · 2008
Cited alongside, same era.
A field guide to genetic programming
Riccardo Poli, William B Langdon, Nicholas F McPhee, and John R Koza · 2008
Cited alongside, same era.
Analytical inductive functional programming
Emanuel Kitzelmann · 2009
Cited alongside, same era.
Natively probabilistic computation
Vikash Kumar Mansinghka · 2009
Cited alongside, same era.
Inducing probabilistic programs by Bayesian program merging
Irvin Hwang, Andreas Stuhlmüller, and Noah D Goodman · 2011
Later among the works it cites.
Exploiting compositionality to explore a large space of model structures
Roger Grosse, Ruslan R Salakhutdinov, William T Freeman, and Joshua B Tenenbaum · 2012
Later among the works it cites.
A survey of monte carlo tree search methods
Cameron B Browne, Edward Powley, Daniel Whitehouse, Simon M Lucas, Peter I Cowling, Philipp Rohlfshagen, Stephen Tavener, Diego Perez, Spyridon Samothrakis, and Simon Colton · 2012
Later among the works it cites.
Structure discovery in nonparametric regression through compositional kernel search
David Duvenaud, James Robert Lloyd, Roger Grosse, Joshua B Tenenbaum, and Zoubin Ghahramani · 2013
Later among the works it cites.
UCI machine learning repository, 2013
K. Bache and M. Lichman · 2013
Later among the works it cites.
Bootstrap learning via modular concept discovery
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Learning programs: A hierarchical Bayesian approach
Percy Liang, Michael I Jordan, and Dan Klein · 2010
Cited alongside, same era.
Particle Markov chain Monte Carlo methods
Christophe Andrieu, Arnaud Doucet, and Roman Holenstein · 2010
Cited alongside, same era.
Incremental learning in inductive programming
Robert Henderson · 2010
Cited alongside, same era.
Lightweight implementations of probabilistic programming languages via transformational compilation
David Wingate, Andreas Stuhlmueller, and Noah D Goodman · 2011
Cited alongside, same era.
Magichaskeller: System demonstration
Susumu Katayama · 2011
Cited alongside, same era.
Eyal Dechter, Jon Malmaud, Ryan P Adams, and Joshua B Tenenbaum · 2013
Later among the works it cites.
A new approach to probabilistic programming inference
Frank Wood, Jan Willem van de Meent, and Vikash Mansinghka · 2014
Closest in time.
Venture: a higher-order probabilistic programming platform with programmable inference
Vikash Mansinghka, Daniel Selsam, and Yura Perov · 2014
Closest in time.
A compilation target for probabilistic programming languages
Brooks Paige and Frank Wood · 2014
Closest in time.
Approaches and Applications of Inductive Programming (Dagstuhl Seminar 13502)
Sumit Gulwani, Emanuel Kitzelmann, and Ute Schmid · 2014
Closest in time.
Structured generative models of natural source code
Chris J Maddison and Daniel Tarlow · 2014
Closest in time.