Efficient Training of Language Models with Compact and Consistent Next Token Distributions
원문 초록
Maximizing the likelihood of the next token is an established, statistically sound objective for pre-training language models. In this paper we show that we can train better models faster by pre-aggregating the corpus with a collapsed $n$-gram distribution. Previous studies have proposed corpus-level $n$-gram statistics as a regularizer; however, the construction and querying of such $n$-grams, if done naively, prove to be costly and significantly impede training speed, thereby limiting their application in modern large language model pre-training. We introduce an alternative compact representation of the next token distribution that, in expectation, aligns with the complete $n$-gram distribution while markedly reducing variance across mini-batches compared to the standard next-token loss. Empirically, we demonstrate that both the $n$-gram regularized model and our approximation yield substantial improvements in model quality and convergence rate compared to existing methods. Furthermore, our approximation facilitates scalability of gains to larger datasets and models compared to the straightforward $n$-gram regularization method.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Specification-based Security Evaluation of Real-World Agents Tool-Calling under Long-Horizon Context Tasks
Assay2Mol: large language model-based drug design using BioAssay context
Open Source Planning & Control System with Language Agents for Autonomous Scientific Discovery
Detecting Referring Expressions in Visually Grounded Dialogue with Autoregressive Language Models
mTSBench: Benchmarking Multivariate Time Series Anomaly Detection and Model Selection at Scale
AgentStealth: Reinforcing Large Language Model for Anonymizing User-generated Text
토론
이 논문과 연결된 포럼 글이 아직 없습니다.