MiLe Loss: a New Entropy-Weighed Loss for Mitigating the Bias of Learning Difficulties in Large Language Models
Not on the map. Why?
Abstract (arXiv)
Generative language models are usually pretrained on large text corpus via predicting the next token (i.e., sub-word/word/phrase) given the previous ones. Recent works have demonstrated the impressive performance of large generative language models on downstream tasks. However, existing generative language models generally neglect an inherent challenge in text corpus during training, i.e., the imbalance between frequent tokens and infrequent ones. It can lead a language model to be dominated by common and easy-to-learn tokens, thereby overlooking the infrequent and difficult-to-learn ones. To alleviate that, we propose a MiLe Loss function for mitigating the bias of learning difficulties with tokens. During training, it can dynamically assess the learning difficulty of a to-be-learned token, according to the information entropy of the corresponding predicted probability distribution over the vocabulary. Then it scales the training loss adaptively, trying to lead the model to focus more on the difficult-to-learn tokens. On the Pile dataset, we train generative language models at different scales of 468M, 1.2B, and 6.7B parameters. Experiments reveal that models incorporating the proposed MiLe Loss can gain consistent performance improvement on downstream benchmarks.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 29 of its 50 references that are in the map. First posted on arXiv 30 Oct 2023.
Builds on
29 of 50 references.
References · 29
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
17 more
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
- 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,245
- 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,202
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 897
- 2019Unified Language Model Pre-training for Natural Language Understanding and Generationcited by 670
- 2013Generating Sequences With Recurrent Neural Networkscited by 554
- 2017A systematic study of the class imbalance problem in convolutional neural networkscited by 513
- 2023DoReMi: Optimizing Data Mixtures Speeds Up Language Model Pretrainingcited by 399
- 2022The case for 4-bit precision: k-bit Inference Scaling Lawscited by 251
- 2020Rethinking the Value of Labels for Improving Class-Imbalanced Learningcited by 216
- 2015Relay Backpropagation for Effective Learning of Deep Convolutional Neural Networkscited by 115
- 2018Imbalanced Deep Learning by Minority Class Incremental Rectificationcited by 65
- 2017Deep Over-sampling Framework for Classifying Imbalanced Datacited by 59
Built on by
Citing papers per year: 2024: 5; 2025: 3.
8 papers.
- 2025Boundless Byte Pair Encoding: Breaking the Pre-tokenization Barriercited by 32
- 2024Scaffold-BPE: Enhancing Byte Pair Encoding for Large Language Models with Simple and Effective Scaffold Token Removalcited by 16
- 2025Token Weighting for Long-Range Language Modelingcited by 14
- 2024MaskMoE: Boosting Token-Level Learning via Routing Mask in Mixture-of-Expertscited by 9
- 2024Breaking the Hourglass Phenomenon of Residual Quantization: Enhancing the Upper Bound of Generative Retrievalcited by 7
- 2024CartesianMoE: Boosting Knowledge Sharing among Experts via Cartesian Product Routing in Mixture-of-Expertscited by 5
- 2024LBPE: Long-token-first Tokenization to Improve Large Language Modelscited by 5
- 2025Finedeep: Mitigating Sparse Activation in Dense LLMs via Multi-Layer Fine-Grained Expertscited by 0
- 2025Boundless Byte Pair Encoding: Breaking the Pre-tokenization Barrier31 Mar 2025
- 2025Token Weighting for Long-Range Language Modeling12 Mar 2025
- 2025Finedeep: Mitigating Sparse Activation in Dense LLMs via Multi-Layer Fine-Grained Experts18 Feb 2025
- 2024LBPE: Long-token-first Tokenization to Improve Large Language Models8 Nov 2024
- 2024CartesianMoE: Boosting Knowledge Sharing among Experts via Cartesian Product Routing in Mixture-of-Experts21 Oct 2024
- 2024Breaking the Hourglass Phenomenon of Residual Quantization: Enhancing the Upper Bound of Generative Retrieval31 Jul 2024
- 2024MaskMoE: Boosting Token-Level Learning via Routing Mask in Mixture-of-Experts13 Jul 2024
- 2024Scaffold-BPE: Enhancing Byte Pair Encoding for Large Language Models with Simple and Effective Scaffold Token Removal27 Apr 2024