The DOI matches its Crossref record; 117 of the 117 references it cites were found in a registry or an index.
Training restricted Boltzmann machines: An introduction
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
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
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 · cited 1×
“Gibbs sampling [18] is such a MCMC method and will be described in the following section.”
MethodA 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×
“Gibbs sampling belongs to the broader class of Metropolis-Hastings algorithms [19], see [42] for a good overview.”
BackgroundPattern Recognition and Machine Learning
(2006) · doi:10.1007/978-0-387-45528-0 · Cited by 9,824
Learning Deep Architectures for AI
Bengio, Y. (2009) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000006 · Cited by 9,239
Proceedings of the 25th international conference on Machine learning - ICML '08
(2008) · doi:10.1145/1390156 · Cited by 6,680
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 5×
“However, it has been shown that estimates obtained after running the chain for just a few steps can be sufficient for model training [21].”
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 [21, 4, 24, 3, 23].”
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
A Practical Guide to Training Restricted Boltzmann Machines
Hinton, G. E. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_32 · Cited by 2,852 · cited 1×
“It is meant to supplement existing tutorials [2, 50, 20], and it is biased in the sense that it focuses on material that we have found helpful in our work.”
BackgroundNonuniversal critical dynamics in Monte Carlo simulations
Swendsen, R. H., & Wang, J.-S. (1987) · Physical Review Letters · doi:10.1103/physrevlett.58.86 · Cited by 2,844
Efficient estimation of free energy differences from Monte Carlo data
Bennett, C. H. (1976) · Journal of Computational Physics · doi:10.1016/0021-9991(76)90078-4 · Cited by 2,755
Natural Gradient Works Efficiently in Learning
Amari, S.-I. (1998) · Neural Computation · doi:10.1162/089976698300017746 · Cited by 2,681
Salakhutdinov, R., & Hinton, G. E. (2009) · International Conference on Artificial Intelligence and Statistics · Cited by 2,605
International Conference on Machine Learning (ICML)-2005
津田, 宏. (2006) · 人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence · Cited by 2,558
Collective Monte Carlo Updating for Spin Systems
Wolff, U. (1989) · Physical Review Letters · doi:10.1103/physrevlett.62.361 · Cited by 2,551
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
Information processing in dynamical systems: foundations of harmony theory
Smolensky, P. (1986) · The MIT Press eBooks · Cited by 2,233
Replica Monte Carlo Simulation of Spin-Glasses
Swendsen, R. H., & Wang, J.-S. (1986) · Physical Review Letters · doi:10.1103/physrevlett.57.2607 · Cited by 2,031
Restricted Boltzmann machines for collaborative filtering
Salakhutdinov, R., Mnih, A., & Hinton, G. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273596 · Cited by 1,885
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
LeCun, Y., Bottou, L., Orr, G., & Müller, K. (1998) · neural information processing systems · Cited by 1,333
Neal, R. M. (2001) · Statistics and Computing · doi:10.1023/a:1008923215028 · Cited by 1,172
Unsupervised Learning of Invariant Feature Hierarchies with Applications to Object Recognition
Ranzato, M., Huang, F. J., Boureau, Y.-L., & LeCun, Y. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383157 · Cited by 1,086
(1991) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 1,077
Probabilistic Inference Using Markov Chain Monte Carlo Methods
Neal, R. M. (2011) · Cited by 1,047
Learning and relearning in Boltzmann machines
Hinton, G. E., & Sejnowski, T. J. (2001) · Graphical Models · doi:10.7551/mitpress/3349.003.0005 · Cited by 1,037
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
An empirical evaluation of deep architectures on problems with many factors of variation
Larochelle, H., Erhan, D., Courville, A., Bergstra, J., & Bengio, Y. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273556 · Cited by 992
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues
Odentrantz, J. (2000) · Technometrics · doi:10.1080/00401706.2000.10485734 · Cited by 973
(2009) · neural information processing systems · Cited by 962
Simulating normalizing constants: from importance sampling to bridge sampling to path sampling
Gelman, A., & Meng, X.-L. (1998) · Statistical Science · doi:10.1214/ss/1028905934 · Cited by 951
Path-ensemble averages in systems driven far from equilibrium
Crooks, G. E. (2000) · Physical Review E · doi:10.1103/physreve.61.2361 · Cited by 951
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
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
Classification using discriminative restricted Boltzmann machines
Larochelle, H., & Bengio, Y. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390224 · Cited by 655
On Contrastive Divergence Learning.
Carreira-Perpiñán, M. Á., & Hinton, G. E. (2005) · Cited by 630
Convolutional Learning of Spatio-temporal Features
Taylor, G. W., Fergus, R., LeCun, Y., & Bregler, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15567-3_11 · Cited by 629
Riedmiller, M. (1994) · Computer Standards & Interfaces · doi:10.1016/0920-5489(94)90017-5 · Cited by 600
An Introduction to Restricted Boltzmann Machines
Fischer, A., & Igel, C. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33275-3_2 · Cited by 569
Self-citationReplicated Softmax: an Undirected Topic Model
Hinton, G. E., & Salakhutdinov, R. (2009) · neural information processing systems · Cited by 538
Optimum Monte-Carlo sampling using Markov chains
PESKUN, P. H. (1973) · Biometrika · doi:10.1093/biomet/60.3.607 · Cited by 531
Metropolized independent sampling with comparisons to rejection sampling and importance sampling
Liu, J. S. (1996) · Statistics and Computing · doi:10.1007/bf00162521 · Cited by 507
Equilibrium Free Energies from Nonequilibrium Measurements Using Maximum-Likelihood Methods
Shirts, M. R., Bair, E., Hooker, G., & Pande, V. S. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.140601 · Cited by 493
Logarithmic Sobolev inequalities for finite Markov chains
Diaconis, P., & Saloff-Coste, L. (1996) · The Annals of Applied Probability · doi:10.1214/aoap/1034968224 · Cited by 479
Learning a Nonlinear Embedding by Preserving Class Neighbourhood Structure
Salakhutdinov, R., & Hinton, G. E. (2007) · International Conference on Artificial Intelligence and Statistics · Cited by 440
Empirical evaluation of the improved Rprop learning algorithms
Igel, C., & Hüsken, M. (2003) · Neurocomputing · doi:10.1016/s0925-2312(01)00700-7 · Cited by 433
Self-citationComparison Theorems for Reversible Markov Chains
Diaconis, P., & Saloff-Coste, L. (1993) · The Annals of Applied Probability · doi:10.1214/aoap/1177005359 · Cited by 423
Exponential Family Harmoniums with an Application to Information Retrieval
Welling, M., Rosen‐Zvi, M., & Hinton, G. E. (2004) · Cited by 423
On the quantitative analysis of deep belief networks
Salakhutdinov, R., & Murray, I. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390266 · Cited by 411
Factored conditional restricted Boltzmann Machines for modeling motion style
Taylor, G. W., & Hinton, G. E. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553505 · Cited by 358
Probabilistic Graphical Models
Koller, D., & Friedman, N. (2009) · Cited by 306
Learning algorithms for the classification restricted Boltzmann machine
Larochelle, H., MandelMichael, PascanuRazvan, & BengioYoshua (2012) · Journal of Machine Learning Research · doi:10.5555/2188385.2188407 · Cited by 300
Cluster Monte Carlo algorithms
Wang, J.-S., & Swendsen, R. H. (1990) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/0378-4371(90)90275-w · Cited by 277
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 · cited 3×
“The PCD algorithm was further refined in a variant called fast persistent contrastive divergence (FPCD) [56].”
BackgroundMethodNIPS 2011 Workshop on Deep Learning and Unsupervised Feature Learning
Cho, K., Raiko, T., & Ilin, A. (2011) · Cited by 245
Better Mixing via Deep Representations
Bengio, Y., Mesnil, G., Dauphin, Y., & Rifai, S. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.4404 · Cited by 237
Li, J. Q., & Barron, A. R. (1999) · Cited by 230
Deep Learning Made Easier by Linear Transformations in Perceptrons
Raiko, T., Harri Valpola, B., & LeCun, Y. (2012) · International Conference on Artificial Intelligence and Statistics · Cited by 229
Adler, S. L. (1981) · Physical Review D · doi:10.1103/physrevd.23.2901 · Cited by 223
Proceedings of the 24th Annual International Conference on Machine Learning (ICML 2007)
Jaeger, M. (2007) · Cited by 218
Advances in Neural Information Processing Systems 21 (NIPS 2008)
Schweikert, G., Rätsch, G., Widmer, C., & Schölkopf, B. (2008) · Cited by 212
Justifying and Generalizing Contrastive Divergence
Bengio, Y., & Delalleau, O. (2009) · Neural Computation · doi:10.1162/neco.2008.11-07-647 · Cited by 206
Information-Geometric Optimization Algorithms: A Unifying Picture via Invariance Principles
Ollivier, Y., Arnold, L., Auger, A., & Nikolaus Hansen, C. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1106.3708 · Cited by 199
Information geometry of Boltzmann machines
Amari, S., Kurata, K., & Nagaoka, H. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.125867 · Cited by 193
Deep Belief Networks Are Compact Universal Approximators
Le Roux, N., & Bengio, Y. (2010) · Neural Computation · doi:10.1162/neco.2010.08-09-1081 · Cited by 166
Robust Boltzmann Machines for recognition and denoising
Tang, Y., Salakhutdinov, R., & Hinton, G. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247936 · Cited by 165
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
Gaussian-Bernoulli deep Boltzmann machine
Cho, K. H., Raiko, T., & Ilin, A. (2013) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2013.6706831 · Cited by 149
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
What Do We Know about the Metropolis Algorithm ?
Diaconis, P. W., & Saloff‐Coste, L. (1998) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1576 · Cited by 142
Markov chain decomposition for convergence rate analysis
Madras, N., & Randall, D. (2002) · The Annals of Applied Probability · doi:10.1214/aoap/1026915617 · Cited by 111
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
Phone recognition using Restricted Boltzmann Machines
Mohamed, A., & Hinton, G. E. (2010) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2010.5495651 · Cited by 105
Deep Boltzmann Machines and the Centering Trick
Montavon, G., & Müller, K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35289-8_33 · Cited by 102
The rate adapting poisson model for information retrieval and object recognition
Gehler, P., Holub, A. D., & Welling, M. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143887 · Cited by 101
Hinton, G. E. (2007) · Scholarpedia · doi:10.4249/scholarpedia.1668 · Cited by 101
Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions
Woodard, D. B., Schmidler, S. C., & Huber, M. (2009) · The Annals of Applied Probability · doi:10.1214/08-aap555 · Cited by 100
Enhanced Gradient and Adaptive Learning Rate for Training Restricted Boltzmann Machines
Cho, K., Raiko, T., & Ihler, A. (2011) · International Conference on Machine Learning · Cited by 91
Montúfar, G., & Ay, N. (2011) · Neural Computation · doi:10.1162/neco_a_00113 · Cited by 86
On the Convergence Properties of Contrastive Divergence
Sutskever, I., & Tieleman, T. (2010) · Cited by 85
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
Quickly Generating Representative Samples from an RBM-Derived Process
Breuleux, O., Bengio, Y., & Vincent, P. (2011) · Neural Computation · doi:10.1162/neco_a_00158 · 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
Learning and Evaluating Boltzmann Machines
Salakhutdinov, R. (2008) · Cited by 73
Enhanced Gradient for Training Restricted Boltzmann Machines
Cho, K., Raiko, T., & Ilin, A. (2012) · Neural Computation · doi:10.1162/neco_a_00397 · Cited by 73
Estimating Ratios of Normalizing Constants Using Linked Importance SamplingPreprint
Neal, R. M. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0511216 · Cited by 67
Swersky, K., Chen, B., Marlin, B. M., & de Freitas, N. (2010) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2010.5454138 · Cited by 67
Unsupervised Models of Images by Spike-and-Slab RBMs
Bengio, Y., Courville, A. C., & Bergstra, J. (2011) · International Conference on Machine Learning · Cited by 67
Generative versus discriminative training of RBMs for classification of fMRI images
Schmah, T., Hinton, G. E., Small, S. L., Strother, S. C., & Zemel, R. S. (2008) · Cited by 63
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
A Comparison of Methods for Computing Autocorrelation TimePreprint
Thompson, M. B. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1011.0175 · Cited by 52
Investigating Convergence of Restricted Boltzmann Machine Learning
Schulz, H., Müller, A., & Behnke, S. (2010) · neural information processing systems · Cited by 51
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
Metric-Free Natural Gradient for Joint-Training of Boltzmann MachinesPreprint
Desjardins, G., Pascanu, R., Courville, A. C., & Bengio, Y. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3545 · Cited by 35
Training Restricted Boltzmann Machines
Fischer, A. (2015) · Künstliche Intell. · doi:10.1007/s13218-015-0371-2 · Cited by 34
Self-citationOn Tracking The Partition Function
Desjardins, G., Bengio, Y., & Courville, A. C. (2011) · neural information processing systems · Cited by 29
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
Learning Feature Hierarchies with Centered Deep Boltzmann MachinesPreprint
Montavon, G., & Müller, K. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1203.3783 · Cited by 26
The flip-the-state transition operator for restricted Boltzmann machines
Brügge, K., Fischer, A., & Igel, C. (2013) · Machine Learning · doi:10.1007/s10994-013-5390-3 · Cited by 24
Self-citationRobust Generation of Dynamical Patterns in Human Motion by a Deep Belief Nets
Sukhbaatar, S., Makino, T., Aihara, K., & Chikayama, T. (2011) · Asian Conference on Machine Learning · Cited by 14
Approximation properties of DBNs with binary hidden units and real-valued visible units
Krause, O., Fischer, A., Glasmachers, T., & Igel, C. (2013) · Research at the University of Copenhagen (University of Copenhagen) · Cited by 13
Self-citationTraining RBMs Based on the Signs of the CD Approximation of the Log-likelihood Derivatives
Fischer, A., & Igel, C. (2011) · Cited by 6
Self-citation
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
Nweke, H. F., Teh, Y. W., Al-garadi, M. A., & Alo, U. R. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.03.056 · Cited by 930
A survey of deep learning-based network anomaly detection
Kwon, D., Kim, H., Kim, J., Suh, S. C., Kim, I., & Kim, K. J. (2019) · Cluster Computing · doi:10.1007/s10586-017-1117-8 · Cited by 778
Recommendation system based on deep learning methods: a systematic review and new directions
Da’u, A., & Salim, N. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09744-1 · Cited by 402
Nweke, H. F., Teh, Y. W., Mujtaba, G., & Al-garadi, M. A. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.06.002 · Cited by 394
Metadata
- Authors
- Fischer, A., & Igel, C.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2014-01
- Volume
- 47
- Issue
- 1
- Pages
- 25-39
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W2018168021
- Cited by
- 504
- References
- 117
- FWCI
- 27.61
- Type
- journal article
- 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.