Greedy part-wise learning of sum-product networks

Robert Peharz, Bernhard Geiger, Franz Pernkopf

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

35 Citations (Scopus)

Abstract

Sum-product networks allow to model complex variable interactions while still granting efficient inference. However, most learning algorithms proposed so far are explicitly or implicitly restricted to the image domain, either by assuming variable neighborhood or by assuming that dependent variables are related by their magnitudes over the training set. In this paper, we introduce a novel algorithm, learning the structure and parameters of sum-product networks in a greedy bottom-up manner. Our algorithm iteratively merges probabilistic models of small variable scope to larger and more complex models. These merges are guided by statistical dependence test, and parameters are learned using a maximum mutual information principle. In experiments our method competes well with the existing learning algorithms for sum-product networks on the task of reconstructing covered image regions, and outperforms these when neither neighborhood nor correlations by magnitude can be assumed.

Original languageEnglish
Title of host publicationMachine Learning and Knowledge Discovery in Databases European Conference, ECML PKDD 2013, Prague, Czech Republic, September 23-27, 2013
Subtitle of host publicationProceedings Part 1
EditorsHendrik Blockeel, Kristian Kersting, Siegfried Nijssen, Filip Železný
PublisherSpringer
Pages612-627
ISBN (Electronic)978-3-642-40991-2
DOIs
Publication statusPublished - 2013
Externally publishedYes
EventJoint European Conference on Machine Learning and Knowledge Discovery in Databases, (ECML PKDD2013) - Prague, Czech Republic
Duration: 23 Sep 201327 Sep 2013

Publication series

NameLecture Notes in Computer Science book series
PublisherSpringer Link
Volume8188
ISSN (Electronic)1973-2020
NameLecture Notes in Artificial Intelligence book sub series
Volume8188

Conference

ConferenceJoint European Conference on Machine Learning and Knowledge Discovery in Databases, (ECML PKDD2013)
Abbreviated titleECML PKDD2013
CountryCzech Republic
CityPrague
Period23/09/1327/09/13

Fingerprint Dive into the research topics of 'Greedy part-wise learning of sum-product networks'. Together they form a unique fingerprint.

  • Cite this

    Peharz, R., Geiger, B., & Pernkopf, F. (2013). Greedy part-wise learning of sum-product networks. In H. Blockeel, K. Kersting, S. Nijssen, & F. Železný (Eds.), Machine Learning and Knowledge Discovery in Databases European Conference, ECML PKDD 2013, Prague, Czech Republic, September 23-27, 2013: Proceedings Part 1 (pp. 612-627). (Lecture Notes in Computer Science book series ; Vol. 8188), (Lecture Notes in Artificial Intelligence book sub series; Vol. 8188). Springer. https://doi.org/10.1007/978-3-642-40991-2_39