The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
Classification with Noisy Labels by Importance Reweighting
Open accessAbstract
In this paper, we study a classification problem in which sample labels are randomly corrupted. In this scenario, there is an unobservable sample with noise-free labels. However, before being observed, the true labels are independently flipped with a probability ρ ∈ [0,0.5), and the random label noise can be class-conditional. Here, we address two fundamental problems raised by this scenario. The first is how to best use the abundant surrogate loss functions designed for the traditional classification problem when there is label noise. We prove that any surrogate loss function can be used for classification with noisy labels by using importance reweighting, with consistency assurance that the label noise does not ultimately hinder the search for the optimal classifier of the noise-free sample. The other is the open problem of how to obtain the noise rate ρ. We show that the rate is upper bounded by the conditional probability P(∧Y|X) of the noisy sample. Consequently, the rate can be estimated, because the upper bound can be easily reached in classification problems. Experimental results on synthetic and real datasets confirm the efficiency of our methods.
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
The Nature of Statistical Learning Theory
Vapnik, V. N. (2000) · Springer eBooks · doi:10.1007/978-1-4757-3264-1 · Cited by 10,696
(2006) · Cited by 3,624
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
Bartlett, P. L., & Mendelson, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_15 · Cited by 1,949
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
Correntropy: Properties and Applications in Non-Gaussian Signal Processing
Liu, W., Pokharel, P. P., & Principe, J. C. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.896065 · Cited by 1,695
Correcting Sample Selection Bias by Unlabeled Data
Huang, J., Smola, A. J., Gretton, A., Borgwardt, K. M., & Schölkopf, B. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0080 · Cited by 1,571
Cited by
Structural Deep Network Embedding
Wang, D., Cui, P., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939753 · Cited by 2,845
Making Deep Neural Networks Robust to Label Noise: A Loss Correction Approach
Patrini, G., Rozza, A., Menon, A. K., Nock, R., & Qu, L. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.240 · Cited by 1,399
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
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
Deep learning with noisy labels: Exploring techniques and remedies in medical image analysis
Karimi, D., Dou, H., Warfield, S. K., & Gholipour, A. (2020) · Medical Image Analysis · doi:10.1016/j.media.2020.101759 · Cited by 706
Learning from positive and unlabeled data: a survey
Bekker, J., & Davis, J. (2020) · Machine Learning · doi:10.1007/s10994-020-05877-5 · Cited by 651
Combating Noisy Labels by Agreement: A Joint Training Method with Co-Regularization
Wei, H., Feng, L., Chen, X., & An, B. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.01374 · Cited by 604
Unsupervised Embedding Learning via Invariant and Spreading Instance Feature
Ye, M., Zhang, X., Yuen, P. C., & Chang, S.-F. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00637 · Cited by 601
Learning from Noisy Labels with Distillation
Li, Y., Yang, J., Song, Y., Cao, L., Luo, J., & Li, L.-J. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.211 · Cited by 541
Weakly supervised learning of biomedical information extraction from curated data
Jain, S., R., K., Kuo, T.-T., Bhargava, S., Lin, G., & Hsu, C.-N. (2016) · BMC Bioinformatics · doi:10.1186/s12859-015-0844-1 · Cited by 450
Robust Face Recognition via Multimodal Deep Face Representation
Ding, C., & Tao, D. (2015) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2015.2477042 · Cited by 449
Self-citationMulti-Directional Multi-Level Dual-Cross Patterns for Robust Face Recognition
Ding, C., Choi, J., Tao, D., & Davis, L. S. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2462338 · Cited by 381
Self-citationImage 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
Feature Selection Based on Structured Sparsity: A Comprehensive Study
Gui, J., Sun, Z., Ji, S., Tao, D., & Tan, T. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2551724 · Cited by 335
Self-citationA Comprehensive Survey on Pose-Invariant Face Recognition
Ding, C., & Tao, D. (2016) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2845089 · Cited by 329
Self-citationRecurrent neural networks for real-time prediction of TBM operating parameters
Gao, X., Shi, M., Song, X., Zhang, C., & Zhang, H. (2019) · Automation in Construction · doi:10.1016/j.autcon.2018.11.013 · Cited by 309
Zhu, J., Ge, Z., Song, Z., & Gao, F. (2018) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2018.09.003 · Cited by 308
Multi-Modal Curriculum Learning for Semi-Supervised Image Classification
Gong, C., Tao, D., Maybank, S. J., Liu, W., Kang, G., & Yang, J. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2563981 · Cited by 285
Self-citationA Comprehensive Survey on Poisoning Attacks and Countermeasures in Machine Learning
Tian, Z., Cui, L., Liang, J., & Yu, S. (2023) · ACM Computing Surveys · doi:10.1145/3551636 · Cited by 271
Self-Supervised Representation Learning by Rotation Feature Decoupling
Feng, Z., Xu, C., & Tao, D. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.01061 · Cited by 225
Self-citationMulticolumn bidirectional long short-term memory for mobile devices-based human activity recognition
Tao, D., Wen, Y., & Hong, R. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2561962 · Cited by 83
Self-citationConfidence 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
Self-citationNoise-tolerant fair classification
Lamy, A. L., Zhong, Z., Menon, A. K., & Verma, N. (2019) · arXiv · doi:10.48550/arxiv.1901.10837 · Cited by 36
Fairness Evaluation in Presence of Biased Noisy Labels
Fogliato, R., G'Sell, M., & Chouldechova, A. (2020) · arXiv · doi:10.48550/arxiv.2003.13808 · Cited by 23
AQuA: A Benchmarking Tool for Label Quality Assessment
Goswami, M., Sanil, V., Choudhry, A., Srinivasan, A., Udompanyawit, C., & Dubrawski, A. (2023) · arXiv · doi:10.48550/arxiv.2306.09467 · Cited by 8
Metadata
- Authors
- Liu, T., & Tao, D.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2016-03-01
- Volume
- 38
- Issue
- 3
- Pages
- 447-461
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- 1939-3539
- OpenAlex
- W1514928307
- Cited by
- 782
- References
- 52
- FWCI
- 56.62
- 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.