The Sum-Product Theorem: A Foundation for Learning Tractable Models
ICML, pp. 1909-1918, 2012.
Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even when an arbitrary number of hidden layers are present. In this paper, we generalize this result to ...More
PPT (Upload PPT)