Beyond What to Select: A Plug-and-play Oscillatory Data-Volume Scheduling for Efficient Model Training
Not on the map. Why?
Abstract (arXiv)
Data selection accelerates training by identifying representative training data while preserving model performance. However, existing methods mainly focus on designing sample-importance criteria, i.e., deciding what to select, while typically fixing the selected data volume as the target ratio throughout training. Thus, they are often dynamic in sample identity but static in data volume. In this work, we revisit data selection from an optimization perspective and show that selected-data training induces an implicit regularization effect modulated by the instantaneous selection ratio. This reveals a key trade-off: lower ratios amplify selection-induced regularization, whereas higher ratios preserve data coverage and optimization fidelity. Motivated by this insight, we propose PODS, a Plug-and-play Oscillatory Data-volume Scheduling framework. Rather than introducing another sample-scoring metric, PODS serves as a lightweight module that dynamically schedules how much data to select over training. Under the target selection ratio, PODS alternates between low-ratio regularization phases and high-ratio recovery phases to exploit selection-induced regularization without sacrificing optimization stability. With its lightweight, ratio-level, and task-agnostic design, PODS is compatible with existing static and dynamic selection methods and broadly applicable across training paradigms. Experiments across various datasets, architectures, and tasks show that PODS consistently improves the efficiency-generalization trade-off, e.g., reducing ImageNet-1k training cost by 50% with improved accuracy and accelerating LLM instruction tuning by over 2x without performance degradation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 42 of its 59 references that are in the map. First posted on arXiv 14 May 2026.
Builds on
42 of 59 references.
References · 42
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Microsoft COCO: Common Objects in Contextcited by 17,608
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
- 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,850
- 2013Fine-Grained Visual Classification of Aircraftcited by 1,726
- 2019Natural Adversarial Examplescited by 1,408
- 2023The Flan Collection: Designing Data and Methods for Effective Instruction Tuningcited by 739
- 2023OpenAssistant Conversations -- Democratizing Large Language Model Alignmentcited by 721
- 2019Large-Scale Long-Tailed Recognition in an Open Worldcited by 705
30 more
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
- 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 528
- 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 497
- 2017A Downsampled Variant of ImageNet as an Alternative to the CIFAR datasetscited by 377
- 2017How to Escape Saddle Points Efficientlycited by 285
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
- 2022Dataset Pruning: Reducing Training Data by Examining Generalization Influencecited by 133
- 2022Coverage-centric Coreset Selection for High Pruning Ratescited by 117
- 2023InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruningcited by 90
- 2020Submodular Combinatorial Information Measures with Applications in Machine Learningcited by 88
- 2023D2 Pruning: Message Passing for Balancing Diversity and Difficulty in Data Pruningcited by 69
- 2023Data Pruning via Moving-one-Sample-outcited by 67
- 2023Large-scale Dataset Pruning with Dynamic Uncertaintycited by 63
- 2024What is YOLOv8: An In-Depth Exploration of the Internal Features of the Next-Generation Object Detectorcited by 45
- 2023Towards Sustainable Learning: Coresets for Data-efficient Deep Learningcited by 44
- 2021Accelerating Deep Learning with Dynamic Data Pruningcited by 43
- 2023Spanning Training Progress: Temporal Dual-Depth Scoring (TDDS) for Enhanced Dataset Pruningcited by 38
- 2023Data Valuation Without Training of a Modelcited by 35
- 2023ImageNet-Hard: The Hardest Images Remaining from a Study of the Power of Zoom and Spatial Biases in Image Classificationcited by 33
- 2023Repeated Random Sampling for Minimizing the Time-to-Accuracy of Learningcited by 26
- 2019SSRGD: Simple Stochastic Recursive Gradient Descent for Escaping Saddle Pointscited by 25
- 2023Data-Efficient Contrastive Self-supervised Learning: Most Beneficial Examples for Supervised Learning Contribute the Leastcited by 22
- 2025Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertaintycited by 22
- 2024A CLIP-Powered Framework for Robust and Generalizable Data Selectioncited by 21
- 2023You Only Condense Once: Two Rules for Pruning Condensed Datasetscited by 20
- 2023A Weighted K-Center Algorithm for Data Subset Selectioncited by 9
- 2025When Dynamic Data Selection Meets Data Augmentationcited by 6
- 2025RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessmentcited by 3
- 2026Rethinking Representativeness and Diversity in Dynamic Data Selectioncited by 2
Built on by
Not cited yet.