Fetching the paper…
Reading the bibliography…
We present a modular semantic account of Bayesian inference algorithms for probabilistic programming languages, as used in data science and machine learning.
Borel structures for function spaces
R. J. Aumann. 1961 · 1961
Earlier work this paper cites.
Strong functors and monoidal monads
Anders Kock. 1972 · 1972
Earlier work this paper cites.
A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves and so on
G M Kelly. 1980 · 1980
Earlier work this paper cites.
Computational Lambda-Calculus and Monads. In LICS
Eugenio Moggi. 1989 · 1989
Earlier work this paper cites.
On the Expressive Power of Programming Languages
Matthias Felleisen. 1991 · 1991
Earlier work this paper cites.
BUGS: A program to perform Bayesian inference using Gibbs sampling
Andrew Thomas, David J. Spiegelhalter, and W. R. Gilks. 1992 · 1992
Earlier work this paper cites.
A Tutorial on the Universality and Expressiveness of Fold
Graham Hutton. 1999 · 1999
Earlier work this paper cites.
Stochastic lambda calculus and monads of probability distributions. In Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, OR, USA, January 16-18, 2002
Norman Ramsey and Avi Pfeffer. 2002 · 2002
Earlier work this paper cites.
A categorical model for the geometry of interaction
Esfandiar Haghverdi and Philip Scott. 2006 · 2004
Earlier work this paper cites.
A probabilistic language based upon sampling functions. In Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, Long Beach, California, USA, January 12-14, 2005
Sungwoo Park, Frank Pfenning, and Sebastian Thrun. 2005 · 2005
Earlier work this paper cites.
Iteration and primitive recursion in categorical terms. In Reflections on Type Theory, Lambda Calculus, and the Mind, Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday
Herman Geuvers and Erik Poll. 2007 · 2007
Earlier work this paper cites.
Church: a language for generative models. In UAI
Noah Goodman, Vikash Mansinghka, Daniel M Roy, Keith Bonawitz, and Joshua B Tenenbaum. 2008 · 2008
Earlier work this paper cites.
Lifting of Operations in Modular Monadic Semantics
Mauro Jaskelioff. 2009 · 2009
Earlier work this paper cites.
Monads as extension systems — no iteration is necessary
Francisco Marmolejo and Richard J. Wood. 2010 · 2010
Earlier work this paper cites.
A Tutorial on Particle Filtering and Smoothing: Fifteen years later
Arnaud Doucet and Adam M. Johansen. 2011 · 2011
Cited alongside, same era.
Introduction to Markov Chain Monte Carlo
Charles J. Geyer. 2011 · 2011
Cited alongside, same era.
Lightweight Implementations of Probabilistic Programming Languages Via Transformational Compilation. In AISTATS
David Wingate, Andreas Stuhlmüller, and Noah Goodman. 2011 · 2011
Cited alongside, same era.
Commutative monads as a theory of distributions
Anders Kock. 2012 · 2012
Cited alongside, same era.
Bayesian State-Space Modelling on High-Performance Hardware Using LibBi
Lawrence M. Murray. 2013 · 2013
Cited alongside, same era.
Automated Variational Inference in Probabilistic Programming
Automatic Variational Inference in Stan. In NIPS
Alp Kucukelbir, Rajesh Ranganath, Andrew Gelman, and David Blei. 2015 · 2015
Later among the works it cites.
Practical Probabilistic Programming with Monads. In Haskell
Adam Ścibior, Zoubin Ghahramani, and Andrew Gordon. 2015 · 2015
Later among the works it cites.
A lambda-calculus foundation for universal probabilistic programming. In Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016, Nara, Japan, September 18-22, 2016
Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon, and Marcin Szymczak. 2016 · 2016
Later among the works it cites.
Probabilistic inference by program transformation in Hakaru (system description). In International Symposium on Functional and Logic Programming - 13th International Symposium, FLOPS 2016, Kochi, Japan, March 4-6, 2016, Proceedings
Praveen Narayanan, Jacques Carette, Wren Romano, Chung-chieh Shan, and Robert Zinkov. 2016 · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
David Wingate and Theophane Weber. 2013 · 2013
Cited alongside, same era.
Design and Implementation of Probabilistic Programming Languages
Noah Goodman and Andreas Stuhlmüller. 2014 · 2014
Cited alongside, same era.
Tabular: A Schema-driven Probabilistic Programming Language. In Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Andrew D. Gordon, Thore Graepel, Nicolas Rolland, Claudio Russo, Johannes Borgstrom, and John Guiver. 2014 · 2014
Cited alongside, same era.
Venture: a higher-order probabilistic programming platform with programmable inference
Vikash K. Mansinghka, Daniel Selsam, and Yura N. Perov. 2014 · 2014
Cited alongside, same era.
Infer.NET 2.6
T. Minka, J.M. Winn, J.P. Guiver, S. Webster, Y. Zaykov, B. Yangel, A. Spengler, and J. Bronskill. 2014 · 2014
Cited alongside, same era.
A New Approach to Probabilistic Programming Inference. In Proceedings of the 17th International conference on Artificial Intelligence and Statistics
Frank Wood, Jan Willem van de Meent, and Vikash Mansinghka. 2014 · 2014
Cited alongside, same era.
A Lambda-Calculus Foundation for Universal Probabilistic Programming
Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon, and Marcin Szymczak. 2015 · 2015
Cited alongside, same era.
Eilenberg-Moore Monoids and Backtracking Monad Transformers. In Proceedings 6th Workshop on Mathematically Structured Functional Programming, MSFP@ETAPS 2016, Eindhoven, Netherlands, 8th April 2016
Maciej Piróg. 2016 · 2016
Later among the works it cites.
Composing inference algorithms as program transformations
Robert Zinkov and Chung-chieh Shan. 2016 · 2016
Later among the works it cites.
Stan: A Probabilistic Programming Language
Bob Carpenter, Andrew Gelman, Matthew Hoffman, Daniel Lee, Ben Goodrich, Michael Betancourt, Marcus Brubaker, Jiqiang Guo, Peter Li, and Allen Riddell. 2017 · 2017
Closest in time.
List Objects with Algebraic Structure. In 2st International Conference on Formal Structures for Computation and Deduction, FSCD 2017
Marcelo Fiore and Philip Saville. 2017 · 2017
Closest in time.
A Convenient Category for Higher-Order Probability Theory. In Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS ’17, Reykjavik, Iceland, June 20-23, 2017
Chris Heunen, Ohad Kammar, Sam Staton, and Hongseok Yang. 2017 · 2017
Closest in time.
From Probability Monads to Commutative Effectuses
Bart Jacobs. 2017 · 2017
Closest in time.
Inference Compilation and Universal Probabilistic Programming. In AISTATS
Tuan Anh Le, Atilim Gunes Baydin, and Frank Wood. 2017 · 2017
Closest in time.
Commutative semantics for probabilistic programming. In Proc. ESOP 2017
Sam Staton. 2017 · 2017
Closest in time.
Deep Probabilistic Programming. In ICLR
Dustin Tran, Matthew D. Hoffman, Rif A. Saurous, Eugene Brevdo, Kevin Murphy, and David M. Blei. 2017 · 2017
Closest in time.