{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:16:24Z","timestamp":1746159384041,"version":"3.40.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031913976","type":"print"},{"value":"9783031913983","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-91398-3_16","type":"book-chapter","created":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T22:05:06Z","timestamp":1746137106000},"page":"209-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Imposing Constraints in\u00a0Probabilistic Circuits via\u00a0Gradient Optimization"],"prefix":"10.1007","author":[{"given":"Soroush","family":"Ghandi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Quost","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cassio","family":"de Campos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,2]]},"reference":[{"key":"16_CR1","unstructured":"Van\u00a0den Broeck, G., Di\u00a0Mauro, N., Vergari, A.: Tractable probabilistic models: representations, algorithms, learning, and applications (2019). Tutorial at Uncertainty in Artificial Intelligence (UAI) 2019. http:\/\/web.cs.ucla.edu\/~guyvdb\/slides\/TPMTutorialUAI19.pdf"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ijar.2007.08.002","volume":"49","author":"FG Cozman","year":"2008","unstructured":"Cozman, F.G., de Campos, C.P., da Rocha, J.: Probabilistic logic with independence. Int. J. Approx. Reason. 49(1), 3\u201317 (2008)","journal-title":"Int. J. Approx. Reason."},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/765568.765570","volume":"50","author":"A Darwiche","year":"2003","unstructured":"Darwiche, A.: A differential approach to inference in Bayesian networks. J. ACM 50(3), 280\u2013305 (2003)","journal-title":"J. ACM"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Ghandi, S., Quost, B., de\u00a0Campos, C.: Probabilistic circuits with constraints via convex optimization. arXiv preprint arXiv:2403.13125 (2024)","DOI":"10.1007\/978-3-031-70352-2_10"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Hansen, P., Jaumard, B.: Probabilistic satisfiability. In: Handbook of Defeasible Reasoning and Uncertainty Management Systems: Algorithms for uncertainty and defeasible reasoning, pp. 321\u2013367. Springer (2000)","DOI":"10.1007\/978-94-017-1737-3_8"},{"key":"16_CR6","unstructured":"Karanam, A., Mathur, S., Sidheekh, S., Natarajan, S.: Bayesian learning of probabilistic circuits with domain constraints. In: The 6th Workshop on Tractable Probabilistic Modeling (2023)"},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1452","volume":"12","author":"T Le Quy","year":"2022","unstructured":"Le Quy, T., Roy, A., Iosifidis, V., Zhang, W., Ntoutsi, E.: A survey on datasets for fairness-aware machine learning. Wiley Interdisc. Rev. Data Mining Knowl. Discov. 12(3), e1452 (2022)","journal-title":"Wiley Interdisc. Rev. Data Mining Knowl. Discov."},{"key":"16_CR8","first-page":"3558","volume":"34","author":"A Liu","year":"2021","unstructured":"Liu, A., Van den Broeck, G.: Tractable regularization of probabilistic circuits. Adv. Neural. Inf. Process. Syst. 34, 3558\u20133570 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Lowd, D., Davis, J.: Learning Markov network structure with decision trees. In: 2010 IEEE International Conference on Data Mining, pp. 334\u2013343. IEEE (2010)","DOI":"10.1109\/ICDM.2010.128"},{"key":"16_CR10","unstructured":"Peharz, R.: Foundations of sum-product networks for probabilistic modeling. Ph.D. thesis, Graz University of Technology (2015)"},{"issue":"10","key":"16_CR11","doi-asserted-by":"publisher","first-page":"2030","DOI":"10.1109\/TPAMI.2016.2618381","volume":"39","author":"R Peharz","year":"2016","unstructured":"Peharz, R., Gens, R., Pernkopf, F., Domingos, P.: On the latent variable interpretation in sum-product networks. IEEE Trans. Pattern Anal. Mach. Intell. 39(10), 2030\u20132044 (2016)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"16_CR12","unstructured":"Peharz, R., et al.: Einsum networks: fast and scalable learning of tractable probabilistic circuits. In: International Conference on Machine Learning, pp. 7563\u20137574. PMLR (2020)"},{"key":"16_CR13","unstructured":"Peharz, R., Tschiatschek, S., Pernkopf, F., Domingos, P.: On theoretical properties of sum-product networks. In: Artificial Intelligence and Statistics, pp. 744\u2013752 (2015)"},{"key":"16_CR14","unstructured":"Peharz, R., et al.: Random sum-product networks: a simple and effective approach to probabilistic deep learning. In: Uncertainty in Artificial Intelligence, pp. 334\u2013344. PMLR (2020)"},{"key":"16_CR15","unstructured":"Rahman, T., Jin, S., Gogate, V.: Look ma, no latent variables: accurate cutset networks via compilation. In: International Conference on Machine Learning, pp. 5311\u20135320. PMLR (2019)"},{"key":"16_CR16","unstructured":"Trapp, M., Peharz, R., Ge, H., Pernkopf, F., Ghahramani, Z.: Bayesian learning of sum-product networks. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"16_CR17","first-page":"13189","volume":"34","author":"A Vergari","year":"2021","unstructured":"Vergari, A., Choi, Y., Liu, A., Teso, S., Van den Broeck, G.: A compositional atlas of tractable circuit operations for probabilistic inference. Adv. Neural. Inf. Process. Syst. 34, 13189\u201313201 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Vergari, A., Molina, A., Peharz, R., Ghahramani, Z., Kersting, K., Valera, I.: Automatic Bayesian density analysis. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 1, pp. 5207\u20135215 (2019)","DOI":"10.1609\/aaai.v33i01.33015207"},{"key":"16_CR19","unstructured":"Zhao, H., Poupart, P., Gordon, G.J.: A unified approach for learning the parameters of sum-product networks. In: Advances in Neural Information Processing Systems, vol. 29 (2016)"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XXIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91398-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T22:05:16Z","timestamp":1746137116000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91398-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031913976","9783031913983"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91398-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"2 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligent Data Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Konstanz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ida2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ida2025.blogs.dsv.su.se\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}