{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T17:44:55Z","timestamp":1772905495122,"version":"3.50.1"},"reference-count":110,"publisher":"Walter de Gruyter GmbH","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,3,26]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Probabilistic modeling lies at the core of machine learning, providing a principled framework to represent and reason about uncertainty. Probabilistic circuits (PCs) have emerged as a class of models that balance representational power with computational efficiency via a deep probabilistic architecture that enables tractable uncertainty handling. This paper provides an overview of PCs as deep and efficient probabilistic models, highlighting their ability to encode complex distributions while maintaining computational guarantees for key inference tasks. We first introduce the foundations of tractable probabilistic modeling with PCs, elaborating on how they represent and handle uncertainty, and the different approaches for structure and parameter learning. We then review successful applications and enhancements, with particular emphasis on recent advances in time series modeling and forecasting, where PCs demonstrate state-of-the-art accuracy while being robust and efficient. Furthermore, we discuss a tractable method to estimate epistemic uncertainty, which is particularly helpful in improving the PCs\u2019 robustness when they are faced with real-world out-of-distribution instances, and provide additional results on the task of time series classification. The paper concludes with a perspective on open challenges and future research directions, including scaling to high-dimensional data, the hybridization with neural architectures, and the transformation and connection with other non-probabilistic models. Overall, this paper examines and underscores the role of PCs as a central approach within probabilistic modeling, pointing out their strengths, limitations, and potential avenues for further development.<\/jats:p>","DOI":"10.1515\/auto-2025-0102","type":"journal-article","created":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:59:36Z","timestamp":1772845176000},"page":"197-211","source":"Crossref","is-referenced-by-count":0,"title":["Deep probabilistic circuits for\u00a0efficient uncertainty handling in\u00a0learning systems"],"prefix":"10.1515","volume":"74","author":[{"given":"Fabrizio","family":"Ventola","sequence":"first","affiliation":[{"name":"AI & ML Lab , TU Darmstadt , Darmstadt , Germany"}]}],"member":"374","published-online":{"date-parts":[[2026,3,9]]},"reference":[{"key":"2026030701434648755_j_auto-2025-0102_ref_001","doi-asserted-by":"crossref","unstructured":"H. A. Simon, Reason in Human Affairs, Redwood City, California, Stanford University Press, 1990.","DOI":"10.1515\/9780804766685"},{"key":"2026030701434648755_j_auto-2025-0102_ref_002","unstructured":"J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, San Francisco, CA, USA, Morgan Kaufmann Publishers Inc., 1988."},{"key":"2026030701434648755_j_auto-2025-0102_ref_003","doi-asserted-by":"crossref","unstructured":"T. W. Hutchison and K. R. Popper, \u201cThe logic of scientific discovery,\u201d Economica, vol.\u00a026, no.\u00a0103, 1959, Art. no. 262, https:\/\/doi.org\/10.2307\/2550489.","DOI":"10.2307\/2550489"},{"key":"2026030701434648755_j_auto-2025-0102_ref_004","doi-asserted-by":"crossref","unstructured":"K. Kampourakis and K. McCain, Uncertainty: How it Makes Science Advance, New York, Oxford University Press, 2019.","DOI":"10.1093\/oso\/9780190871666.001.0001"},{"key":"2026030701434648755_j_auto-2025-0102_ref_005","doi-asserted-by":"crossref","unstructured":"G. F. Cooper, \u201cThe computational complexity of probabilistic inference using Bayesian belief networks,\u201d Artif. Intell., vol.\u00a042, nos. 2\u20133, pp.\u00a0393\u2013405, 1990, https:\/\/doi.org\/10.1016\/0004-3702(90)90060-D.","DOI":"10.1016\/0004-3702(90)90060-D"},{"key":"2026030701434648755_j_auto-2025-0102_ref_006","doi-asserted-by":"crossref","unstructured":"P. Dagum and M. Luby, \u201cApproximating probabilistic inference in Bayesian belief networks is NP-hard,\u201d Artif. Intell., vol.\u00a060, no.\u00a01, pp.\u00a0141\u2013153, 1993, https:\/\/doi.org\/10.1016\/0004-3702(93)90036-B.","DOI":"10.1016\/0004-3702(93)90036-B"},{"key":"2026030701434648755_j_auto-2025-0102_ref_007","doi-asserted-by":"crossref","unstructured":"D. Roth, \u201cOn the hardness of approximate reasoning,\u201d Artif. Intell., vol.\u00a082, nos. 1\u20132, pp.\u00a0273\u2013302, 1996, https:\/\/doi.org\/10.1016\/0004-3702(94)00092-1.","DOI":"10.1016\/0004-3702(94)00092-1"},{"key":"2026030701434648755_j_auto-2025-0102_ref_008","unstructured":"A. Kulesza and F. Pereira, \u201cStructured learning with approximate inference,\u201d in Advances in Neural Information Processing Systems 20, Proceedings of the Twenty-First Annual Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada, December 3\u20136, 2007, J. C. Platt, D. Koller, Y. Singer, and S. T. Roweis, Eds., Curran Associates, Inc., 2007, pp.\u00a0785\u2013792. Available at: https:\/\/proceedings.neurips.cc\/paper\/2007\/hash\/32b30a250abd6331e03a2a1f16466346-Abstract.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_009","unstructured":"A. Y. K. Foong, D. R. Burt, Y. Li, and R. E. Turner, \u201cOn the expressiveness of approximate inference in Bayesian neural networks,\u201d in Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6\u201312, 2020, H. Larochelle, M. A. Ranzato, R. Hadsell, M.-F. Balcan, and H.-T. Lin, Eds., Virtual, 2020. Available at: https:\/\/proceedings.neurips.cc\/paper\/2020\/hash\/b6dfd41875bc090bd31d0b1740eb5b1b-Abstract.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_010","doi-asserted-by":"crossref","unstructured":"A. Darwiche and G. M. Provan, \u201cQuery DAGs: A practical paradigm for implementing belief-network inference,\u201d J. Artif. Intell. Res., vol.\u00a06, pp.\u00a0147\u2013176, 1997, https:\/\/doi.org\/10.1613\/JAIR.330.","DOI":"10.1613\/jair.330"},{"key":"2026030701434648755_j_auto-2025-0102_ref_011","doi-asserted-by":"crossref","unstructured":"A. Darwiche, \u201cA differential approach to inference in Bayesian networks,\u201d J. ACM, vol.\u00a050, no.\u00a03, pp.\u00a0280\u2013305, 2003, https:\/\/doi.org\/10.1145\/765568.765570.","DOI":"10.1145\/765568.765570"},{"key":"2026030701434648755_j_auto-2025-0102_ref_012","doi-asserted-by":"crossref","unstructured":"H. Poon and P. M. Domingos, \u201cSum-product networks: A new deep architecture,\u201d in UAI 2011, Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, Barcelona, Spain, July 14\u201317, 2011, F. G. Cozman and A. Pfeffer, Eds., AUAI Press, 2011, pp.\u00a0337\u2013346.","DOI":"10.1109\/ICCVW.2011.6130310"},{"key":"2026030701434648755_j_auto-2025-0102_ref_013","unstructured":"Y. J. Choi, A. Vergari, and G. Van den Broeck, Probabilistic Circuits: A Unifying Framework for Tractable Probabilistic Models. Technical report, Los Angeles, University of California, 2020."},{"key":"2026030701434648755_j_auto-2025-0102_ref_014","doi-asserted-by":"crossref","unstructured":"Z. Ghahramani, \u201cProbabilistic machine learning and artificial intelligence,\u201d Nature, vol.\u00a0521, no.\u00a07553, pp.\u00a0452\u2013459, 2015, https:\/\/doi.org\/10.1038\/nature14541.","DOI":"10.1038\/nature14541"},{"key":"2026030701434648755_j_auto-2025-0102_ref_017","doi-asserted-by":"crossref","unstructured":"E. H\u00fcllermeier and W. Waegeman, \u201cAleatoric and epistemic uncertainty in machine learning: An introduction to concepts and methods,\u201d Mach. Learn., vol.\u00a0110, no.\u00a03, pp.\u00a0457\u2013506, 2021, https:\/\/doi.org\/10.1007\/S10994-021-05946-3.","DOI":"10.1007\/s10994-021-05946-3"},{"key":"2026030701434648755_j_auto-2025-0102_ref_018","unstructured":"D. Hendrycks and T. G. Dietterich, \u201cBenchmarking neural network robustness to common corruptions and perturbations,\u201d in 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6\u20139, 2019, OpenReview.net, 2019. Available at: https:\/\/openreview.net\/forum?id=HJz6tiCqYm."},{"key":"2026030701434648755_j_auto-2025-0102_ref_019","unstructured":"L. Wimmer, Y. Sale, P. Hofman, B. Bischl, and E. H\u00fcllermeier, \u201cQuantifying aleatoric and epistemic uncertainty in machine learning: Are conditional entropy and mutual information appropriate measures?\u201d in Uncertainty in Artificial Intelligence, UAI 2023, July 31 \u2013 4 August 2023, Pittsburgh, PA, USA, volume 216 of Proceedings of Machine Learning Research, R. J. Evans and I. Shpitser, Eds., PMLR, 2023, pp.\u00a02282\u20132292. Available at: https:\/\/proceedings.mlr.press\/v216\/wimmer23a.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_020","doi-asserted-by":"crossref","unstructured":"O. Shorinwa, Z. Mei, J. Lidard, A. Z. Ren, and A. Majumdar, \u201cA survey on uncertainty quantification of large language models: Taxonomy, open research challenges, and future directions,\u201d ACM Comput. Surv., vol.\u00a058, no.\u00a03, pp.\u00a063:1\u201363:38, 2026, https:\/\/doi.org\/10.1145\/3744238.","DOI":"10.1145\/3744238"},{"key":"2026030701434648755_j_auto-2025-0102_ref_021","unstructured":"F. Bickford Smith, J. Kossen, E. Trollope, M. van der Wilk, A. Foster, and T. Rainforth, \u201cRethinking aleatoric and epistemic uncertainty,\u201d in Forty-second International Conference on Machine Learning, ICML 2025, Vancouver, BC, Canada, July 13\u201319, 2025, OpenReview.net, 2025. Available at: https:\/\/openreview.net\/forum?id=CY9MlORQs5."},{"key":"2026030701434648755_j_auto-2025-0102_ref_022","unstructured":"Y. Gal, R. Islam, and Z. Ghahramani, \u201cDeep Bayesian active learning with image data,\u201d in ICML, 2017."},{"key":"2026030701434648755_j_auto-2025-0102_ref_023","unstructured":"S. Ebrahimi, M. Elhoseiny, T. Darrell, and R. Marcus, \u201cUncertainty-guided continual learning with Bayesian neural networks,\u201d in ICLR, 2020."},{"key":"2026030701434648755_j_auto-2025-0102_ref_024","doi-asserted-by":"crossref","unstructured":"C.-C. Zong and S.-J. Huang, \u201cRethinking epistemic and aleatoric uncertainty for active open-set annotation: An energy-based approach,\u201d in IEEE\/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2025, Nashville, TN, USA, June 11\u201315, 2025, Computer Vision Foundation\/IEEE, 2025, pp.\u00a010153\u201310162. Available at: https:\/\/openaccess.thecvf.com\/content\/CVPR2025\/html\/Zong_Rethinking_Epistemic_and_Aleatoric_Uncertainty_for_Active_Open-Set_Annotation_An_CVPR_2025_paper.html.","DOI":"10.1109\/CVPR52734.2025.00949"},{"key":"2026030701434648755_j_auto-2025-0102_ref_025","doi-asserted-by":"crossref","unstructured":"G. E. Hinton, S. Osindero, and Y.-W. Teh, \u201cA fast learning algorithm for deep belief nets,\u201d Neural Comput., vol.\u00a018, no.\u00a07, pp.\u00a01527\u20131554, 2006, https:\/\/doi.org\/10.1162\/neco.2006.18.7.1527.","DOI":"10.1162\/neco.2006.18.7.1527"},{"key":"2026030701434648755_j_auto-2025-0102_ref_026","unstructured":"R. Salakhutdinov and G. Hinton, \u201cDeep Boltzmann machines,\u201d in Proc. of AISTATS, 2009."},{"key":"2026030701434648755_j_auto-2025-0102_ref_027","unstructured":"H. Larochelle and I. Murray, \u201cThe neural autoregressive distribution estimator,\u201d in Proc. of AISTATS, 2011, pp.\u00a029\u201337."},{"key":"2026030701434648755_j_auto-2025-0102_ref_028","unstructured":"D. P. Kingma and M. Welling, \u201cAuto-encoding variational bayes,\u201d in ICLR, 2014."},{"key":"2026030701434648755_j_auto-2025-0102_ref_029","doi-asserted-by":"crossref","unstructured":"T. Rahman, P. Kothalkar, and V. Gogate, \u201cCutset networks: A simple, tractable, and scalable approach for improving the accuracy of Chow-Liu trees,\u201d in ECML-PKDD, vol.\u00a08725, Springer, 2014, pp.\u00a0630\u2013645.","DOI":"10.1007\/978-3-662-44851-9_40"},{"key":"2026030701434648755_j_auto-2025-0102_ref_030","unstructured":"Y. Liang, J. Bekker, and G. Van den Broeck, \u201cLearning the structure of probabilistic sentential decision diagrams,\u201d in UAI, 2017."},{"key":"2026030701434648755_j_auto-2025-0102_ref_031","doi-asserted-by":"crossref","unstructured":"R. Schwartz, J. Dodge, N. A. Smith, and O. Etzioni, \u201cGreen AI,\u201d Commun. ACM, vol.\u00a063, no.\u00a012, pp.\u00a054\u201363, 2020, https:\/\/doi.org\/10.1145\/3381831.","DOI":"10.1145\/3381831"},{"key":"2026030701434648755_j_auto-2025-0102_ref_032","doi-asserted-by":"crossref","unstructured":"P. Li, J. Yang, M. A. Islam, and S. Ren, \u201cMaking AI less \u2018thirsty\u2019,\u201d Commun. ACM, vol.\u00a068, no.\u00a07, pp.\u00a054\u201361, 2025, https:\/\/doi.org\/10.1145\/3724499.","DOI":"10.1145\/3724499"},{"key":"2026030701434648755_j_auto-2025-0102_ref_033","unstructured":"M. Germain, K. Gregor, I. Murray, and H. Larochelle, \u201cMade: Masked autoencoder for distribution estimation,\u201d in Proc. of ICML, 2015, pp.\u00a0881\u2013889."},{"key":"2026030701434648755_j_auto-2025-0102_ref_034","unstructured":"G. Papamakarios, E. Nalisnick, D. J. Rezende, S. Mohamed, and B. Lakshminarayanan, \u201cNormalizing flows for probabilistic modeling and inference,\u201d JMLR, vol. 22, no. 57, pp. 1\u201364, 2021."},{"key":"2026030701434648755_j_auto-2025-0102_ref_035","doi-asserted-by":"crossref","unstructured":"C. Chow and C. Liu, \u201cApproximating discrete probability distributions with dependence trees,\u201d IEEE Trans. Inf. Theor., vol.\u00a014, no.\u00a03, pp.\u00a0462\u2013467, 1968, https:\/\/doi.org\/10.1109\/tit.1968.1054142.","DOI":"10.1109\/TIT.1968.1054142"},{"key":"2026030701434648755_j_auto-2025-0102_ref_036","unstructured":"R. Peharz, S. Tschiatschek, F. Pernkopf, and P. Domingos, \u201cOn theoretical properties of sum-product networks,\u201d in Artificial Intelligence and Statistics (AISTATS), 2015, pp.\u00a0744\u2013752."},{"key":"2026030701434648755_j_auto-2025-0102_ref_037","doi-asserted-by":"crossref","unstructured":"Z. Yuan, H. Wang, L. Wang, T. Lu, S. Palaiahnakote, and C. L. Tan, \u201cModeling spatial layout for scene image understanding via a novel multiscale sum-product network,\u201d Expert Syst. Appl., vol.\u00a063, pp.\u00a0231\u2013240, 2016, https:\/\/doi.org\/10.1016\/j.eswa.2016.07.015.","DOI":"10.1016\/j.eswa.2016.07.015"},{"key":"2026030701434648755_j_auto-2025-0102_ref_038","unstructured":"T. Adel, D. Balduzzi, and A. Ghodsi, \u201cLearning the structure of sum-product networks via an SVD-based algorithm,\u201d in Proc. of UAI, 2015."},{"key":"2026030701434648755_j_auto-2025-0102_ref_039","unstructured":"K. Stelzner, R. Peharz, and K. Kersting, \u201cFaster attend-infer-repeat with tractable probabilistic models,\u201d in ICML, volume 97 of Proceedings of Machine Learning Research, PMLR, 2019, pp.\u00a05966\u20135975."},{"key":"2026030701434648755_j_auto-2025-0102_ref_040","doi-asserted-by":"crossref","unstructured":"C. J. Butz, J. D. S. Oliveira, A. E. dos Santos, and A. L. Teixeira, \u201cDeep convolutional sum-product networks,\u201d in The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 \u2013 February 1, 2019, AAAI Press, 2019, pp.\u00a03248\u20133255.","DOI":"10.1609\/aaai.v33i01.33013248"},{"key":"2026030701434648755_j_auto-2025-0102_ref_041","doi-asserted-by":"crossref","unstructured":"M. R. Amer and S. Todorovic, \u201cSum-product networks for modeling activities with stochastic structure,\u201d in 2012 IEEE Conference on Computer Vision and Pattern Recognition, IEEE, 2012, pp.\u00a01314\u20131321.","DOI":"10.1109\/CVPR.2012.6247816"},{"key":"2026030701434648755_j_auto-2025-0102_ref_042","doi-asserted-by":"crossref","unstructured":"M. R. Amer and S. Todorovic, \u201cSum product networks for activity recognition,\u201d IEEE Trans. Pattern Anal. Mach. Intell., vol.\u00a038, no.\u00a04, pp.\u00a0800\u2013813, 2016, https:\/\/doi.org\/10.1109\/tpami.2015.2465955.","DOI":"10.1109\/TPAMI.2015.2465955"},{"key":"2026030701434648755_j_auto-2025-0102_ref_043","unstructured":"L. Isabel Galindez Olascoaga, W. Meert, N. Shah, M. Verhelst, and G. Van den Broeck, \u201cTowards hardware-aware tractable learning of probabilistic models,\u201d in Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8\u201314, 2019, H. M. Wallach, H. Larochelle, A. Beygelzimer, F. d\u2019Alch\u00e9-Buc, E. B. Fox, and R. Garnett, Eds., Vancouver, BC, Canada, 2019, pp.\u00a013726\u201313736. Available at: https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/e77910ebb93b511588557806310f78f1-Abstract.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_044","doi-asserted-by":"crossref","unstructured":"W.-C. Cheng, S. Kok, H. V. Pham, H. L. Chieu, and K. M. A. Chai, \u201cLanguage modeling with sum-product networks,\u201d in Proc. of INTERSPEECH, 2014, pp.\u00a02098\u20132102.","DOI":"10.21437\/Interspeech.2014-476"},{"key":"2026030701434648755_j_auto-2025-0102_ref_045","doi-asserted-by":"crossref","unstructured":"A. Molina, S. Natarajan, and K. Kersting, \u201cPoisson sum-product networks: A deep architecture for tractable multivariate Poisson distributions,\u201d in Proc. of AAAI, 2017.","DOI":"10.1609\/aaai.v31i1.10844"},{"key":"2026030701434648755_j_auto-2025-0102_ref_046","doi-asserted-by":"crossref","unstructured":"R. Peharz, G. Kapeller, P. Mowlaee, and F. Pernkopf, \u201cModeling speech with sum-product networks: Application to bandwidth extension,\u201d in 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, 2014, pp.\u00a03699\u20133703.","DOI":"10.1109\/ICASSP.2014.6854292"},{"key":"2026030701434648755_j_auto-2025-0102_ref_047","unstructured":"M. Ratajczak, S. Tschiatschek, and F. Pernkopf, \u201cSum-product networks for structured prediction: Context-specific deep conditional random fields,\u201d in Proc. of ICML Workshop on Tractable Probabilistic Models, 2014."},{"key":"2026030701434648755_j_auto-2025-0102_ref_048","doi-asserted-by":"crossref","unstructured":"K. Zheng, A. Pronobis, and R. P. N. Rao, \u201cLearning graph-structured sum-product networks for probabilistic semantic maps,\u201d in AAAI, AAAI Press, 2018, pp.\u00a04547\u20134555.","DOI":"10.1609\/aaai.v32i1.11743"},{"key":"2026030701434648755_j_auto-2025-0102_ref_049","doi-asserted-by":"crossref","unstructured":"Y. J. Choi, M. Dang, and G. Van den Broeck, \u201cGroup fairness by probabilistic modeling with latent fair decisions,\u201d Proc. AAAI Conf. Artif. Intell., vol.\u00a035, no.\u00a013, pp.\u00a012051\u201312059, 2021, https:\/\/doi.org\/10.1609\/aaai.v35i13.17431.","DOI":"10.1609\/aaai.v35i13.17431"},{"key":"2026030701434648755_j_auto-2025-0102_ref_050","unstructured":"L. Loconte, N. Di Mauro, R. Peharz, and A. Vergari, \u201cHow to turn your knowledge graph embeddings into generative models,\u201d in Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 \u2013 16, 2023, A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine, Eds., 2023. Available at: http:\/\/papers.nips.cc\/paper_files\/paper\/2023\/hash\/f4b768188be63b8d2680a46934fd295a-Abstract-Conference.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_051","unstructured":"M. Zecevic, D. Singh Dhami, A. Karanam, S. Natarajan, and K. Kersting, \u201cInterventional sum-product networks: Causal inference with tractable probabilistic models,\u201d in Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6\u201314, 2021, Virtual, M. Ranzato, A. Beygelzimer, Y. N. Dauphin, P. Liang, and J. Wortman Vaughan, Eds., 2021, pp.\u00a015019\u201315031. Available at: https:\/\/proceedings.neurips.cc\/paper\/2021\/hash\/7eb7eabbe9bd03c2fc99881d04da9cbd-Abstract.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_052","unstructured":"H. Poonia, M. Willig, Z. Yu, M. Zecevic, K. Kersting, and D. Singh Dhami, \u201c\u03c7SPN: Characteristic interventional sum-product networks for causal inference in hybrid domains,\u201d in Uncertainty in Artificial Intelligence, 15\u201319 July 2024, Universitat Pompeu Fabra, Barcelona, Spain, volume 244 of Proceedings of Machine Learning Research, N. Kiyavash and J. M. Mooij, Eds., PMLR, 2024, pp.\u00a03004\u20133020. Available at: https:\/\/proceedings.mlr.press\/v244\/poonia24a.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_053","doi-asserted-by":"crossref","unstructured":"A. Nath and P. Domingos, \u201cLearning tractable probabilistic models for fault localization,\u201d Proc. AAAI Conf. Artif. Intell., vol.\u00a030, no.\u00a01, p.\u00a02, 2016, https:\/\/doi.org\/10.1609\/aaai.v30i1.10175.","DOI":"10.1609\/aaai.v30i1.10175"},{"key":"2026030701434648755_j_auto-2025-0102_ref_054","unstructured":"A. Vergari, Y.J. Choi, A. Liu, S. Teso, and G. Van den Broeck, \u201cA compositional atlas of tractable circuit operations for probabilistic inference,\u201d in Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6\u201314, 2021, Virtual, M. Ranzato, A. Beygelzimer, Y. N. Dauphin, P. Liang, and J. W. Vaughan, Eds., 2021, pp.\u00a013189\u201313201. Available at: https:\/\/proceedings.neurips.cc\/paper\/2021\/hash\/6e01383fd96a17ae51cc3e15447e7533-Abstract.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_055","doi-asserted-by":"crossref","unstructured":"A. Molina, A. Vergari, N. Di Mauro, S. Natarajan, F. Esposito, and K. Kersting, \u201cMixed sum-product networks: A deep architecture for hybrid domains,\u201d in Proc. of AAAI, 2018, pp.\u00a03828\u20133835.","DOI":"10.1609\/aaai.v32i1.11731"},{"key":"2026030701434648755_j_auto-2025-0102_ref_056","unstructured":"O. Delalleau and Y. Bengio, \u201cShallow vs. deep sum-product networks,\u201d in Advances in Neural Information Processing Systems, J. Shawe-Taylor, R. S. Zemel, P. L. Bartlett, F. C. N. Pereira, and K. Q. Weinberger, Eds., Red Hook, NY, USA, Curran Associates Inc., 2011, pp. 666\u2013674."},{"key":"2026030701434648755_j_auto-2025-0102_ref_057","unstructured":"J. Martens and V. Medabalimi, \u201cOn the expressive efficiency of sum product networks,\u201d CoRR, abs\/1411.7717, 2014."},{"key":"2026030701434648755_j_auto-2025-0102_ref_058","doi-asserted-by":"crossref","unstructured":"R. Peharz, R. Gens, F. Pernkopf, and P. M. Domingos, \u201cOn the latent variable interpretation in sum-product networks,\u201d IEEE Trans. Pattern Anal. Mach. Intell., vol. 39, no. 10, pp. 2030\u20132044, 2016.","DOI":"10.1109\/TPAMI.2016.2618381"},{"key":"2026030701434648755_j_auto-2025-0102_ref_059","unstructured":"Z. Yu, F. Ventola, N. Thoma, D. Singh Dhami, M. Mundt, and K. Kersting, \u201cPredictive whittle networks for time series,\u201d in Uncertainty in Artificial Intelligence, Proceedings of the Thirty-Eighth Conference on Uncertainty in Artificial Intelligence, UAI 2022, 1\u20135 August 2022, Eindhoven, The Netherlands, volume 180 of Proceedings of Machine Learning Research, J. Cussens and K. Zhang, Eds., PMLR, 2022, pp.\u00a02320\u20132330. Available at: https:\/\/proceedings.mlr.press\/v180\/yu22b.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_060","unstructured":"F. Ventola, S. Braun, Z. Yu, M. Mundt, and K. Kersting, \u201cProbabilistic circuits that know what they don\u2019t know,\u201d in Uncertainty in Artificial Intelligence, UAI 2023, July 31\u20134 August 2023, Pittsburgh, PA, USA, volume 216 of Proceedings of Machine Learning Research, R. J. Evans and I. Shpitser, Eds., PMLR, 2023, pp.\u00a02157\u20132167. Available at: https:\/\/proceedings.mlr.press\/v216\/ventola23a.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_061","unstructured":"R. Gens and P. Domingos, \u201cLearning the structure of sum-product networks,\u201d in ICML, 2013."},{"key":"2026030701434648755_j_auto-2025-0102_ref_062","doi-asserted-by":"crossref","unstructured":"A. Vergari, N. D. Mauro, and F. E. Simplifying, \u201cRegularizing and strengthening sum-product network structure learning,\u201d in Proc. of ECML-PKDD, 2015.","DOI":"10.1007\/978-3-319-23525-7_21"},{"key":"2026030701434648755_j_auto-2025-0102_ref_063","doi-asserted-by":"crossref","unstructured":"R. Peharz, B. Geiger, and F. Pernkopf, \u201cGreedy part-wise learning of sum-product networks,\u201d in Proc. of ECML-PKDD, 2013.","DOI":"10.1007\/978-3-642-40991-2_39"},{"key":"2026030701434648755_j_auto-2025-0102_ref_064","unstructured":"T. Rahman and V. Gogate, \u201cMerging strategies for sum-product networks: From trees to graphs,\u201d in Proc. of UAI, 2016."},{"key":"2026030701434648755_j_auto-2025-0102_ref_065","unstructured":"P. Jaini, A. Ghose, and P. P. Prometheus, \u201cDirectly learning acyclic directed graph structures for sum-product networks,\u201d in Proc. of PGM, 2018."},{"key":"2026030701434648755_j_auto-2025-0102_ref_066","doi-asserted-by":"crossref","unstructured":"N. Di Mauro, F. Esposito, F. G. Ventola, and A. Vergari, \u201cSum-product network structure learning by efficient product nodes discovery,\u201d Intell. Artif., vol. 12, no. 2, pp. 143\u2013159, 2018. https:\/\/doi.org\/10.3233\/ia-170032.","DOI":"10.3233\/IA-170032"},{"key":"2026030701434648755_j_auto-2025-0102_ref_067","unstructured":"A. Rooshenas and D. Lowd, \u201cLearning sum-product networks with direct and indirect variable interactions,\u201d in Proc. of ICML, 2014."},{"key":"2026030701434648755_j_auto-2025-0102_ref_068","unstructured":"D. Lowd and A. Rooshenas, \u201cLearning Markov networks with arithmetic circuits,\u201d in Proc. of AISTATS, 2013, pp.\u00a0406\u2013414."},{"key":"2026030701434648755_j_auto-2025-0102_ref_069","doi-asserted-by":"crossref","unstructured":"D. Conaty, J. M. del Rincon, and C. P. de Campos, \u201cA hierarchy of sum-product networks using robustness,\u201d Int. J. Approx. Reason., vol.\u00a0113, pp.\u00a0245\u2013255, 2019, https:\/\/doi.org\/10.1016\/j.ijar.2019.07.007.","DOI":"10.1016\/j.ijar.2019.07.007"},{"key":"2026030701434648755_j_auto-2025-0102_ref_070","unstructured":"F. Ventola, K. Stelzner, A. Molina, and K. Kersting, \u201cResidual sum-product networks,\u201d in International Conference on Probabilistic Graphical Models, PGM 2020, 23\u201325 September 2020, Aalborg, Hotel Comwell Rebild Bakker, Sk\u00f8rping, Denmark, volume 138 of Proceedings of Machine Learning Research, M. Jaeger and T. D. Nielsen, Eds., PMLR, 2020, pp.\u00a0545\u2013556. Available at: http:\/\/proceedings.mlr.press\/v138\/ventola20a.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_071","doi-asserted-by":"crossref","unstructured":"N. Di Mauro, A. Vergari, T. M. A. Basile, and F. Esposito, \u201cFast and accurate density estimation with extremely randomized cutset networks,\u201d in Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2017, Skopje, Macedonia, September 18\u201322, 2017, Proceedings, Part I, volume 10534 of Lecture Notes in Computer Science, M. Ceci, J. Hollm\u00e9n, L. Todorovski, C. Vens, and S. Dzeroski, Eds., Springer, 2017, pp.\u00a0203\u2013219.","DOI":"10.1007\/978-3-319-71249-9_13"},{"key":"2026030701434648755_j_auto-2025-0102_ref_072","unstructured":"R. Gens and P. Domingos, \u201cDiscriminative learning of sum-product networks,\u201d Adv. Neural Inf. Process. Syst., vol.\u00a025, pp.\u00a03239\u20133247, 2012."},{"key":"2026030701434648755_j_auto-2025-0102_ref_073","doi-asserted-by":"crossref","unstructured":"H. Duan, A. Rashwan, P. Poupart, and Z. Chen, \u201cDiscriminative training of feed-forward and recurrent sum-product networks by extended Baum-Welch,\u201d Int. J. Approx. Reason., vol.\u00a0124, pp.\u00a066\u201381, 2020, https:\/\/doi.org\/10.1016\/j.ijar.2020.02.007.","DOI":"10.1016\/j.ijar.2020.02.007"},{"key":"2026030701434648755_j_auto-2025-0102_ref_074","unstructured":"R. Peharz, R. Gens, and P. Domingos, \u201cLearning selective sum-product networks,\u201d in Workshop on Learning Tractable Probabilistic Models, LTPM, 2014."},{"key":"2026030701434648755_j_auto-2025-0102_ref_075","unstructured":"A. Rashwan, H. Zhao, and P. Poupart, \u201cOnline and distributed Bayesian moment matching for parameter learning in sum-product networks,\u201d in Proc. of the 19th International Conference on Artificial Intelligence and Statistics (AISTATS), 2016, pp.\u00a01469\u20131477."},{"key":"2026030701434648755_j_auto-2025-0102_ref_076","unstructured":"P. Jaini et al.., \u201cOnline algorithms for sum-product networks with continuous variables,\u201d in Proc. of PGMs, 2016."},{"key":"2026030701434648755_j_auto-2025-0102_ref_077","unstructured":"H. Zhao, T. Adel, G. Gordon, and B. Amos, \u201cCollapsed variational inference for sum-product networks,\u201d in In Proc. of the 33rd International Conference on Machine Learning, vol.\u00a048, 2016."},{"key":"2026030701434648755_j_auto-2025-0102_ref_078","unstructured":"H. Zhao, P. Poupart, and G. J. Gordon, \u201cA unified approach for learning the parameters of sum-product networks,\u201d in Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 5\u201310, 2016, D. D. Lee, M. Sugiyama, U. von Luxburg, I. Guyon, and R. Garnett, Eds., Barcelona, Spain, 2016, pp.\u00a0433\u2013441. Available at: https:\/\/proceedings.neurips.cc\/paper\/2016\/hash\/6c9882bbac1c7093bd25041881277658-Abstract.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_079","unstructured":"M. Trapp, T. Madl, R. Peharz, F. Pernkopf, and R. Trappl, \u201cSafe semi-supervised learning of sum-product networks,\u201d in Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, UAI 2017, Sydney, Australia, August 11\u201315, 2017, G. Elidan, K. Kersting, and A. Ihler, Eds., AUAI Press, 2017. Available at: http:\/\/auai.org\/uai2017\/proceedings\/papers\/108.pdf."},{"key":"2026030701434648755_j_auto-2025-0102_ref_080","doi-asserted-by":"crossref","unstructured":"A. Vergari, A. Molina, R. Peharz, Z. Ghahramani, K. Kersting, and I. Valera, \u201cAutomatic Bayesian density analysis,\u201d in The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 \u2013 February 1, 2019, AAAI Press, 2019, pp.\u00a05207\u20135215.","DOI":"10.1609\/aaai.v33i01.33015207"},{"key":"2026030701434648755_j_auto-2025-0102_ref_081","unstructured":"R. Peharz et al.., \u201cRandom sum-product networks: A simple and effective approach to probabilistic deep learning,\u201d in Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, UAI 2019, Tel Aviv, Israel, July 22\u201325, 2019, volume 115 of Proceedings of Machine Learning Research, A. Globerson and R. Silva, Eds., AUAI Press, 2019, pp.\u00a0334\u2013344. Available at: http:\/\/proceedings.mlr.press\/v115\/peharz20a.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_082","unstructured":"R. Peharz et al.., \u201cEinsum networks: Fast and scalable learning of tractable probabilistic circuits,\u201d in Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13\u201318 July 2020, Virtual Event, volume 119 of Proceedings of Machine Learning Research, PMLR, 2020, pp.\u00a07563\u20137574. Available at: http:\/\/proceedings.mlr.press\/v119\/peharz20a.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_083","unstructured":"A. Liu, K. Ahmed, and G. Van den Broeck, \u201cScaling tractable probabilistic circuits: A systems perspective,\u201d in Forty-first International Conference on Machine Learning, ICML 2024, Vienna, Austria, July 21\u201327, 2024, OpenReview.net, 2024. Available at: https:\/\/openreview.net\/forum?id=BIbjwcrg0V."},{"key":"2026030701434648755_j_auto-2025-0102_ref_084","doi-asserted-by":"crossref","unstructured":"X. Shao et al.., \u201cConditional sum-product networks: Modular probabilistic circuits via gate functions,\u201d Int. J. Approx. Reason., vol.\u00a0140, pp.\u00a0298\u2013313, 2022, https:\/\/doi.org\/10.1016\/J.IJAR.2021.10.011.","DOI":"10.1016\/j.ijar.2021.10.011"},{"key":"2026030701434648755_j_auto-2025-0102_ref_085","unstructured":"M. Melibari, P. Poupart, P. Doshi, and T. George, \u201cDynamic sum product networks for tractable inference on sequence data,\u201d in Proc. of International Conference on PGM, 2016, pp.\u00a0345\u2013355."},{"key":"2026030701434648755_j_auto-2025-0102_ref_086","unstructured":"M. Trapp, R. Peharz, F. Pernkopf, and C. E. Rasmussen, \u201cDeep structured mixtures of Gaussian processes,\u201d in Proc. of AISTATS, 2020, pp.\u00a02251\u20132261."},{"key":"2026030701434648755_j_auto-2025-0102_ref_087","doi-asserted-by":"crossref","unstructured":"F. R. Bach and M. I. Jordan, \u201cLearning graphical models for stationary time series,\u201d IEEE Trans. Signal Process., vol.\u00a052, no.\u00a08, pp.\u00a02189\u20132199, 2004, https:\/\/doi.org\/10.1109\/tsp.2004.831032.","DOI":"10.1109\/TSP.2004.831032"},{"key":"2026030701434648755_j_auto-2025-0102_ref_088","unstructured":"A. Tank, N. J. Foti, and E. B. Fox, \u201cBayesian structure learning for stationary time series,\u201d in Proc. of UAI, 2015, pp.\u00a0872\u2013881."},{"key":"2026030701434648755_j_auto-2025-0102_ref_089","doi-asserted-by":"crossref","unstructured":"P. Whittle, \u201cThe analysis of multiple stationary time series,\u201d J. Roy. Stat. Soc. B Stat. Methodol., vol.\u00a015, no.\u00a01, pp.\u00a0125\u2013139, 1953, https:\/\/doi.org\/10.1111\/j.2517-6161.1953.tb00131.x.","DOI":"10.1111\/j.2517-6161.1953.tb00131.x"},{"key":"2026030701434648755_j_auto-2025-0102_ref_090","unstructured":"Z. Yu, F. Ventola, and K. Kersting, \u201cWhittle networks: A deep likelihood model for time series,\u201d in ICML, 2021."},{"key":"2026030701434648755_j_auto-2025-0102_ref_091","doi-asserted-by":"crossref","unstructured":"S. Hochreiter and J. Schmidhuber, \u201cLong short-term memory,\u201d Neural Comput., vol.\u00a09, no.\u00a08, pp.\u00a01735\u20131780, 1997, https:\/\/doi.org\/10.1162\/neco.1997.9.8.1735.","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"2026030701434648755_j_auto-2025-0102_ref_092","doi-asserted-by":"crossref","unstructured":"D. Salinas, V. Flunkert, J. Gasthaus, and T. Januschowski, \u201cDeepAR: Probabilistic forecasting with autoregressive recurrent networks,\u201d Int. J. Forecast., vol.\u00a036, no.\u00a03, pp.\u00a01181\u20131191, 2020, https:\/\/doi.org\/10.1016\/j.ijforecast.2019.07.001.","DOI":"10.1016\/j.ijforecast.2019.07.001"},{"key":"2026030701434648755_j_auto-2025-0102_ref_093","doi-asserted-by":"crossref","unstructured":"H. Zhou et al.., \u201cInformer: Beyond efficient transformer for long sequence time-series forecasting,\u201d Proc. AAAI Conf. Artif. Intell., vol.\u00a035, no.\u00a012, pp.\u00a011106\u201311115, 2021, https:\/\/doi.org\/10.1609\/aaai.v35i12.17325.","DOI":"10.1609\/aaai.v35i12.17325"},{"key":"2026030701434648755_j_auto-2025-0102_ref_094","unstructured":"Y. Gal and Z. Ghahramani, \u201cDropout as a Bayesian approximation: Representing model uncertainty in deep learning,\u201d in ICML, 2016."},{"key":"2026030701434648755_j_auto-2025-0102_ref_095","unstructured":"C. Guo, G. Pleiss, Y. Sun, and K. Q. Weinberger, \u201cOn calibration of modern neural networks,\u201d in ICML, 2017."},{"key":"2026030701434648755_j_auto-2025-0102_ref_096","doi-asserted-by":"crossref","unstructured":"H. O. Obie, C. Chua, I. Avazpour, M. Abdelrazek, J. Grundy, and T. Bednarz, \u201cPedaViz: Visualising hour-level pedestrian activity,\u201d in Proceedings of the 11th International Symposium on Visual Information Communication and Interaction, VINCI 2018, V\u00e4xj\u00f6, Sweden, August 13\u201315, 2018, A. Kerren, K. Klein, and Y.-N. Li, Eds., ACM, 2018, pp.\u00a09\u201316.","DOI":"10.1145\/3231622.3231626"},{"key":"2026030701434648755_j_auto-2025-0102_ref_097","doi-asserted-by":"crossref","unstructured":"J. Cezar Felipe, A. J. M. Traina, and C. TrainaJr., \u201cA new similarity measure for histograms applied to content-based retrieval of medical images,\u201d in Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), Dijon, France, April 23\u201327, 2006, H. Haddad, Ed., ACM, 2006, pp.\u00a0258\u2013259.","DOI":"10.1145\/1141277.1141336"},{"key":"2026030701434648755_j_auto-2025-0102_ref_098","unstructured":"A. H. C. Correia, R. Peharz, and C. P. de Campos, \u201cJoints in random forests,\u201d in Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6\u201312, 2020, H. Larochelle, M.\u2019A. Ranzato, R. Hadsell, M.-F. Balcan, and H.-T. Lin, Eds., virtual, 2020, Available at: https:\/\/proceedings.neurips.cc\/paper\/2020\/hash\/8396b14c5dff55d13eea57487bf8ed26-Abstract.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_099","doi-asserted-by":"crossref","unstructured":"F. Ventola, D. Singh Dhami, and K. Kersting, \u201cGenerative clausal networks: Relational decision trees as probabilistic circuits,\u201d in Inductive Logic Programming \u2013 30th International Conference, ILP 2021, Virtual Event, October 25\u201327, 2021, Proceedings, volume 13191 of Lecture Notes in Computer Science, N. Katzouris and A. Artikis, Eds., Springer, 2021, pp.\u00a0251\u2013265.","DOI":"10.1007\/978-3-030-97454-1_18"},{"key":"2026030701434648755_j_auto-2025-0102_ref_100","unstructured":"J. Seng, F. Ventola, Z. Yu, and K. Kersting, \u201cHyperparameter optimization via interacting with probabilistic circuits,\u201d in International Conference on Automated Machine Learning, 8\u201311 September 2025, New York City, USA, Roosevelt Island, 2025."},{"key":"2026030701434648755_j_auto-2025-0102_ref_101","doi-asserted-by":"crossref","unstructured":"A. Skryagin, D. Ochs, D. Singh Dhami, and K. Kersting, \u201cScalable neural-probabilistic answer set programming,\u201d J. Artif. Intell. Res., vol.\u00a078, pp.\u00a0579\u2013617, 2023, https:\/\/doi.org\/10.1613\/JAIR.1.15027.","DOI":"10.1613\/jair.1.15027"},{"key":"2026030701434648755_j_auto-2025-0102_ref_102","doi-asserted-by":"crossref","unstructured":"A. Vergari, N. Di Mauro, and F. Esposito, \u201cVisualizing and understanding sum-product networks,\u201d Mach. Learn., vol.\u00a0108, no.\u00a04, pp.\u00a0551\u2013573, 2018, https:\/\/doi.org\/10.1007\/s10994-018-5760-y.","DOI":"10.1007\/s10994-018-5760-y"},{"key":"2026030701434648755_j_auto-2025-0102_ref_103","unstructured":"S. Braun, S. Sidheekh, A. Vergari, M. Mundt, S. Natarajan, and K. Kersting, \u201cTractable representation learning with probabilistic circuits,\u201d CoRR, abs\/2507.04385, 2025, https:\/\/doi.org\/10.48550\/ARXIV.2507.04385."},{"key":"2026030701434648755_j_auto-2025-0102_ref_104","unstructured":"A. Liu, S. Mandt, and G. Van den Broeck, \u201cLossless compression with probabilistic circuits,\u201d in The Tenth International Conference on Learning Representations, ICLR 2022, Virtual Event, April 25\u201329, 2022, OpenReview.net, 2022. Available at: https:\/\/openreview.net\/forum?id=X_hByk2-5je."},{"key":"2026030701434648755_j_auto-2025-0102_ref_105","unstructured":"S. Lang, M. Mundt, F. Ventola, R. Peharz, and K. Kersting, \u201cElevating perceptual sample quality in PCs through differentiable sampling,\u201d in NeurIPS 2021 Workshop on Pre-Registration in Machine Learning, volume 181 of Proceedings of Machine Learning Research, S. Albanie, J. F. Henriques, L. Bertinetto, A. Hern\u00e1ndez-Garc\u00eda, H. Doughty, and G. Varol, Eds., PMLR, 2022, pp.\u00a01\u201325. Available at: https:\/\/proceedings.mlr.press\/v181\/lang22a.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_106","unstructured":"I. J. Goodfellow et al.., \u201cGenerative adversarial nets,\u201d in Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, December 8\u201313 2014, Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, and K. Q. Weinberger, Eds., Montreal, Quebec, Canada, 2014, pp.\u00a02672\u20132680. Available at: https:\/\/proceedings.neurips.cc\/paper\/2014\/hash\/5ca3e9b122f61f8f06494c97b1afccf3-Abstract.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_107","unstructured":"D. P. Kingma and M. Welling, \u201cAuto-encoding variational bayes,\u201d in 2nd International Conference on Learning Representations, ICLR 2014, Banff, AB, Canada, April 14\u201316, 2014, Conference Track Proceedings, Y. Bengio and Y. LeCun, Eds., 2014. Available at: http:\/\/arxiv.org\/abs\/1312.6114."},{"key":"2026030701434648755_j_auto-2025-0102_ref_108","unstructured":"A. Liu, H. Zhang, and G. Van den Broeck, \u201cScaling up probabilistic circuits by latent variable distillation,\u201d in The Eleventh International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, May 1\u20135, 2023, OpenReview.net, 2023. Available at: https:\/\/openreview.net\/forum?id=067CGykiZTS."},{"key":"2026030701434648755_j_auto-2025-0102_ref_109","unstructured":"S. Sidheekh, K. Kersting, and S. Natarajan, \u201cProbabilistic flow circuits: Towards unified deep models for tractable probabilistic inference,\u201d in Uncertainty in Artificial Intelligence, UAI 2023, July 31 \u2013 4 August 2023, Pittsburgh, PA, USA, volume 216 of Proceedings of Machine Learning Research, R. J. Evans and I. Shpitser, Eds., PMLR, 2023, pp.\u00a01964\u20131973. Available at: https:\/\/proceedings.mlr.press\/v216\/sidheekh23a.html."},{"key":"2026030701434648755_j_auto-2025-0102_ref_110","unstructured":"L. Loconte et al.., \u201cWhat is the relationship between tensor factorizations and circuits (and how can we exploit it)?\u201d in Transactions on Machine Learning Research, 2025. Available at: https:\/\/openreview.net\/forum?id=Y7dRmpGiHj."},{"key":"2026030701434648755_j_auto-2025-0102_ref_015","doi-asserted-by":"crossref","unstructured":"P. Diaconis, S. Holmes, and R. Montgomery, \u201cDynamical bias in the coin toss,\u201d SIAM Rev., vol.\u00a049, no.\u00a02, pp.\u00a0211\u2013235, 2007, https:\/\/doi.org\/10.1137\/s0036144504446436.","DOI":"10.1137\/S0036144504446436"},{"key":"2026030701434648755_j_auto-2025-0102_ref_016","doi-asserted-by":"crossref","unstructured":"F. Barto\u0161 et al.., \u201cFair coins tend to land on the same side they started: Evidence from 350,757 flips,\u201d J. Am. Stat. Assoc., vol.\u00a0120, no.\u00a0552, pp.\u00a02118\u20132127, 2025, https:\/\/doi.org\/10.1080\/01621459.2025.2516210.","DOI":"10.1080\/01621459.2025.2516210"}],"container-title":["at - Automatisierungstechnik"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/auto-2025-0102\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/auto-2025-0102\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T01:44:30Z","timestamp":1772847870000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/auto-2025-0102\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,1]]},"references-count":110,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,3,9]]},"published-print":{"date-parts":[[2026,3,26]]}},"alternative-id":["10.1515\/auto-2025-0102"],"URL":"https:\/\/doi.org\/10.1515\/auto-2025-0102","relation":{},"ISSN":["0178-2312","2196-677X"],"issn-type":[{"value":"0178-2312","type":"print"},{"value":"2196-677X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,1]]}}}