Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Sum-Product Networks: A New Deep Architecture Hoifung Poon and Pedro Domingos
 

Summary: Sum-Product Networks: A New Deep Architecture
Hoifung Poon and Pedro Domingos
Computer Science & Engineering
University of Washington
Seattle, WA 98195, USA
{hoifung,pedrod}@cs.washington.edu
Abstract
The key limiting factor in graphical model infer-
ence and learning is the complexity of the par-
tition function. We thus ask the question: what
are general conditions under which the partition
function is tractable? The answer leads to a new
kind of deep architecture, which we call sum-
product networks (SPNs). SPNs are directed
acyclic graphs with variables as leaves, sums
and products as internal nodes, and weighted
edges. We show that if an SPN is complete
and consistent it represents the partition func-
tion and all marginals of some graphical model,
and give semantics to its nodes. Essentially all

  

Source: Anderson, Richard - Department of Computer Science and Engineering, University of Washington at Seattle

 

Collections: Computer Technologies and Information Sciences