mlsanityData to 14 Oct 2026

ART: Adaptive Resampling-based Training for Imbalanced Classification

arXiv 2509.00955 ↗First posted 31 Aug 2025cs.LG cs.AI stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Traditional resampling methods for handling class imbalance typically uses fixed distributions, undersampling the majority or oversampling the minority. These static strategies ignore changes in class-wise learning difficulty, which can limit the overall performance of the model. This paper proposes an Adaptive Resampling-based Training (ART) method that periodically updates the distribution of the training data based on the class-wise performance of the model. Specifically, ART uses class-wise macro F1 scores, computed at fixed intervals, to determine the degree of resampling to be performed. Unlike instance-level difficulty modeling, which is noisy and outlier-sensitive, ART adapts at the class level. This allows the model to incrementally shift its attention towards underperforming classes in a way that better aligns with the optimization objective. Results on diverse benchmarks, including Pima Indians Diabetes and Yeast dataset demonstrate that ART consistently outperforms both resampling-based and algorithm-level methods, including Synthetic Minority Oversampling Technique (SMOTE), NearMiss Undersampling, and Cost-sensitive Learning on binary as well as multi-class classification tasks with varying degrees of imbalance. In most settings, these improvements are statistically significant. On tabular datasets, gains are significant under paired t-tests and Wilcoxon tests (p < 0.05), while results on text and image tasks remain favorable. Compared to training on the original imbalanced data, ART improves macro F1 by an average of 2.64 percentage points across all tested tabular datasets. Unlike existing methods, whose performance varies by task, ART consistently delivers the strongest macro F1, making it a reliable choice for imbalanced classification.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 31 references that are in the map. First posted on arXiv 31 Aug 2025.

Builds on

12 of 31 references.

References · 12

  1. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  2. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
  3. 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,463
  4. 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,245
  5. 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 989
  6. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
  7. 2020Contrastive Learning with Hard Negative Samplescited by 628
  8. 2016Training Region-based Object Detectors with Online Hard Example Miningcited by 579
  9. 2020Balanced Meta-Softmax for Long-Tailed Visual Recognitioncited by 400
  10. 2019Dynamic Curriculum Learning for Imbalanced Data Classificationcited by 93
  11. 2022Class-Difficulty Based Methods for Long-Tailed Visual Recognitioncited by 23
  12. 2019AdaSample: Adaptive Sampling of Hard Positives for Descriptor Learningcited by 1

Built on by

Not cited yet.