Affiliation:
1. Department of Information Resources Management, Business School, Nankai University, Tianjin, China and Center for Applied Mathematics, Tianjin University, Tianjin, China
2. Center for Applied Mathematics, Tianjin University, Tianjin, China
Abstract
Weighting strategy prevails in machine learning. For example, a common approach in robust machine learning is to exert low weights on samples which are likely to be noisy or quite hard. This study summarizes another less-explored strategy, namely, perturbation. Various incarnations of perturbation have been utilized but it has not been explicitly revealed. Learning with perturbation is called perturbation learning and a systematic taxonomy is constructed for it in this study. In our taxonomy, learning with perturbation is divided on the basis of the perturbation targets, directions, inference manners, and granularity levels. Many existing learning algorithms including some classical ones can be understood with the constructed taxonomy. Alternatively, these algorithms share the same component, namely, perturbation in their procedures. Furthermore, a family of new learning algorithms can be obtained by varying existing learning algorithms with our taxonomy. Specifically, three concrete new learning algorithms are proposed for robust machine learning. Extensive experiments on image classification and text sentiment analysis verify the effectiveness of the three new algorithms. Learning with perturbation can also be used in other various learning scenarios, such as imbalanced learning, clustering, regression, and so on.
Publisher
Association for Computing Machinery (ACM)
Reference95 articles.
1. M. Bazaraa, H. Sherali, and C. Shetty. 1993. Nonlinear Programming - Theory and Algorithms. John Wiley and Sons, Inc.
2. Curriculum learning
3. Universal Adversarial Training with Class-Wise Perturbations
4. Kaidi Cao, Colin Wei, Adrien Gaidon, Nikos Arechiga, and Tengyu Ma. 2019. Learning imbalanced datasets with label-distribution-aware margin loss. In Proceedings of the Advances in Neural Information Processing Systems. 1565–1576.
5. Ordinal hyperplanes ranker with cost sensitivities for age estimation