{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T05:57:45Z","timestamp":1781762265505,"version":"3.54.5"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:00:00Z","timestamp":1673222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2018R1A5A1059921"],"award-info":[{"award-number":["NRF-2018R1A5A1059921"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010446","name":"Institute for Basic Science","doi-asserted-by":"publisher","award":["IBS-R029-C1"],"award-info":[{"award-number":["IBS-R029-C1"]}],"id":[{"id":"10.13039\/501100010446","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2023,1,9]]},"abstract":"<jats:p>We present a static analysis for discovering differentiable or more generally smooth parts of a given probabilistic program, and show how the analysis can be used to improve the pathwise gradient estimator, one of the most popular methods for posterior inference and model learning. Our improvement increases the scope of the estimator from differentiable models to non-differentiable ones without requiring manual intervention of the user; the improved estimator automatically identifies differentiable parts of a given probabilistic program using our static analysis, and applies the pathwise gradient estimator to the identified parts while using a more general but less efficient estimator, called score estimator, for the rest of the program. Our analysis has a surprisingly subtle soundness argument, partly due to the misbehaviours of some target smoothness properties when viewed from the perspective of program analysis designers. For instance, some smoothness properties, such as partial differentiability and partial continuity, are not preserved by function composition, and this makes it difficult to analyse sequential composition soundly without heavily sacrificing precision. We formulate five assumptions on a target smoothness property, prove the soundness of our analysis under those assumptions, and show that our leading examples satisfy these assumptions. We also show that by using information from our analysis instantiated for differentiability, our improved gradient estimator satisfies an important differentiability requirement and thus computes the correct estimate on average (i.e., returns an unbiased estimate) under a regularity condition. Our experiments with representative probabilistic programs in the Pyro language show that our static analysis is capable of identifying smooth parts of those programs accurately, and making our improved pathwise gradient estimator exploit all the opportunities for high performance in those programs.<\/jats:p>","DOI":"10.1145\/3571205","type":"journal-article","created":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T21:58:14Z","timestamp":1673474294000},"page":"335-366","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Smoothness Analysis for Probabilistic Programs with Application to Optimised Variational Inference"],"prefix":"10.1145","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0301-0872","authenticated-orcid":false,"given":"Wonyeol","family":"Lee","sequence":"first","affiliation":[{"name":"Stanford University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2875-6171","authenticated-orcid":false,"given":"Xavier","family":"Rival","sequence":"additional","affiliation":[{"name":"Inria, France \/ ENS, France \/ CNRS, France \/ PSL University, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1502-2942","authenticated-orcid":false,"given":"Hongseok","family":"Yang","sequence":"additional","affiliation":[{"name":"KAIST, South Korea \/ IBS, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Wasserstein Generative Adversarial Networks. In International Conference on Machine Learning (ICML). 214\u2013223","author":"Arjovsky Martin","year":"2017","unstructured":"Martin Arjovsky , Soumith Chintala , and L\u00e9on Bottou . 2017 . Wasserstein Generative Adversarial Networks. In International Conference on Machine Learning (ICML). 214\u2013223 . Martin Arjovsky, Soumith Chintala, and L\u00e9on Bottou. 2017. Wasserstein Generative Adversarial Networks. In International Conference on Machine Learning (ICML). 214\u2013223."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44914-8_3"},{"key":"e_1_2_1_3_1","first-page":"1","article-title":"Pyro: Deep Universal Probabilistic Programming","volume":"20","author":"Bingham Eli","year":"2019","unstructured":"Eli Bingham , Jonathan P. Chen , Martin Jankowiak , Fritz Obermeyer , Neeraj Pradhan , Theofanis Karaletsos , Rohit Singh , Paul A. Szerlip , Paul Horsfall , and Noah D. Goodman . 2019 . Pyro: Deep Universal Probabilistic Programming . Journal of Machine Learning Research , 20 , 28 (2019), 1 \u2013 6 . Eli Bingham, Jonathan P. Chen, Martin Jankowiak, Fritz Obermeyer, Neeraj Pradhan, Theofanis Karaletsos, Rohit Singh, Paul A. Szerlip, Paul Horsfall, and Noah D. Goodman. 2019. Pyro: Deep Universal Probabilistic Programming. Journal of Machine Learning Research, 20, 28 (2019), 1\u20136.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781153"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-34514-5"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v076.i01"},{"key":"e_1_2_1_7_1","volume-title":"Rajamani","author":"Chaganty Arun Tejasvi","year":"2013","unstructured":"Arun Tejasvi Chaganty , Aditya V. Nori , and Sriram K . Rajamani . 2013 . Efficiently Sampling Probabilistic Programs via Program Analysis. In Artificial Intelligence and Statistics (AISTATS) . 153\u2013160. Arun Tejasvi Chaganty, Aditya V. Nori, and Sriram K. Rajamani. 2013. Efficiently Sampling Probabilistic Programs via Program Analysis. In Artificial Intelligence and Statistics (AISTATS). 153\u2013160."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706308"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2240236.2240262"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491423"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2008.7"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567778"},{"key":"e_1_2_1_14_1","volume-title":"Hinton","author":"Ali Eslami S. M.","year":"2016","unstructured":"S. M. Ali Eslami , Nicolas Heess , Theophane Weber , Yuval Tassa , David Szepesvari , Koray Kavukcuoglu , and Geoffrey E . Hinton . 2016 . Attend, Infer, Repeat : Fast Scene Understanding with Generative Models. In Neural Information Processing Systems (NIPS) . 3233\u20133241. S. M. Ali Eslami, Nicolas Heess, Theophane Weber, Yuval Tassa, David Szepesvari, Koray Kavukcuoglu, and Geoffrey E. Hinton. 2016. Attend, Infer, Repeat: Fast Scene Understanding with Generative Models. In Neural Information Processing Systems (NIPS). 3233\u20133241."},{"key":"e_1_2_1_15_1","volume-title":"Turing: A Language for Flexible Probabilistic Inference. In Artificial Intelligence and Statistics (AISTATS). 1682\u20131690.","author":"Ge Hong","year":"2018","unstructured":"Hong Ge , Kai Xu , and Zoubin Ghahramani . 2018 . Turing: A Language for Flexible Probabilistic Inference. In Artificial Intelligence and Statistics (AISTATS). 1682\u20131690. Hong Ge, Kai Xu, and Zoubin Ghahramani. 2018. Turing: A Language for Flexible Probabilistic Inference. In Artificial Intelligence and Statistics (AISTATS). 1682\u20131690."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41528-4_4"},{"key":"e_1_2_1_17_1","unstructured":"Noah Goodman Vikash Mansinghka Daniel M Roy Keith Bonawitz and Joshua B Tenenbaum. 2008. Church: a language for generative models. In Uncertainty in Artificial Intelligence (UAI). 220\u2013229. \t\t\t\t  Noah Goodman Vikash Mansinghka Daniel M Roy Keith Bonawitz and Joshua B Tenenbaum. 2008. Church: a language for generative models. In Uncertainty in Artificial Intelligence (UAI). 220\u2013229."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2578855.2535850"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490421"},{"key":"e_1_2_1_20_1","volume-title":"Automatic Reparameterisation of Probabilistic Programs. In International Conference on Machine Learning (ICML). 3648\u20133657","author":"Gorinova Maria I.","unstructured":"Maria I. Gorinova , Dave Moore , and Matthew D. Hoffman . 2020 . Automatic Reparameterisation of Probabilistic Programs. In International Conference on Machine Learning (ICML). 3648\u20133657 . Maria I. Gorinova, Dave Moore, and Matthew D. Hoffman. 2020. Automatic Reparameterisation of Probabilistic Programs. In International Conference on Machine Learning (ICML). 3648\u20133657."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428208"},{"key":"e_1_2_1_22_1","volume-title":"The Lipschitz Constant of Self-Attention. In International Conference on Machine Learning (ICML). 5562\u20135571","author":"Kim Hyunjik","year":"2021","unstructured":"Hyunjik Kim , George Papamakarios , and Andriy Mnih . 2021 . The Lipschitz Constant of Self-Attention. In International Conference on Machine Learning (ICML). 5562\u20135571 . Hyunjik Kim, George Papamakarios, and Andriy Mnih. 2021. The Lipschitz Constant of Self-Attention. In International Conference on Machine Learning (ICML). 5562\u20135571."},{"key":"e_1_2_1_23_1","volume-title":"Auto-Encoding Variational Bayes. In International Conference on Learning Representations (ICLR).","author":"Diederik","unstructured":"Diederik P. Kingma and Max Welling. 2014 . Auto-Encoding Variational Bayes. In International Conference on Learning Representations (ICLR). Diederik P. Kingma and Max Welling. 2014. Auto-Encoding Variational Bayes. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_2_1_24_1","volume-title":"Blei","author":"Kucukelbir Alp","year":"2015","unstructured":"Alp Kucukelbir , Rajesh Ranganath , Andrew Gelman , and David M . Blei . 2015 . Automatic Variational Inference in Stan. In Neural Information Processing Systems (NIPS) . 568\u2013576. Alp Kucukelbir, Rajesh Ranganath, Andrew Gelman, and David M. Blei. 2015. Automatic Variational Inference in Stan. In Neural Information Processing Systems (NIPS). 568\u2013576."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498718"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9982-5"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.7246597"},{"key":"#cr-split#-e_1_2_1_28_1.1","unstructured":"Wonyeol Lee Xavier Rival and Hongseok Yang. 2022. Smoothness Analysis for Probabilistic Programs with Application to Optimised Variational Inference. arXiv:2208.10530 https:\/\/doi.org\/10.48550\/ARXIV.2208.10530 10.48550\/ARXIV.2208.10530"},{"key":"#cr-split#-e_1_2_1_28_1.2","unstructured":"Wonyeol Lee Xavier Rival and Hongseok Yang. 2022. Smoothness Analysis for Probabilistic Programs with Application to Optimised Variational Inference. arXiv:2208.10530 https:\/\/doi.org\/10.48550\/ARXIV.2208.10530"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371084"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371087"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-65474-0_13"},{"key":"e_1_2_1_32_1","volume-title":"Perov","author":"Mansinghka Vikash K.","year":"2014","unstructured":"Vikash K. Mansinghka , Daniel Selsam , and Yura N . Perov . 2014 . Venture : a higher-order probabilistic programming platform with programmable inference. arXiv:1404.0099, https:\/\/doi.org\/10.48550\/ARXIV.1404.0099 10.48550\/ARXIV.1404.0099 Vikash K. Mansinghka, Daniel Selsam, and Yura N. Perov. 2014. Venture: a higher-order probabilistic programming platform with programmable inference. arXiv:1404.0099, https:\/\/doi.org\/10.48550\/ARXIV.1404.0099"},{"key":"e_1_2_1_33_1","unstructured":"T. Minka J.M. Winn J.P. Guiver S. Webster Y. Zaykov B. Yangel A. Spengler and J. Bronskill. 2014. Infer.NET 2.6. https:\/\/dotnet.github.io\/infer\/ \t\t\t\t  T. Minka J.M. Winn J.P. Guiver S. Webster Y. Zaykov B. Yangel A. Spengler and J. Bronskill. 2014. Infer.NET 2.6. https:\/\/dotnet.github.io\/infer\/"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29604-3_5"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1201\/b10905"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.9060"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63588-0"},{"key":"e_1_2_1_38_1","volume-title":"Blei","author":"Ranganath Rajesh","year":"2014","unstructured":"Rajesh Ranganath , Sean Gerrish , and David M . Blei . 2014 . Black Box Variational Inference. In Artificial Intelligence and Statistics (AISTATS) . 814\u2013822. Rajesh Ranganath, Sean Gerrish, and David M. Blei. 2014. Black Box Variational Inference. In Artificial Intelligence and Statistics (AISTATS). 814\u2013822."},{"key":"e_1_2_1_39_1","volume-title":"Stochastic Backpropagation and Approximate Inference in Deep Generative Models. In International Conference on Machine Learning (ICML). 7344\u20137353","author":"Rezende Danilo Jimenez","year":"2014","unstructured":"Danilo Jimenez Rezende , Shakir Mohamed , and Daan Wierstra . 2014 . Stochastic Backpropagation and Approximate Inference in Deep Generative Models. In International Conference on Machine Learning (ICML). 7344\u20137353 . Danilo Jimenez Rezende, Shakir Mohamed, and Daan Wierstra. 2014. Stochastic Backpropagation and Approximate Inference in Deep Generative Models. In International Conference on Machine Learning (ICML). 7344\u20137353."},{"key":"e_1_2_1_40_1","volume-title":"Goodman","author":"Ritchie Daniel","year":"2016","unstructured":"Daniel Ritchie , Paul Horsfall , and Noah D . Goodman . 2016 . Deep Amortized Inference for Probabilistic Programs . arXiv:1610.05735, https:\/\/doi.org\/10.48550\/ARXIV.1610.05735 10.48550\/ARXIV.1610.05735 Daniel Ritchie, Paul Horsfall, and Noah D. Goodman. 2016. Deep Amortized Inference for Probabilistic Programs. arXiv:1610.05735, https:\/\/doi.org\/10.48550\/ARXIV.1610.05735"},{"key":"e_1_2_1_41_1","volume-title":"Goodman","author":"Ritchie Daniel","year":"2016","unstructured":"Daniel Ritchie , Andreas Stuhlm\u00fcller , and Noah D . Goodman . 2016 . C3: Lightweight Incrementalized MCMC for Probabilistic Programs using Continuations and Callsite Caching. In Artificial Intelligence and Statistics (AISTATS) . 28\u201337. Daniel Ritchie, Andreas Stuhlm\u00fcller, and Noah D. Goodman. 2016. C3: Lightweight Incrementalized MCMC for Probabilistic Programs using Continuations and Callsite Caching. In Artificial Intelligence and Statistics (AISTATS). 28\u201337."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.55"},{"key":"e_1_2_1_43_1","unstructured":"John Schulman Nicolas Heess Theophane Weber and Pieter Abbeel. 2015. Gradient Estimation Using Stochastic Computation Graphs. In Neural Information Processing Systems (NIPS). 3528\u20133536. \t\t\t\t  John Schulman Nicolas Heess Theophane Weber and Pieter Abbeel. 2015. Gradient Estimation Using Stochastic Computation Graphs. In Neural Information Processing Systems (NIPS). 3528\u20133536."},{"key":"e_1_2_1_44_1","unstructured":"N. Siddharth Brooks Paige Jan-Willem van de Meent Alban Desmaison Noah D. Goodman Pushmeet Kohli Frank Wood and Philip Torr. 2017. Learning Disentangled Representations with Semi-Supervised Deep Generative Models. In Neural Information Processing Systems (NIPS). 5927\u20135937. \t\t\t\t  N. Siddharth Brooks Paige Jan-Willem van de Meent Alban Desmaison Noah D. Goodman Pushmeet Kohli Frank Wood and Philip Torr. 2017. Learning Disentangled Representations with Semi-Supervised Deep Generative Models. In Neural Information Processing Systems (NIPS). 5927\u20135937."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2935313"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064899.3064910"},{"key":"e_1_2_1_47_1","unstructured":"Dustin Tran Matthew D. Hoffman Dave Moore Christopher Suter Srinivas Vasudevan and Alexey Radul. 2018. Simple Distributed and Accelerated Probabilistic Programming. In Neural Information Processing Systems (NeurIPS). 7609\u20137620. \t\t\t\t  Dustin Tran Matthew D. Hoffman Dave Moore Christopher Suter Srinivas Vasudevan and Alexey Radul. 2018. Simple Distributed and Accelerated Probabilistic Programming. In Neural Information Processing Systems (NeurIPS). 7609\u20137620."},{"key":"e_1_2_1_48_1","volume-title":"Blei","author":"Tran Dustin","year":"2016","unstructured":"Dustin Tran , Alp Kucukelbir , Adji B. Dieng , Maja R. Rudolph , Dawen Liang , and David M . Blei . 2016 . Edward : A library for probabilistic modeling, inference, and criticism. arXiv:1610.09787, https:\/\/doi.org\/10.48550\/ARXIV.1610.09787 10.48550\/ARXIV.1610.09787 Dustin Tran, Alp Kucukelbir, Adji B. Dieng, Maja R. Rudolph, Dawen Liang, and David M. Blei. 2016. Edward: A library for probabilistic modeling, inference, and criticism. arXiv:1610.09787, https:\/\/doi.org\/10.48550\/ARXIV.1610.09787"},{"key":"e_1_2_1_49_1","unstructured":"Uber AI Labs. 2022. Pyro examples. http:\/\/pyro.ai\/examples\/ Version used: June 18 2022 \t\t\t\t  Uber AI Labs. 2022. Pyro examples. http:\/\/pyro.ai\/examples\/ Version used: June 18 2022"},{"key":"#cr-split#-e_1_2_1_50_1.1","unstructured":"Jan-Willem van de Meent Brooks Paige Hongseok Yang and Frank Wood. 2018. An Introduction to Probabilistic Programming. arXiv:1809.10756 https:\/\/doi.org\/10.48550\/ARXIV.1809.10756 10.48550\/ARXIV.1809.10756"},{"key":"#cr-split#-e_1_2_1_50_1.2","unstructured":"Jan-Willem van de Meent Brooks Paige Hongseok Yang and Frank Wood. 2018. An Introduction to Probabilistic Programming. arXiv:1809.10756 https:\/\/doi.org\/10.48550\/ARXIV.1809.10756"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454077"},{"key":"e_1_2_1_52_1","unstructured":"WebPPL. 2019. https:\/\/github.com\/probmods\/webppl\/blob\/v0.9.15\/src\/header.wppl#L510 \t\t\t\t  WebPPL. 2019. https:\/\/github.com\/probmods\/webppl\/blob\/v0.9.15\/src\/header.wppl#L510"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"e_1_2_1_54_1","unstructured":"David Wingate Noah D. Goodman Andreas Stuhlm\u00fcller and Jeffrey Mark Siskind. 2011. Nonstandard Interpretations of Probabilistic Programs for Efficient Inference. In Neural Information Processing Systems (NIPS). 1152\u20131160. \t\t\t\t  David Wingate Noah D. Goodman Andreas Stuhlm\u00fcller and Jeffrey Mark Siskind. 2011. Nonstandard Interpretations of Probabilistic Programs for Efficient Inference. In Neural Information Processing Systems (NIPS). 1152\u20131160."},{"key":"e_1_2_1_55_1","volume-title":"Goodman","author":"Wingate David","year":"2011","unstructured":"David Wingate , Andreas Stuhlm\u00fcller , and Noah D . Goodman . 2011 . Lightweight Implementations of Probabilistic Programming Languages Via Transformational Compilation. In Artificial Intelligence and Statistics (AISTATS) . 770\u2013778. David Wingate, Andreas Stuhlm\u00fcller, and Noah D. Goodman. 2011. Lightweight Implementations of Probabilistic Programming Languages Via Transformational Compilation. In Artificial Intelligence and Statistics (AISTATS). 770\u2013778."},{"key":"#cr-split#-e_1_2_1_56_1.1","unstructured":"David Wingate and Theophane Weber. 2013. Automated Variational Inference in Probabilistic Programming. arXiv:1301.1299 https:\/\/doi.org\/10.48550\/ARXIV.1301.1299 10.48550\/ARXIV.1301.1299"},{"key":"#cr-split#-e_1_2_1_56_1.2","unstructured":"David Wingate and Theophane Weber. 2013. Automated Variational Inference in Probabilistic Programming. arXiv:1301.1299 https:\/\/doi.org\/10.48550\/ARXIV.1301.1299"},{"key":"e_1_2_1_57_1","volume-title":"Jan Willem van de Meent, and Vikash Mansinghka","author":"Wood Frank","year":"2014","unstructured":"Frank Wood , Jan Willem van de Meent, and Vikash Mansinghka . 2014 . A New Approach to Probabilistic Programming Inference. In Artificial Intelligence and Statistics (AISTATS) . 1024\u20131032. Frank Wood, Jan Willem van de Meent, and Vikash Mansinghka. 2014. A New Approach to Probabilistic Programming Inference. In Artificial Intelligence and Statistics (AISTATS). 1024\u20131032."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.15252\/msb.20209620"},{"key":"e_1_2_1_59_1","volume-title":"International Conference on Machine Learning (ICML). 11534\u201311545","author":"Zhou Yuan","year":"2020","unstructured":"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 . In International Conference on Machine Learning (ICML). 11534\u201311545 . 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. In International Conference on Machine Learning (ICML). 11534\u201311545."}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3571205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:21Z","timestamp":1750183701000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,9]]},"references-count":62,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2023,1,9]]}},"alternative-id":["10.1145\/3571205"],"URL":"https:\/\/doi.org\/10.1145\/3571205","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,9]]},"assertion":[{"value":"2023-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}