The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Sum-product networks: A new deep architecture
Abstract
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most 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) and will present in this abstract. The key idea of SPNs is to compactly represent the partition function by introducing multiple layers of hidden variables. An SPN is a rooted directed acyclic graph with variables as leaves, sums and products as internal nodes, and weighted edges.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Turk, M., & Pentland, A. (1991) · Journal of Cognitive Neuroscience · doi:10.1162/jocn.1991.3.1.71 · Cited by 13,733
Backpropagation Applied to Handwritten Zip Code Recognition
LeCun, Y., Boser, B., Denker, J. S., Henderson, D., Howard, R. E., Hubbard, W., & Jackel, L. D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.4.541 · Cited by 11,891
Learning Deep Architectures for AI
Bengio, Y. (2009) · now publishers, Inc. eBooks · doi:10.1561/9781601982957 · Cited by 4,941
Bertalmio, M., Sapiro, G., Caselles, V., & Ballester, C. (2000) · Proceedings of the 27th annual conference on Computer graphics and interactive techniques - SIGGRAPH '00 · doi:10.1145/344779.344972 · Cited by 3,580
Hierarchical models of object recognition in cortex
Riesenhuber, M., & Poggio, T. (1999) · Nature Neuroscience · doi:10.1038/14819 · Cited by 3,309
Learning internal representations by error propagation
RUMELHART, D. E., HINTON, G. E., & WILLIAMS, R. J. (1988) · Readings in Cognitive Science · doi:10.1016/b978-1-4832-1446-7.50035-2 · Cited by 3,002
Salakhutdinov, R., & Hinton, G. E. (2009) · International Conference on Artificial Intelligence and Statistics · Cited by 2,605
Parameterisation of a stochastic model for human face identification
Samaria, F. S., & Harter, A. C. (2002) · Proceedings of 1994 IEEE Workshop on Applications of Computer Vision · doi:10.1109/acv.1994.341300 · Cited by 2,593
Lee, H., Grosse, R., Ranganath, R., & Ng, A. Y. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553453 · Cited by 2,412
Fei-Fei, L., Fergus, R., & Perona, P. (2007) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2005.09.012 · Cited by 2,359
A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants
Neal, R. M., & Hinton, G. E. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_12 · Cited by 2,187
Head-Driven Statistical Models for Natural Language Parsing
Collins, M. (2003) · Computational Linguistics · doi:10.1162/089120103322753356 · Cited by 1,826
On Bias, Variance, 0/1—Loss, and the Curse-of-Dimensionality
Friedman, J. H. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009778005914 · Cited by 1,040
A general framework for parallel distributed processing
Rumelhart, D. E., Hinton, G. E., & McClelland, J. L. (1986) · The MIT Press eBooks · Cited by 711
Scene completion using millions of photographs
Hays, J., & Efros, A. A. (2007) · ACM SIGGRAPH 2007 papers · doi:10.1145/1275808.1276382 · Cited by 687
An Efficient Learning Procedure for Deep Boltzmann Machines
Salakhutdinov, R., & Hinton, G. (2012) · Neural Computation · doi:10.1162/neco_a_00311 · Cited by 484
A differential approach to inference in Bayesian networks
Darwiche, A. (2003) · Journal of the ACM · doi:10.1145/765568.765570 · Cited by 470
Naive Bayes models for probability estimation
Lowd, D., & Domingos, P. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102418 · Cited by 304
Self-citationAND/OR search spaces for graphical models
Dechter, R., & Mateescu, R. (2007) · Artificial Intelligence · doi:10.1016/j.artint.2006.11.003 · Cited by 241
Hierarchical Latent Class Models for Cluster Analysis
Zhang, N. L. (2004) · Journal of Machine Learning Research · doi:10.5555/1005332.1016782 · Cited by 235
Mixtures of hierarchical topics with Pachinko allocation
Mimno, D., Li, W., & McCallum, A. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273576 · Cited by 215
A new view of the EM algorithm that justifies incremental and other variants
Neal, R. M. (1993) · Cited by 160
Feature discovery by competitive learning
Rumelhart, D. E., & Zipser, D. (1986) · Defense Technical Information Center (DTIC) · Cited by 110
Learning Arithmetic CircuitsPreprint
Lowd, D., & Domingos, P. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.3271 · Cited by 84
Self-citationUnsupervised Learning of Probabilistic Grammar-Markov Models for Object Categories
Zhu, L., Chen, Y., & Yuille, A. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.67 · Cited by 62
Learning the Structure of Deep Sparse Graphical ModelsPreprint
Adams, R. P., Wallach, H., & Ghahramani, Z. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.1001.0160 · Cited by 54
Felzenszwalb, P. F. (2011) · IEEE International Conference on Computer Vision Workshops · doi:10.1109/iccvw.2011.6130311 · Cited by 50
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Deep Learning: Methods and Applications
Deng, L., & Yu, D. (2014) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000039 · Cited by 3,480
A tutorial survey of architectures, algorithms, and applications for deep learning
Deng, L. (2014) · APSIPA Transactions on Signal and Information Processing · doi:10.1017/atsip.2013.9 · Cited by 725
Joint Deep Learning for Pedestrian Detection
Ouyang, W., & Wang, X. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.257 · Cited by 660
Past, Present, and Future of Face Recognition: A Review
Adjabi, I., Ouahabi, A., Benzaoui, A., & Taleb-Ahmed, A. (2020) · Electronics · doi:10.3390/electronics9081188 · Cited by 560
Metadata
- Authors
- Poon, H., & Domingos, P.
- Venue
- 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)
- Publisher
- IEEE
- Published
- 2011-11
- Pages
- 689-690
- ISSN
- 2473-9936 (ISSN-L)
- OpenAlex
- W2040370888
- Cited by
- 315
- References
- 30
- FWCI
- 6.78
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.