The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
An Introduction to Restricted Boltzmann Machines
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
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
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
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
A fast learning algorithm for deep belief nets
Hinton, G. E., Osindero, S., & Teh, Y.-W. (2006) · Neural Computation · doi:10.1162/neco.2006.18.7.1527 · Cited by 16,336
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 1×
“2 Gibbs Sampling Gibbs Sampling belongs to the class of Metropolis-Hastings algorithms [14].”
MethodLearning Deep Architectures for AI
Bengio, Y. (2009) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000006 · Cited by 9,239
Information theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,362
(2009) · Cited by 6,153
Learning Deep Architectures for AI
Bengio, Y. (2009) · now publishers, Inc. eBooks · doi:10.1561/9781601982957 · Cited by 4,941
Training Products of Experts by Minimizing Contrastive Divergence
Hinton, G. E. (2002) · Neural Computation · doi:10.1162/089976602760128018 · Cited by 4,879 · cited 7×
“This equation shows why a (marginalized) RBM can be regarded as a product of experts model [15,39], in which a number of “experts” for individual components of the observations are combined multiplicatively.”
BackgroundInfluentialGreedy layer-wise training of deep networks
Bengio, Y., Lamblin, P., Popovici, D., & Larochelle, H. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0024 · Cited by 4,841 · cited 1×
“This leads to contrastive divergence (CD) learning, which has become a standard way to train RBMs [15,4,18,3,17].”
BackgroundA learning algorithm for Boltzmann machines
Ackley, D. H., Hinton, G. E., & Sejnowski, T. J. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_7 · Cited by 3,402
Lauritzen, S. L. (1996) · doi:10.1093/oso/9780198522195.001.0001 · Cited by 2,976
Salakhutdinov, R., & Hinton, G. E. (2009) · International Conference on Artificial Intelligence and Statistics · Cited by 2,605
Information processing in dynamical systems: foundations of harmony theory
Smolensky, P. (1986) · The MIT Press eBooks · Cited by 2,233
Advances in Neural Information Processing Systems 19 (NIPS 2006)
Simonotto, E., Whalley, H. C., Lawrie, S. M., Murray, L. M., McGonigle, D. J., & Storkey, A. (2006) · Cited by 1,651
Learning multiple layers of representation
Hinton, G. E. (2007) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2007.09.004 · Cited by 1,011
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues
Odentrantz, J. (2000) · Technometrics · doi:10.1080/00401706.2000.10485734 · Cited by 973
Information Theory, Inference, and Learning Algorithms
(2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834752 · Cited by 866
Training restricted Boltzmann machines using approximations to the likelihood gradient
Tieleman, T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390290 · Cited by 837
Representational Power of Restricted Boltzmann Machines and Deep Belief Networks
Le Roux, N., & Bengio, Y. (2008) · Neural Computation · doi:10.1162/neco.2008.04-07-510 · Cited by 821
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues
Brémaud, P. (1999) · Texts in Applied Mathematics · doi:10.1007/978-1-4757-3124-8 · Cited by 781
Modeling Human Motion Using Binary Latent Variables
Taylor, G. W., Hinton, G. E., & Roweis, S. T. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0173 · Cited by 689
On Contrastive Divergence Learning.
Carreira-Perpiñán, M. Á., & Hinton, G. E. (2005) · Cited by 630
Exponential Family Harmoniums with an Application to Information Retrieval
Welling, M., Rosen‐Zvi, M., & Hinton, G. E. (2004) · Cited by 423
Using fast weights to improve persistent contrastive divergence
Tieleman, T., & Hinton, G. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553506 · Cited by 274
Justifying and Generalizing Contrastive Divergence
Bengio, Y., & Delalleau, O. (2009) · Neural Computation · doi:10.1162/neco.2008.11-07-647 · Cited by 206
Tempered Markov Chain Monte Carlo for training of Restricted Boltzmann Machines
Desjardins, G., Courville, A. C., Bengio, Y., Vincent, P., & Delalleau, O. (2010) · International Conference on Artificial Intelligence and Statistics · Cited by 153
Conditional Restricted Boltzmann Machines for Structured Output PredictionPreprint
Mnih, V., Larochelle, H., & Hinton, G. E. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1202.3748 · Cited by 147
Artificial Neural Networks — ICANN 2002
Dorronsoro, J. R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46084-5 · Cited by 117
Learning a Generative Model of Images by Factoring Appearance and Shape
Roux, N. L., Heess, N., Shotton, J., & Winn, J. M. (2010) · Neural Computation · doi:10.1162/neco_a_00086 · Cited by 107
Hinton, G. E. (2007) · Scholarpedia · doi:10.4249/scholarpedia.1668 · Cited by 101
Montúfar, G., & Ay, N. (2011) · Neural Computation · doi:10.1162/neco_a_00113 · Cited by 86
Fischer, A., & Igel, C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15825-4_26 · Cited by 83
Self-citationParallel tempering is efficient for learning restricted Boltzmann machines
Cho, K., Raiko, T., & Ilin, A. (2010) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2010.5596837 · Cited by 82
Learning in Markov Random Fields using Tempered Transitions
Salakhutdinov, R. (2009) · Cited by 81
Parallel Tempering for Training of Restricted Boltzmann Machines
Desjardins, G., Courville, A. C., Bengio, Y., Vincent, P., & Delalleau, O. (2010) · Cited by 80
Efficiency of exchange schemes in replica exchange
Lingenheil, M., Denschlag, R., Mathias, G. B., & Tavan, P. (2009) · Chemical Physics Letters · doi:10.1016/j.cplett.2009.07.039 · Cited by 58
Bounding the Bias of Contrastive Divergence Learning
Fischer, A., & Igel, C. (2010) · Neural Computation · doi:10.1162/neco_a_00085 · Cited by 49
Self-citationMultiple Texture Boltzmann Machines
Kivinen, J., & Williams, C. K. I. (2012) · Edinburgh Research Explorer (University of Edinburgh) · Cited by 44
An analysis of Gaussian-binary restricted Boltzmann machines for natural images.
Wang, N., Melchior, J., & Wiskott, L. (2012) · The European Symposium on Artificial Neural Networks · Cited by 27
Cited by
A review of classification algorithms for EEG-based brain–computer interfaces: A 10 year update
Lotte, F., Bougrain, L., Cichocki, A., Clerc, M., Congedo, M., Rakotomamonjy, A., & Yger, F. (2018) · Journal of Neural Engineering · doi:10.1088/1741-2552/aab2f2 · Cited by 2,239
Digital twin: values, challenges and enablers from a modeling perspective
Rasheed, A., San, O., & Kvamsdal, T. (2020) · IEEE Access · doi:10.1109/access.2020.2970143 · Cited by 1,952
Deep learning for cyber security intrusion detection: Approaches, datasets, and comparative study
Ferrag, M. A., Maglaras, L., Moschoyiannis, S., & Janicke, H. (2020) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2019.102419 · Cited by 1,130
3-D Deep Learning Approach for Remote Sensing Image Classification
Ben Hamida, A., Benoit, A., Lambert, P., & Ben Amar, C. (2018) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2018.2818945 · Cited by 875
He, Y., Mendis, G. J., & Wei, J. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2703842 · Cited by 834
Metadata
- Authors
- Fischer, A., & Igel, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2012
- Pages
- 14-36
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2202505358
- Cited by
- 569
- References
- 42
- FWCI
- 12.31
- 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.