The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Learning from noisy examples
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Learning regular sets from queries and counterexamples
Angluin, D. (1987) · Information and Computation · doi:10.1016/0890-5401(87)90052-6 · Cited by 2,114
Self-citationIncremental learning from noisy data
Schlimmer, J. C., & Granger, R. H. (1986) · Machine Learning · doi:10.1007/bf00116895 · Cited by 653
On the learnability of Boolean formulae
Kearns, M., Li, M., Pitt, L., & Valiant, L. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28426 · Cited by 284
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12158 · Cited by 159
Learning in the presence of malicious errors
Kearns, M. J., & Li, M. (1988) · doi:10.1145/62212.62238 · Cited by 127
Learning from good data and bad
Laird, P. D. (1987) · Yale University eBooks · Cited by 19
Self-citationValiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
A brief introduction to weakly supervised learning
Zhou, Z.-H. (2018) · National Science Review · doi:10.1093/nsr/nwx106 · Cited by 1,899
Angluin, D. (1988) · Machine Learning · doi:10.1007/bf00116828 · Cited by 1,905
Self-citationLearnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989) · Journal of the ACM · doi:10.1145/76359.76371 · Cited by 1,839
Classification in the Presence of Label Noise: A Survey
Frenay, B., & Verleysen, M. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2292894 · Cited by 1,777
Tri-training: exploiting unlabeled data using three classifiers
Zhou, Z.-H., & Li, M. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.186 · Cited by 1,171
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Haussler, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90010-d · Cited by 843
Confident Learning: Estimating Uncertainty in Dataset Labels
Northcutt, C., Jiang, L., & Chuang, I. (2021) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.12125 · Cited by 795
Classification with Noisy Labels by Importance Reweighting
Liu, T., & Tao, D. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2456899 · Cited by 782
Learning to Reweight Examples for Robust Deep Learning
Ren, M., Zeng, W., Yang, B., & Urtasun, R. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.09050 · Cited by 740
Cryptographic limitations on learning Boolean formulae and finite automata
Kearns, M., & Valiant, L. (1994) · Journal of the ACM · doi:10.1145/174644.174647 · Cited by 733
Efficient noise-tolerant learning from statistical queries
Kearns, M. (1998) · Journal of the ACM · doi:10.1145/293347.293351 · Cited by 665
Incremental learning from noisy data
Schlimmer, J. C., & Granger, R. H. (1986) · Machine Learning · doi:10.1007/bf00116895 · Cited by 653
Noise-tolerant learning, the parity problem, and the statistical query model
Blum, A., Kalai, A., & Wasserman, H. (2003) · Journal of the ACM · doi:10.1145/792538.792543 · Cited by 598
Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
Haussler, D. (1988) · Artificial Intelligence · doi:10.1016/0004-3702(88)90002-1 · Cited by 479
Probabilistic End-To-End Noise Correction for Learning With Noisy Labels
Yi, K., & Wu, J. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00718 · Cited by 454
A study of the effect of different types of noise on the precision of supervised learning techniques
Nettleton, D. F., Orriols-Puig, A., & Fornells, A. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-010-9156-z · Cited by 446
Semi-supervised learning by disagreement
Zhou, Z.-H., & Li, M. (2010) · Knowledge and Information Systems · doi:10.1007/s10115-009-0209-z · Cited by 410
Improve Computer-Aided Diagnosis With Machine Learning Techniques Using Undiagnosed Samples
Li, M., & Zhou, Z.-H. (2007) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2007.904745 · Cited by 377
Efficient distribution-free learning of probabilistic concepts
Kearns, M. J., & Schapire, R. E. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80062-5 · Cited by 373
Learning in the Presence of Malicious Errors
Kearns, M., & Li, M. (1993) · SIAM Journal on Computing · doi:10.1137/0222052 · Cited by 340
Image classification with deep learning in the presence of noisy labels: A survey
Algan, G., & Ulusoy, I. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2021.106771 · Cited by 337
Robust data encodings for quantum classifiers
LaRose, R., & Coyle, B. (2020) · Physical Review A · doi:10.1103/physreva.102.032420 · Cited by 326
Collaborative recommendation: A robustness analysis
O'Mahony, M., Hurley, N., Kushmerick, N., & Silvestre, G. (2004) · ACM Transactions on Internet Technology · doi:10.1145/1031114.1031116 · Cited by 325
Computational learning theory: survey and selected bibliography
Angluin, D. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129746 · Cited by 316
Self-citationPervasive label errors in test sets destabilize machine learning benchmarks
Northcutt, C. G., Athalye, A., & Mueller, J. (2021) · arXiv · doi:10.48550/arxiv.2103.14749 · Cited by 293
Language acquisition in the absence of explicit negative evidence: how important is starting small?
Rohde, D. L. T., & Plaut, D. C. (1999) · Cognition · doi:10.1016/s0010-0277(99)00031-1 · Cited by 274
Learning Long-Distance Phonotactics
Heinz, J. (2010) · Linguistic Inquiry · doi:10.1162/ling_a_00015 · Cited by 257
Agnostic Learning of Monomials by Halfspaces Is Hard
Feldman, V., Guruswami, V., Raghavendra, P., & Wu, Y. (2012) · SIAM Journal on Computing · doi:10.1137/120865094 · Cited by 143
On the Existence of Simpler Machine Learning Models
Semenova, L., Rudin, C., & Parr, R. (2022) · 2022 ACM Conference on Fairness Accountability and Transparency · doi:10.1145/3531146.3533232 · Cited by 90
Confidence Scores Make Instance-dependent Label-noise Learning Possible
Berthon, A., Han, B., Niu, G., Liu, T., & Sugiyama, M. (2020) · arXiv · doi:10.48550/arxiv.2001.03772 · Cited by 57
Noise-tolerant fair classification
Lamy, A. L., Zhong, Z., Menon, A. K., & Verma, N. (2019) · arXiv · doi:10.48550/arxiv.1901.10837 · Cited by 36
Recovering from Biased Data: Can Fairness Constraints Improve Accuracy?
Blum, A., & Stangl, K. (2019) · arXiv · doi:10.48550/arxiv.1912.01094 · Cited by 13
Noise-tolerant parity learning with one quantum bit
Park, D. K., Rhee, J.-K. K., & Lee, S. (2018) · Physical Review A · doi:10.1103/physreva.97.032327 · Cited by 12
Metadata
- Authors
- Angluin, D., & Laird, P.
- Venue
- Machine Learning
- Published
- 1988-04
- Volume
- 2
- Issue
- 4
- Pages
- 343-370
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2107189314
- Cited by
- 827
- References
- 10
- FWCI
- 15.74
- Type
- journal article
- Language
- en
- Open access
- bronze
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.