mlsanityData to 7 Oct 2026

Take the Bull by the Horns: Hard Sample-Reweighted Continual Training Improves LLM Generalization

arXiv 2402.14270 ↗First posted 22 Feb 2024cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

In the rapidly advancing arena of large language models (LLMs), a key challenge is to enhance their capabilities amid a looming shortage of high-quality training data. Our study starts from an empirical strategy for the light continual training of LLMs using their original pre-training data sets, with a specific focus on selective retention of samples that incur moderately high losses. These samples are deemed informative and beneficial for model refinement, contrasting with the highest-loss samples, which would be discarded due to their correlation with data noise and complexity. We then formalize this strategy into a principled framework of Instance-Reweighted Distributionally Robust Optimization (IR-DRO). IR-DRO is designed to dynamically prioritize the training focus on informative samples through an instance reweighting mechanism, streamlined by a closed-form solution for straightforward integration into established training protocols. Through rigorous experimentation with various models and datasets, our findings indicate that our sample-targeted methods significantly improve LLM performance across multiple benchmarks, in both continual pre-training and instruction tuning scenarios. Our codes are available at https://github.com/VITA-Group/HardFocusTraining.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 37 of its 50 references that are in the map. First posted on arXiv 22 Feb 2024.

Builds on

37 of 50 references.

References · 37

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2023GPT-4 Technical Reportcited by 18,132
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  4. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  5. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
  6. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  7. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  8. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  9. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
  10. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  11. 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,346
  12. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
25 more
  1. 2015Aligning Books and Movies: Towards Story-like Visual Explanations by Watching Movies and Reading Bookscited by 1,041
  2. 2023A Comprehensive Overview of Large Language Modelscited by 639
  3. 2023Textbooks Are All You Needcited by 561
  4. 2023Textbooks Are All You Need II: phi-1.5 technical reportcited by 559
  5. 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
  6. 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 323
  7. 2022Is synthetic data from generative models ready for image recognition?cited by 320
  8. 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
  9. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 224
  10. 2022Will we run out of data? Limits of LLM scaling based on human-generated datacited by 187
  11. 2023Orca 2: Teaching Small Language Models How to Reasoncited by 157
  12. 2023Platypus: Quick, Cheap, and Powerful Refinement of LLMscited by 150
  13. 2015Online Batch Selection for Faster Training of Neural Networkscited by 121
  14. 2023Skill-it! A Data-Driven Skills Framework for Understanding and Training Language Modelscited by 120
  15. 2019Accelerating Deep Learning by Focusing on the Biggest Loserscited by 94
  16. 2014Stochastic Compositional Gradient Descent: Algorithms for Minimizing Compositions of Expected-Value Functionscited by 93
  17. 2020An Online Method for A Class of Distributionally Robust Optimization with Non-Convex Objectivescited by 42
  18. 2018Robust Optimization over Multiple Domainscited by 34
  19. 2019Adversarial Attack Generation Empowered by Min-Max Optimizationcited by 32
  20. 2023Not All Semantics are Created Equal: Contrastive Self-supervised Learning with Automatic Temperature Individualizationcited by 25
  21. 2023NLU on Data Diets: Dynamic Data Subset Selection for NLP Classification Taskscited by 19
  22. 2022Stochastic Constrained DRO with a Complexity Independent of Sample Sizecited by 16
  23. 2023Irreducible Curriculum for Language Model Pretrainingcited by 16
  24. 2023Auditing and Generating Synthetic Data with Controllable Trust Trade-offscited by 13
  25. 2020Attentional-Biased Stochastic Gradient Descentcited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 4; 2025: 6; 2026: 2.

12 papers.