mlsanityData to 7 Oct 2026

Data Agent: Learning to Select Data via End-to-End Dynamic Optimization

arXiv 2603.07433 ↗First posted 8 Mar 2026cs.LG cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Dynamic Data selection aims to accelerate training by prioritizing informative samples during online training. However, existing methods typically rely on task-specific handcrafted metrics or static/snapshot-based criteria to estimate sample importance, limiting scalability across learning paradigms and making it difficult to capture the evolving utility of data throughout training. To address this challenge, we propose Data Agent, an end-to-end dynamic data selection framework that formulates data selection as a training-aware sequential decision-making problem. The agent learns a sample-wise selection policy that co-evolves with model optimization, guided by a composite reward that integrates loss-based difficulty and confidence-based uncertainty signals. The reward signals capture complementary objectives of optimization impact and information gain, together with a tuning-free adaptive weighting mechanism that balances these signals over training. Extensive experiments across a wide range of datasets and architectures demonstrate that Data Agent consistently accelerates training while preserving or improving performance, e.g., reducing costs by over 50% on ImageNet-1k and MMLU with lossless performance. Moreover, its dataset-agnostic formulation and modular reward make it plug-and-play across tasks and scenarios, e.g., robustness to noisy datasets, highlighting its potential in real-world scenarios. Code is available at https://github.com/Jackbrocp/Data-Agent.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 45 of its 62 references that are in the map. First posted on arXiv 8 Mar 2026.

Builds on

45 of 62 references.

References · 45

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2023GPT-4 Technical Reportcited by 18,132
  4. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  5. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 1,916
  6. 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
  7. 2019Natural Adversarial Examplescited by 1,401
  8. 2018Unified Perceptual Parsing for Scene Understandingcited by 1,265
  9. 2016Semantic Understanding of Scenes through the ADE20K Datasetcited by 1,063
  10. 2024Length-Controlled AlpacaEval: A Simple Way to Debias Automatic Evaluatorscited by 865
  11. 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 816
  12. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
33 more
  1. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
  2. 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 519
  3. 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 492
  4. 2017A Downsampled Variant of ImageNet as an Alternative to the CIFAR datasetscited by 374
  5. 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
  6. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 224
  7. 2022Minimizing the Accumulated Trajectory Error to Improve Dataset Distillationcited by 142
  8. 2022Dataset Pruning: Reducing Training Data by Examining Generalization Influencecited by 132
  9. 2024DPO Meets PPO: Reinforced Token Optimization for RLHFcited by 126
  10. 2022Coverage-centric Coreset Selection for High Pruning Ratescited by 115
  11. 2023A Comprehensive Survey of Dataset Distillationcited by 114
  12. 2023InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruningcited by 90
  13. 2024D4M: Dataset Distillation via Disentangled Diffusion Modelcited by 76
  14. 2023D2 Pruning: Message Passing for Balancing Diversity and Difficulty in Data Pruningcited by 68
  15. 2023Data Pruning via Moving-one-Sample-outcited by 67
  16. 2023Large-scale Dataset Pruning with Dynamic Uncertaintycited by 63
  17. 2022Accelerating Dataset Distillation via Model Augmentationcited by 62
  18. 2023Towards Sustainable Learning: Coresets for Data-efficient Deep Learningcited by 44
  19. 2021Accelerating Deep Learning with Dynamic Data Pruningcited by 43
  20. 2024Elucidating the Design Space of Dataset Condensationcited by 40
  21. 2023Spanning Training Progress: Temporal Dual-Depth Scoring (TDDS) for Enhanced Dataset Pruningcited by 38
  22. 2023Data Valuation Without Training of a Modelcited by 35
  23. 2023ImageNet-Hard: The Hardest Images Remaining from a Study of the Power of Zoom and Spatial Biases in Image Classificationcited by 33
  24. 2023Data-Efficient Contrastive Self-supervised Learning: Most Beneficial Examples for Supervised Learning Contribute the Leastcited by 22
  25. 2025Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertaintycited by 22
  26. 2024A CLIP-Powered Framework for Robust and Generalizable Data Selectioncited by 20
  27. 2026OPUS: Towards Efficient and Principled Data Selection in Large Language Model Pre-training in Every Iterationcited by 17
  28. 2024Diversified Batch Selection for Training Accelerationcited by 14
  29. 2023A Weighted K-Center Algorithm for Data Subset Selectioncited by 9
  30. 2025Winning the Pruning Gamble: A Unified Approach to Joint Sample and Token Pruning for Efficient Supervised Fine-Tuningcited by 8
  31. 2025When Dynamic Data Selection Meets Data Augmentationcited by 6
  32. 2024Decomposed Distribution Matching in Dataset Condensationcited by 3
  33. 2025RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessmentcited by 3

Built on by

Not cited yet.