skip to main content

Scaling exact inference for discrete probabilistic programs

Published:13 November 2020Publication History
Skip Abstract Section

Abstract

Probabilistic programming languages (PPLs) are an expressive means of representing and reasoning about probabilistic models. The computational challenge of probabilistic inference remains the primary roadblock for applying PPLs in practice. Inference is fundamentally hard, so there is no one-size-fits all solution. In this work, we target scalable inference for an important class of probabilistic programs: those whose probability distributions are discrete. Discrete distributions are common in many fields, including text analysis, network verification, artificial intelligence, and graph analysis, but they prove to be challenging for existing PPLs.

We develop a domain-specific probabilistic programming language called Dice that features a new approach to exact discrete probabilistic program inference. Dice exploits program structure in order to factorize inference, enabling us to perform exact inference on probabilistic programs with hundreds of thousands of random variables. Our key technical contribution is a new reduction from discrete probabilistic programs to weighted model counting (WMC). This reduction separates the structure of the distribution from its parameters, enabling logical reasoning tools to exploit that structure for probabilistic inference. We (1) show how to compositionally reduce Dice inference to WMC, (2) prove this compilation correct with respect to a denotational semantics, (3) empirically demonstrate the performance benefits over prior approaches, and (4) analyze the types of structure that allow Dice to scale to large probabilistic programs.

Skip Supplemental Material Section

Supplemental Material

Auxiliary Presentation Video

We develop a domain-specific probabilistic programming language called Dice that features a new approach to exact discrete probabilistic program inference. exploits program structure in order to factorize inference, enabling us to perform exact inference on probabilistic programs with hundreds of thousands of random variables. Our key technical contribution is a new reduction from discrete probabilistic programs to weighted model counting (WMC). This reduction separates the structure of the distribution from its parameters, enabling logical reasoning tools to exploit that structure for probabilistic inference. We (1) show how to compositionally reduce inference to WMC, (2) prove this compilation correct with respect to a denotational semantics, (3) empirically demonstrate the performance benefits over prior approaches, and (4) analyze the types of structure that allow to scale to large probabilistic programs.

