mlsanityData to 7 Oct 2026

SFT-GO: Supervised Fine-Tuning with Group Optimization for Large Language Models

arXiv 2506.15021 ↗First posted 17 Jun 2025cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Supervised fine-tuning (SFT) has become an essential step in tailoring large language models (LLMs) to align with human expectations and specific downstream tasks. However, existing SFT methods typically treat each training instance as a uniform sequence, giving equal importance to all tokens regardless of their relevance. This overlooks the fact that only a subset of tokens often contains critical, task-specific information. To address this limitation, we introduce Supervised Fine-Tuning with Group Optimization (SFT-GO), a novel approach that treats groups of tokens differently based on their importance.SFT-GO groups tokens in each sample based on their importance values and optimizes the LLM using a weighted combination of the worst-group loss and the standard cross-entropy loss. This mechanism adaptively emphasizes the most challenging token groups and guides the model to better handle different group distributions, thereby improving overall learning dynamics. We provide a theoretical analysis of SFT-GO's convergence rate, demonstrating its efficiency. Empirically, we apply SFT-GO with three different token grouping strategies and show that models trained with SFT-GO consistently outperform baseline approaches across popular LLM benchmarks. These improvements hold across various datasets and base models, demonstrating the robustness and the effectiveness of our method.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 29 of its 40 references that are in the map. First posted on arXiv 17 Jun 2025.

Builds on

29 of 40 references.

References · 29

  1. 2017Attention Is All You Needcited by 59,932
  2. 2022Training language models to follow instructions with human feedbackcited by 15,712
  3. 2024The Llama 3 Herd of Modelscited by 14,192
  4. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  5. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  6. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  7. 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,919
  8. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  9. 2023Instruction-Following Evaluation for Large Language Modelscited by 1,143
  10. 2024Tulu 3: Pushing Frontiers in Open Language Model Post-Trainingcited by 988
  11. 2019Attention is not Explanationcited by 916
  12. 2019MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalismscited by 653
17 more
  1. 2019Attention is not not Explanationcited by 629
  2. 2023LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compressioncited by 443
  3. 2023Learning to Compress Prompts with Gist Tokenscited by 379
  4. 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compressioncited by 343
  5. 2023From Quantity to Quality: Boosting LLM Performance with Self-Guided Data Selection for Instruction Tuningcited by 301
  6. 2024HelpSteer2: Open-source dataset for training top-performing reward modelscited by 232
  7. 2023Compressing Context to Enhance Inference Efficiency of Large Language Modelscited by 185
  8. 2016Variance-based regularization with convex objectivescited by 153
  9. 2019Distributionally Robust Language Modelingcited by 142
  10. 2024Rho-1: Not All Tokens Are What You Needcited by 132
  11. 2015Distributionally Robust Logistic Regressioncited by 124
  12. 2018Deriving Machine Attention from Human Rationalescited by 54
  13. 2016Rationale-Augmented Convolutional Neural Networks for Text Classificationcited by 39
  14. 2022Learning to Solve Routing Problems via Distributionally Robust Optimizationcited by 31
  15. 2020Token-level Adaptive Training for Neural Machine Translationcited by 21
  16. 2023Re-weighting Tokens: A Simple and Effective Active Learning Strategy for Named Entity Recognitioncited by 4
  17. 2023Investigating Group Distributionally Robust Optimization for Deep Imbalanced Learning: A Case Study of Binary Tabular Data Classificationcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.