mlsanityData to 7 Oct 2026

Mixup Without Hesitation

arXiv 2101.04342 ↗First posted 12 Jan 2021cs.CVcited by 13

Not on the map. Why?

Abstract (arXiv)

Mixup linearly interpolates pairs of examples to form new samples, which is easy to implement and has been shown to be effective in image classification tasks. However, there are two drawbacks in mixup: one is that more training epochs are needed to obtain a well-trained model; the other is that mixup requires tuning a hyper-parameter to gain appropriate capacity but that is a difficult task. In this paper, we find that mixup constantly explores the representation space, and inspired by the exploration-exploitation dilemma in reinforcement learning, we propose mixup Without hesitation (mWh), a concise, effective, and easy-to-use training algorithm. We show that mWh strikes a good balance between exploration and exploitation by gradually replacing mixup with basic data augmentation. It can achieve a strong baseline with less training time than original mixup and without searching for optimal hyper-parameter, i.e., mWh acts as mixup without hesitation. mWh can also transfer to CutMix, and gain consistent improvement on other machine learning and computer vision tasks such as object detection. Our code is open-source and available at https://github.com/yuhao318/mwh

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 19 of its 28 references that are in the map. First posted on arXiv 12 Jan 2021.

Builds on

19 of 28 references.

References · 19

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  3. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
  4. 2016Densely Connected Convolutional Networkscited by 6,691
  5. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  6. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  7. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
  8. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
  9. 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,623
  10. 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,390
  11. 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 691
  12. 2019On Mixup Training: Improved Calibration and Predictive Uncertainty for Deep Neural Networkscited by 304
7 more
  1. 2019Adversarial Domain Adaptation with Domain Mixupcited by 250
  2. 2019Fast AutoAugmentcited by 243
  3. 2018MixUp as Locally Linear Out-Of-Manifold Regularizationcited by 158
  4. 2019Population Based Augmentation: Efficient Learning of Augmentation Policy Schedulescited by 153
  5. 2020GridMask Data Augmentationcited by 123
  6. 2019Mixup Inference: Better Exploiting Mixup to Defend Adversarial Attackscited by 54
  7. 2019Data Augmentation Revisited: Rethinking the Distribution Gap between Clean and Augmented Datacited by 33

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 3; 2024: 5; 2025: 0; 2026: 1.

13 papers.

Sort:

By area: