Why Mixup Improves the Model Performance
Not on the map. Why?
Abstract (arXiv)
Machine learning techniques are used in a wide range of domains. However, machine learning models often suffer from the problem of over-fitting. Many data augmentation methods have been proposed to tackle such a problem, and one of them is called mixup. Mixup is a recently proposed regularization procedure, which linearly interpolates a random pair of training examples. This regularization method works very well experimentally, but its theoretical guarantee is not adequately discussed. In this study, we aim to discover why mixup works well from the aspect of the statistical learning theory.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 2; 2024: 3.
6 papers.
- 2024Understanding Test-Time Augmentationcited by 23
- 2021Learning PAC-Bayes Priors for Probabilistic Neural Networkscited by 21
- 2024A Short Survey on Importance Weighting for Machine Learningcited by 15
- 2023Selective Mixup Helps with Distribution Shifts, But Not (Only) because of Mixupcited by 8
- 2024Test-Time Augmentation Meets Variational Bayescited by 3
- 2023Generalization Bounds for Set-to-Set Matching with Negative Samplingcited by 1
- 2024Test-Time Augmentation Meets Variational Bayes19 Sep 2024
- 2024A Short Survey on Importance Weighting for Machine Learning15 Mar 2024
- 2024Understanding Test-Time Augmentation10 Feb 2024
- 2023Selective Mixup Helps with Distribution Shifts, But Not (Only) because of Mixup26 May 2023
- 2023Generalization Bounds for Set-to-Set Matching with Negative Sampling25 Feb 2023
- 2021Learning PAC-Bayes Priors for Probabilistic Neural Networks21 Sep 2021