References

  1. Bruce Abramson, John Brown, Ward Edwards, Allan Murphy, and Robert L Winkler. 1996. Hailfinder: A Bayesian system for forecasting severe weather. International Journal of Forecasting 12, 1 ( 1996 ), 57-71. https://doi.org/10.1016/ 0169-2070 ( 95 ) 00664-8 Google ScholarGoogle ScholarCross RefCross Ref
  2. Aws Albarghouthi, Loris D'Antoni, Samuel Drews, and Aditya V. Nori. 2017. FairSquare: Probabilistic Verification of Program Fairness. Proc. ACM Program. Lang. 1, OOPSLA, Article 80 (Oct. 2017 ), 30 pages. https://doi.org/10.1145/3133904 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Steen Andreassen, Finn V Jensen, Stig Kjaer Andersen, B Falck, U Kjaerulf, M Woldbye, AR Sørensen, A Rosenfalck, and F Jensen. 1989. MUNIN: an expert EMG Assistant. In Computer-aided electromyography and expert systems. Pergamon Press, 255-277. https://doi.org/10.1016/ 0924-980x ( 95 ) 00252-g Google ScholarGoogle ScholarCross RefCross Ref
  4. R Iris Bahar, Erica A Frohm, Charles M Gaona, Gary D Hachtel, Enrico Macii, Abelardo Pardo, and Fabio Somenzi. 1997. Algebric decision diagrams and their applications. Formal methods in system design 10, 2-3 ( 1997 ), 171-206.Google ScholarGoogle Scholar
  5. Ingo A Beinlich, Henri Jacques Suermondt, R Martin Chavez, and Gregory F Cooper. 1989. The ALARM monitoring system: A case study with two probabilistic inference techniques for belief networks. In AIME 89. Springer, 247-256. https://doi.org/10.1007/978-3-642-93437-7_28 Google ScholarGoogle ScholarCross RefCross Ref
  6. Vaishak Belle, Andrea Passerini, and Guy Van den Broeck. 2015. Probabilistic Inference in Hybrid Domains by Weighted Model Integration. In Proc. of IJCAI. 2770-2776.Google ScholarGoogle Scholar
  7. Armin Biere. 2009. Bounded Model Checking. In Handbook of Satisfiability, Armin Biere, Marijn J. H. Heule, Hans van Maaren, and Toby Walsh (Eds.). Frontiers in Artificial Intelligence and Applications, Vol. 185. IOS Press, Chapter 14.Google ScholarGoogle Scholar
  8. John Binder, Daphne Koller, Stuart Russell, and Keiji Kanazawa. 1997. Adaptive probabilistic networks with hidden variables. Machine Learning 29, 2-3 ( 1997 ), 213-244. https://doi.org/10.1023/A:1007421730016 Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Eli Bingham, Jonathan P Chen, Martin Jankowiak, Fritz Obermeyer, Neeraj Pradhan, Theofanis Karaletsos, Rohit Singh, Paul Szerlip, Paul Horsfall, and Noah D Goodman. 2019. Pyro: Deep universal probabilistic programming. The Journal of Machine Learning Research 20, 1 ( 2019 ), 973-978.Google ScholarGoogle Scholar
  10. Johannes Borgström, Andrew D Gordon, Michael Greenberg, James Margetson, and Jurgen Van Gael. 2011. Measure transformer semantics for Bayesian machine learning. In European symposium on programming. Springer, 77-96.Google ScholarGoogle ScholarCross RefCross Ref
  11. James Bornholt, Todd Mytkowicz, and Kathryn S McKinley. 2014. Uncertain<T>: A first-order type for uncertain data. In ACM SIGPLAN Notices, Vol. 49. ACM, 51-66. https://doi.org/10.1145/2654822.2541958 Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Craig Boutilier, Nir Friedman, Moises Goldszmidt, and Daphne Koller. 1996. Context-specific independence in Bayesian networks. In Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence. Morgan Kaufmann Publishers Inc., 115-123.Google ScholarGoogle Scholar
  13. R. Bryant. 1986. Graph-based algorithms for Boolean function manipulation. IEEE TC C-35 ( 1986 ), 677-691. https: //doi.org/10.1109/TC. 1986.1676819 Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Bob Carpenter, Andrew Gelman, Matt Hofman, Daniel Lee, Ben Goodrich, Michael Betancourt, Michael A Brubaker, Jiqiang Guo, Peter Li, and Allen Riddell. 2016. Stan: A probabilistic programming language. Journal of Statistical Software ( 2016 ).Google ScholarGoogle Scholar
  15. Arun Chaganty, Aditya Nori, and Sriram Rajamani. 2013. Eficiently sampling probabilistic programs via program analysis. In Artificial Intelligence and Statistics. 153-160.Google ScholarGoogle Scholar
  16. Mark Chavira and Adnan Darwiche. 2005. Compiling Bayesian networks with local structure. In IJCAI. 1306-1312.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Mark Chavira and Adnan Darwiche. 2008. On Probabilistic Inference by Weighted Model Counting. J. Artificial Intelligence 172, 6-7 ( April 2008 ), 772-799. https://doi.org/10.1016/j.artint. 2007. 11.002 Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Mark Chavira, Adnan Darwiche, and Manfred Jaeger. 2006. Compiling relational Bayesian networks for exact inference. International Journal of Approximate Reasoning 42, 1 ( 2006 ), 4-20.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Dmitry Chistikov, Rayna Dimitrova, and Rupak Majumdar. 2015. Approximate Counting in SMT and Value Estimation for Probabilistic Programs. In Proc. of TACAS. Springer-Verlag New York, Inc., New York, NY, USA, 320-334. https: //doi.org/10.1007/978-3-662-46681-0_26 Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Guillaume Claret, Sriram K. Rajamani, Aditya V. Nori, Andrew D. Gordon, and Johannes Borgström. 2013. Bayesian inference using data flow analysis. Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering-ESEC/FSE 2013 ( 2013 ), 92. https://doi.org/10.1145/2491411.2491423 Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Edmund M. Clarke, Jr., Orna Grumberg, and Doron A. Peled. 1999. Model Checking. MIT Press, Cambridge, MA, USA.Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Patrick Cousot and Michael Monerau. 2012. Probabilistic abstract interpretation. In Proc. of ESOP. 169-193. https: //doi.org/10.1007/978-3-642-28869-2_9 Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Marco Cusumano-Towner, Benjamin Bichsel, Timon Gehr, Martin Vechev, and Vikash K Mansinghka. 2018. Incremental inference for probabilistic programs. In ACM SIGPLAN Notices, Vol. 53. ACM, 571-585. https://doi.org/10.1145/3296979. 3192399 Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Adnan Darwiche. 2009. Modeling and Reasoning with Bayesian Networks. Cambridge University Press. https://doi.org/10. 1017/CBO9780511811357 Google ScholarGoogle ScholarCross RefCross Ref
  25. Adnan Darwiche. 2011. SDD: A new canonical representation of propositional knowledge bases. In IJCAI ProceedingsInternational Joint Conference on Artificial Intelligence. 819.Google ScholarGoogle Scholar
  26. A. Darwiche and P. Marquis. 2002. A Knowledge Compilation Map. Journal of Artificial Intelligence Research 17 ( 2002 ), 229-264.Google ScholarGoogle Scholar
  27. Luc De Raedt, Angelika Kimmig, and Hannu Toivonen. 2007. ProbLog: A Probabilistic Prolog and Its Application in Link Discovery. In Proceedings of IJCAI, Vol. 7. 2462-2467.Google ScholarGoogle Scholar
  28. Christian Dehnert, Sebastian Junges, Joost-Pieter Katoen, and Matthias Volk. 2017. A storm is coming: A modern probabilistic model checker. In International Conference on Computer Aided Verification. Springer, 592-600.Google ScholarGoogle ScholarCross RefCross Ref
  29. Joshua V Dillon, Ian Langmore, Dustin Tran, Eugene Brevdo, Srinivas Vasudevan, Dave Moore, Brian Patton, Alex Alemi, Matt Hofman, and Rif A Saurous. 2017. TensorFlow Distributions. arXiv preprint arXiv:1711.10604 ( 2017 ).Google ScholarGoogle Scholar
  30. Pedro Zuidberg Dos Martires, Anton Dries, and Luc De Raedt. 2019. Exact and Approximate Weighted Model Integration with Probability Density Functions Using Knowledge Compilation. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 33. 7825-7833.Google ScholarGoogle ScholarCross RefCross Ref
  31. Daan Fierens, Guy Van den Broeck, Joris Renkens, Dimitar Shterionov, Bernd Gutmann, Ingo Thon, Gerda Janssens, and Luc De Raedt. 2015. Inference and learning in probabilistic logic programs using weighted Boolean formulas. J. Theory and Practice of Logic Programming 15 ( 3 ) ( 2015 ), 358-401. https://doi.org/10.1017/S1471068414000076 Google ScholarGoogle ScholarCross RefCross Ref
  32. Antonio Filieri, Corina S Păsăreanu, and Willem Visser. 2013. Reliability analysis in symbolic pathfinder. In 2013 35th International Conference on Software Engineering (ICSE). IEEE, 622-631.Google ScholarGoogle ScholarCross RefCross Ref
  33. Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. 1993. The Essence of Compiling with Continuations. In Proceedings of the ACM SIGPLAN'93 Conference on Programming Language Design and Implementation (PLDI), Albuquerque, New Mexico, USA, June 23-25, 1993, Robert Cartwright (Ed.). ACM, 237-247. https://doi.org/10.1145/155090.155113 Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Timon Gehr, Sasa Misailovic, Petar Tsankov, Laurent Vanbever, Pascal Wiesmann, and Martin Vechev. 2018. Bayonet: probabilistic inference for networks. In ACM SIGPLAN Notices, Vol. 53. ACM, 586-602. https://doi.org/10.1145/3296979. 3192400 Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Timon Gehr, Sasa Misailovic, and Martin Vechev. 2016. Psi: Exact symbolic inference for probabilistic programs. In International Conference on Computer Aided Verification. Springer, 62-83.Google ScholarGoogle ScholarCross RefCross Ref
  36. Jaco Geldenhuys, Matthew B Dwyer, and Willem Visser. 2012. Probabilistic symbolic execution. In Proceedings of the 2012 International Symposium on Software Testing and Analysis. ACM, 166-176. https://doi.org/10.1145/2338965.2336773 Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. V. Gogate and R. Dechter. 2011. SampleSearch: Importance sampling in presence of determinism. Artificial Intelligence 175, 2 ( 2011 ), 694-729.Google ScholarGoogle Scholar
  38. Noah D. Goodman, Vikash K. Mansinghka, Daniel M. Roy, Keith Bonawitz, and Joshua B. Tenenbaum. 2008. Church: a language for generative models. In Proceedings of the 24th Conference in Uncertainty in Artificial Intelligence (UAI).Google ScholarGoogle Scholar
  39. Noah D Goodman and Andreas Stuhlmüller. 2014. The design and implementation of probabilistic programming languages.Google ScholarGoogle Scholar
  40. Maria I Gorinova, Dave Moore, and Matthew D Hofman. 2020. Automatic Reparameterisation of Probabilistic Programs. International Conference on Machine Learning (ICML) ( 2020 ).Google ScholarGoogle Scholar
  41. Bradley Gram-Hansen, Yuan Zhou, Tobias Kohn, Tom Rainforth, Hongseok Yang, and Frank Wood. 2018. Hamiltonian Monte Carlo for Probabilistic Programs with Discontinuities. arXiv preprint arXiv: 1804. 03523 ( 2018 ).Google ScholarGoogle Scholar
  42. Matthew D Hofman and Andrew Gelman. 2014. The No-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo. Journal of Machine Learning Research 15, 1 ( 2014 ), 1593-1623.Google ScholarGoogle Scholar
  43. Steven Holtzen, Guy Van den Broeck, and Todd Millstein. 2018. Sound abstraction and decomposition of probabilistic programs. In Proceedings of the 35th International Conference on Machine Learning (ICML).Google ScholarGoogle Scholar
  44. Steven Holtzen, Guy Van den Broeck, and Todd Millstein. 2020. Scaling Exact Inference for Discrete Probabilistic Programs. arXiv:arXiv: 2005.09089Google ScholarGoogle Scholar
  45. Daniel Huang and Greg Morrisett. 2016. An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages. In Proceedings of the 25th European Symposium on Programming Languages and Systems-Volume 9632. Springer-Verlag New York, Inc., New York, NY, USA, 337-363. https://doi.org/10.1007/978-3-662-49498-1_14 Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. Chung-kil Hur, Aditya V. Nori, Sriram K. Rajamani, and Selva Sammuel. 2015. A Provably Correct Sampler for Probabilistic Programs. FSTTCS FSTTCS ( 2015 ), 1-14. https://doi.org/10.4230/LIPIcs.FSTTCS. 2015.475 Google ScholarGoogle ScholarCross RefCross Ref
  47. FV Jensen, U Kjaerulf, KG Olesen, and J Pedersen. 1989. An expert system for control of waste water treatment-a pilot project. Technical Report. Technical report, Judex Datasystemer A/S, Aalborg, 1989. In Danish.Google ScholarGoogle Scholar
  48. Ranjit Jhala and Rupak Majumdar. 2009. Software model checking. Comput. Surveys 41, 4 ( 2009 ), 1-54. https://doi.org/10. 1145/1592434.1592438 Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. M.I. Jordan, Z. Ghahramani, T.S. Jaakkola, and L.K. Saul. 1999. An introduction to variational methods for graphical models. Machine learning 37, 2 ( 1999 ), 183-233. https://doi.org/10.1023/A:1007665907178 Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. Jonathan Katz, Alfred J Menezes, Paul C Van Oorschot, and Scott A Vanstone. 1996. Handbook of applied cryptography. CRC press.Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. D. Koller and N. Friedman. 2009. Probabilistic graphical models: principles and techniques. MIT press.Google ScholarGoogle Scholar
  52. Kevin B Korb and Ann E Nicholson. 2010. Bayesian artificial intelligence. CRC press. https://doi.org/10.1201/b10391 Google ScholarGoogle ScholarCross RefCross Ref
  53. Dexter Kozen. 1979. Semantics of Probabilistic Programs. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science (SFCS '79). IEEE Computer Society, Washington, DC, USA, 101-114. https://doi.org/10.1109/SFCS. 1979. 38 Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. Alp Kucukelbir, Rajesh Ranganath, Andrew Gelman, and David Blei. 2015. Automatic variational inference in Stan. In Advances in neural information processing systems. 568-576.Google ScholarGoogle Scholar
  55. Alp Kucukelbir, Dustin Tran, Rajesh Ranganath, Andrew Gelman, and David M Blei. 2017. Automatic diferentiation variational inference. The Journal of Machine Learning Research 18, 1 ( 2017 ), 430-474.Google ScholarGoogle Scholar
  56. Marta Kwiatkowska, Gethin Norman, and David Parker. 2011. PRISM 4.0: Verification of Probabilistic Real-time Systems. In Proceedings of the 23rd International Conference on Computer Aided Verification (Snowbird, UT) (CAV'11). Springer-Verlag, Berlin, Heidelberg, 585-591. https://doi.org/10.1007/978-3-642-22110-1_47 Google ScholarGoogle ScholarCross RefCross Ref
  57. Johan Henri Petrus Kwisthout. 2009. The computational complexity of probabilistic networks. Utrecht University.Google ScholarGoogle Scholar
  58. Michael L Littman, Judy Goldsmith, and Martin Mundhenk. 1998. The computational complexity of probabilistic planning. Journal of Artificial Intelligence Research 9 ( 1998 ), 1-36. https://doi.org/10.1613/jair.505 Google ScholarGoogle ScholarCross RefCross Ref
  59. Vikash Mansinghka, Tejas D Kulkarni, Yura N Perov, and Josh Tenenbaum. 2013. Approximate bayesian image interpretation using generative probabilistic graphics programs. In Advances in Neural Information Processing Systems. 1520-1528.Google ScholarGoogle ScholarDigital LibraryDigital Library
  60. Vikash K. Mansinghka, Ulrich Schaechtle, Shivam Handa, Alexey Radul, Yutian Chen, and Martin Rinard. 2018. Probabilistic Programming with Programmable Inference. In Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation (Philadelphia, PA, USA) ( PLDI 2018). ACM, New York, NY, USA, 603-616. https: //doi.org/10.1145/3192366.3192409 Google ScholarGoogle ScholarDigital LibraryDigital Library
  61. A McCallum, K Schultz, and S Singh. 2009. Factorie: Probabilistic programming via imperatively defined factor graphs. Proc. of NIPS 22 ( 2009 ), 1249-1257.Google ScholarGoogle Scholar
  62. Christoph Meinel and Thorsten Theobald. 1998. Algorithms and Data Structures in VLSI Design: OBDD-foundations and applications. Springer Verlag. https://doi.org/10.1007/978-3-642-58940-9 Google ScholarGoogle ScholarCross RefCross Ref
  63. T. Minka, J.M. Winn, J.P. Guiver, S. Webster, Y. Zaykov, B. Yangel, A. Spengler, and J. Bronskill. 2014. Infer.NET 2.6. Microsoft Research Cambridge. http://research.microsoft.com/infernet.Google ScholarGoogle Scholar
  64. Praveen Narayanan, Jacques Carette, Wren Romano, Chung-chieh Shan, and Robert Zinkov. 2016. 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. Springer, 62-79. https://doi.org/ 10.1007/978-3-319-29604-3_5 Google ScholarGoogle ScholarCross RefCross Ref
  65. Aditya V Nori, Chung-Kil Hur, Sriram K Rajamani, and Selva Samuel. 2014. R2: An Eficient MCMC Sampler for Probabilistic Programs. In AAAI. 2476-2482.Google ScholarGoogle Scholar
  66. Fritz Obermeyer, Eli Bingham, Martin Jankowiak, Neeraj Pradhan, Justin Chiu, Alexander Rush, and Noah Goodman. 2019. Tensor variable elimination for plated factor graphs. ( 2019 ), 4871-4880.Google ScholarGoogle Scholar
  67. Agnieszka Onisko. 2003. Probabilistic causal models in medicine: Application to diagnosis of liver disorders. In Ph. D. dissertation, Inst. Biocybern. Biomed. Eng., Polish Academy Sci., Warsaw, Poland.Google ScholarGoogle Scholar
  68. Judea Pearl. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann.Google ScholarGoogle Scholar
  69. Avi Pfefer. 2007a. A general importance sampling algorithm for probabilistic programs. ( 2007 ). http://nrs.harvard.edu/urn3:HUL. InstRepos:25235125Google ScholarGoogle Scholar
  70. Avi Pfefer. 2007b. The Design and Implementation of IBAL: A General-Purpose Probabilistic Language. Introduction to statistical relational learning 1993 ( 2007 ), 399.Google ScholarGoogle Scholar
  71. Avi Pfefer. 2009. Figaro: An object-oriented probabilistic programming language. Charles River Analytics Technical Report 137 ( 2009 ).Google ScholarGoogle Scholar
  72. Avi Pfefer, Brian Ruttenberg, William Kretschmer, and Alison OConnor. 2018. Structured Factored Inference for Probabilistic Programming. In International Conference on Artificial Intelligence and Statistics. 1224-1232.Google ScholarGoogle Scholar
  73. Fabrizio Riguzzi and Terrance Swift. 2011. The PITA System: Tabling and Answer Subsumption for Reasoning under Uncertainty. Theory and Practice of Logic Programming 11, 4-5 ( 2011 ), 433-449. https://doi.org/10.1017/S147106841100010X Google ScholarGoogle ScholarCross RefCross Ref
  74. Feras Saad and Vikash Mansinghka. 2016. A Probabilistic Programming Approach To Probabilistic Data Analysis. In Advances in Neural Information Processing Systems (NIPS).Google ScholarGoogle Scholar
  75. Tian Sang, Paul Beame, and Henry A Kautz. 2005. Performing Bayesian inference by weighted model counting. In AAAI, Vol. 5. 475-481.Google ScholarGoogle Scholar
  76. Sriram Sankaranarayanan, Aleksandar Chakarov, and Sumit Gulwani. 2013. Static Analysis for Probabilistic Programs: Inferring Whole Program Properties from Finitely Many Paths. SIGPLAN Not. 48, 6 ( June 2013 ), 447-458. https: //doi.org/10.1145/2499370.2462179 Google ScholarGoogle ScholarDigital LibraryDigital Library
  77. Marco Scutari and Jean-Baptiste Denis. 2014. Bayesian networks: with examples in R. CRC press. https://doi.org/10.1111/ biom.12369 Google ScholarGoogle ScholarCross RefCross Ref
  78. Jan-Willem van de Meent, Hongseok Yang, Vikash Mansinghka, and Frank Wood. 2015. Particle Gibbs with Ancestor Sampling for Probabilistic Programs. In AISTATS.Google ScholarGoogle Scholar
  79. Guy Van den Broeck and Dan Suciu. 2017. Query Processing on Probabilistic Data: A Survey. Now Publishers. https: //doi.org/10.1561/1900000052 Google ScholarGoogle ScholarCross RefCross Ref
  80. Marcell Vazquez-Chanlatte and Sanjit A Seshia. 2020. Maximum Causal Entropy Specification Inference from Demonstrations. In International Conference on Computer Aided Verification. Springer.Google ScholarGoogle ScholarCross RefCross Ref
  81. Jonas Vlasselaer, Guy Van den Broeck, Angelika Kimmig, Wannes Meert, and Luc De Raedt. 2015. Anytime inference in probabilistic logic programs with Tp-compilation. In Proceedings of 24th International Joint Conference on Artificial Intelligence (IJCAI). https://doi.org/10.1016/j.ijar. 2016. 06.009 Google ScholarGoogle ScholarDigital LibraryDigital Library
  82. Di Wang, Jan Hofmann, and Thomas Reps. 2018. PMAF: An Algebraic Framework for Static Analysis of Probabilistic Programs. SIGPLAN Not. 53, 4 ( June 2018 ), 513-528. https://doi.org/10.1145/3296979.3192408 Google ScholarGoogle ScholarDigital LibraryDigital Library
  83. David Wingate and Theophane Weber. 2013. Automated variational inference in probabilistic programming. arXiv preprint arXiv:1301.1299 ( 2013 ).Google ScholarGoogle Scholar
  84. Frank Wood, Jan Willem Meent, and Vikash Mansinghka. 2014. A new approach to probabilistic programming inference. In Artificial Intelligence and Statistics. 1024-1032.Google ScholarGoogle Scholar
  85. Zhe Zeng and Guy Van den Broeck. 2020. Eficient search-based weighted model integration. In Uncertainty in Artificial Intelligence. PMLR, 175-185.Google ScholarGoogle Scholar
  86. Yuan Zhou, Hongseok Yang, Yee Whye Teh, and Tom Rainforth. 2020. Divide, Conquer, and Combine: a New Inference Strategy for Probabilistic Programs with Stochastic Support. International Conference on Machine Learning ( 2020 ).Google ScholarGoogle Scholar

Index Terms

  1. Scaling exact inference for discrete probabilistic programs

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!