Probabilistic programming with programmable inference

By Vikash K. Mansinghka, Ulrich Schaechtle, Shivam Handa, Alexey Radul, Yutian Chen, Martin C. Rinard. 2018

63 citations recorded by the source corpus.

We introduce inference metaprogramming for probabilistic programming languages, including new language constructs, a formalism, and the rst demonstration of e ectiveness in practice. Instead of relying on rigid black-box inference algorithms hard-coded into the language implementation as in previous probabilistic programming languages, infer- ence metaprogramming enables developers to 1) dynamically decompose inference problems into subproblems, 2) apply in- ference tactics to subproblems, 3) alternate between incorpo- rating new data and performing inference over existing data, and 4) explore multiple execution traces of the probabilis- tic program at once. Implemented tactics include gradient- based optimization, Markov chain Monte Carlo, variational inference, and sequental Monte Carlo techniques. Inference metaprogramming enables the concise expression of proba- bilistic models and inference algorithms across diverse elds, such as computer vision, data science, and robotics, within a single probabilistic programming language.

Subfields: Artificial Intelligence, Probabilistic & Bayesian Methods

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Noah D. Goodman
  2. Vikash K. Mansinghka
  3. Alexander K. Lew
  4. Marco F. Cusumano-Towner
  5. Feras A. Saad
  6. Neeraj Pradhan
  7. Fritz Obermeyer
  8. Martin Jankowiak

In Probabilistic & Bayesian Methods

  1. Vikash K. Mansinghka
  2. Noah D. Goodman
  3. Alexander K. Lew
  4. Marco F. Cusumano-Towner
  5. Feras A. Saad
  6. Paul Horsfall
  7. Frank D. Wood
  8. Neeraj Pradhan

Citations in the corpus