Fetching the paper…
Reading the bibliography…
Sum Product Networks (SPNs) are a recently developed class of deep generative models which compute their associated unnormalized density functions using a special type of arithmetic circuit.
Neuer beweis eines satzes über permutationen
H. Prüfer · 1918
Earlier work this paper cites.
Triangular factorization and inversion by fast matrix multiplication
J. Bunch and J. Hopcroft · 1974
Earlier work this paper cites.
Matrix multiplication via arithmetic progressions
D. Coppersmith and S. Winograd · 1987
Earlier work this paper cites.
Lower bounds on the number of triangles in a graph
David C Fisher · 1989
Earlier work this paper cites.
The random walk construction of uniform spanning trees and uniform labelled trees
David J Aldous · 1990
Earlier work this paper cites.
Optimal carry save networks
M. S. Paterson, N. Pippenger, and U. Zwick · 1990
Earlier work this paper cites.
Connectionist learning of belief networks
Radford M. Neal · 1992
Earlier work this paper cites.
On threshold circuits and polynomial computation
J. Reif and S. Tate · 1992
Earlier work this paper cites.
Threshold circuits of bounded depth
A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, and G. Turán · 1993
Earlier work this paper cites.
Circuit Complexity and Neural Networks
Ian Parberry · 1994
Earlier work this paper cites.
On the hardness of approximate reasoning
Dan Roth · 1996
Earlier work this paper cites.
W.T. Tutte · 2001
Cited alongside, same era.
A linear lower bound on the unbounded error probabilistic communication complexity
J. Forster · 2002
Cited alongside, same era.
Unsupervised discovery of non-linear structure using contrastive backpropagation, 2004
G. E. Hinton, S. Osindero, M. Welling, and Y. W. Teh · 2004
Cited alongside, same era.
Multi-linear formulas for permanent and determinant are of super-polynomial size
Ran Raz · 2004
Cited alongside, same era.
Lower bounds for syntactically multilinear algebraic branching programs
Maurice J. Jansen · 2008
Cited alongside, same era.
Balancing syntactically multilinear arithmetic circuits
Ran Raz and Amir Yehudayoff · 2008
Shallow vs. deep sum-product networks
Olivier Delalleau and Yoshua Bengio · 2011
Later among the works it cites.
Sum-product networks: A new deep architecture
Hoifung Poon and Pedro Domingos · 2011
Later among the works it cites.
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
Ran Raz and Amir Yehudayoff · 2011
Later among the works it cites.
Learning the structure of sum-product networks
Robert Gens and Pedro Domingos · 2013
Later among the works it cites.
On the representational efficiency of restricted boltzmann machines
James Martens, Arkadev Chattopadhyay, Toniann Pitassi, and Richard Zemel · 2013
Later among the works it cites.
Greedy part-wise learning of sum-product networks
Robert Peharz, Bernhard Geiger, and Franz Pernkopf · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A lower bound for the size of syntactically multilinear arithmetic circuits
Ran Raz, Amir Shpilka, and Amir Yehudayoff · 2008
Cited alongside, same era.
Lower bounds and separations for constant depth multilinear circuits
Ran Raz and Amir Yehudayoff · 2009
Cited alongside, same era.
Deep boltzmann machines
Ruslan Salakhutdinov and Geoffrey E. Hinton · 2009
Cited alongside, same era.
Arithmetic circuits: A survey of recent results and open questions
Amir Shpilka and Amir Yehudayoff · 2010
Cited alongside, same era.
On the expressive power of deep architectures
Yoshua Bengio and Olivier Delalleau · 2011
Cited alongside, same era.
From average case complexity to improper learning complexity
Amit Daniely, Nati Linial, and Shai Shalev-Shwartz · 2014
Closest in time.
Beyond universality: On the expressive efficiency of deep models
James Martens · 2014
Closest in time.
Personal Communication, 2014
Ran Raz · 2014
Closest in time.
Learning sum-product networks with direct and indirect variable interactions
Amirmohammad Rooshenas and Daniel Lowd · 2014
Closest in time.