The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Noise Tolerance Under Risk Minimization
Open accessAbstract
In this paper, we explore noise-tolerant learning of classifiers. We formulate the problem as follows. We assume that there is an unobservable training set that is noise free. The actual training set given to the learning algorithm is obtained from this ideal data set by corrupting the class label of each example. The probability that the class label of an example is corrupted is a function of the feature vector of the example. This would account for most kinds of noisy data one encounters in practice. We say that a learning method is noise tolerant if the classifiers learnt with noise-free data and with noisy data, both have the same classification accuracy on the noise-free data. In this paper, we analyze the noise-tolerance properties of risk minimization (under different loss functions). We show that risk minimization under 0-1 loss function has impressive noise-tolerance properties and that under squared error loss is tolerant only to uniform noise; risk minimization under other loss functions is not noise tolerant. We conclude this paper with some discussion on the implications of these theoretical results.
Overview
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
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
(2006) · Springer eBooks · Cited by 8,123
Abe, S. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0285-4 · Cited by 3,721
Convexity, Classification, and Risk Bounds
Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000000907 · Cited by 1,037
Identifying Mislabeled Training Data
Brodley, C. E., & Friedl, M. A. (1999) · Cited by 718
Efficient noise-tolerant learning from statistical queries
Kearns, M. (1998) · Journal of the ACM · doi:10.1145/293347.293351 · Cited by 665
Identifying Mislabeled Training Data
Brodley, C. E., & Friedl, M. A. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.606 · Cited by 612
Thathachar, M. A. L., & Sastry, P. S. (2004) · doi:10.1007/978-1-4419-9052-5 · Cited by 324
Self-citationRobust support vector machine training via convex outlier ablation
Xu, L., Crammer, K., & Schuurmans, D. (2006) · Cited by 147
Posterior Probability Support Vector Machines for Unbalanced Data
Tao, Q., Wu, G.-X., Wang, F., & Wang, J. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.857955 · Cited by 110
Brodley, C. E., & Friedl, M. A. (2002) · IEEE International Geoscience and Remote Sensing Symposium (IGARSS) · doi:10.1109/igarss.1996.516669 · Cited by 75
A Team of Continuous-Action Learning Automata for Noise-Tolerant Learning of Half-Spaces
SASTRY, P. S., Nagendra, G., & Manwani, N. (2009) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2032155 · Cited by 43
Self-citation
Cited by
Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labels
Zhang, Z., & Sabuncu, M. R. (2018) · arXiv · doi:10.48550/arxiv.1805.07836 · Cited by 1,907
“Then, the empirical risk minimization under loss function L is defined to be noise tolerant [25] if f∗ is a global minimum of the noisy risk R L(f).”
BackgroundClassification 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
Learning From Noisy Labels With Deep Neural Networks: A Survey
Song, H., Kim, M., Park, D., Shin, Y., & Lee, J.-G. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3152527 · Cited by 1,308
Machine learning & artificial intelligence in the quantum domain: a review of recent progress
Dunjko, V., & Briegel, H. J. (2018) · Reports on Progress in Physics · doi:10.1088/1361-6633/aab406 · Cited by 1,055
Robust Loss Functions under Label Noise for Deep Neural Networks
Ghosh, A., Kumar, H., & Sastry, P. S. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10894 · Cited by 943
Self-citation
Metadata
- Authors
- Manwani, N., & Sastry, P. S.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2013-06
- Volume
- 43
- Issue
- 3
- Pages
- 1146-1151
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2102348129
- Cited by
- 258
- References
- 13
- FWCI
- 7.60
- Type
- journal article
- Language
- en
- Open access
- green
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.