Simplifying, Regularizing and Strengthening Sum-Product Network Structure Learning

• Published in: Machine Learning and Knowledge Discovery in Databases Vol. 9285; pp. 343 - 358
• Main Authors: Vergari, Antonio, Di Mauro, Nicola, Esposito, Floriana
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2015; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Arithmetic Circuit; Artificial intelligence; Data mining; Leaf Node; Markov Network; Neural Information Processing System; Pattern recognition; Tree Distribution
• ISBN: 9783319235240; 3319235249
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-23525-7_21

The need for feasible inference in Probabilistic Graphical Models (PGMs) has lead to tractable models like Sum-Product Networks (SPNs). Their highly expressive power and their ability to provide exact and tractable inference make them very attractive for several real world applications, from computer vision to NLP. Recently, great attention around SPNs has focused on structure learning, leading to different algorithms being able to learn both the network and its parameters from data. Here, we enhance one of the best structure learner, LearnSPN, aiming to improve both the structural quality of the learned networks and their achieved likelihoods. Our algorithmic variations are able to learn simpler, deeper and more robust networks. These results have been obtained by exploiting some insights in the building process done by LearnSPN, by hybridizing the network adopting tree-structured models as leaves, and by blending bagging estimations into mixture creation. We prove our claims by empirically evaluating the learned SPNs on several benchmark datasets against other competitive SPN and PGM structure learners.