Challenge: a study of large language models (LLMs) reveals the transferability and discrepancies of scaling laws between Dense and MoE models.
Approach: They investigate the transferability and discrepancies of scaling laws between Dense Models and Mixture of Experts models.
Outcome: The results show that the power-law scaling framework also applies to MoE Models .

Similar Papers

Efficient Large Scale Language Modeling with Mixtures of Experts (2022.emnlp-main)

Copied to clipboard

Challenge: Mixture of Experts layers (MoEs) enable efficient scaling of language models . large autoregressive language models such as GPT-3 can be adapted to a wide range of tasks .
Approach: They propose to use Mixture of Experts layers to enable efficient scaling of language models . they find that MoEs are substantially more compute efficient than dense models compared to MoE models - but only when they are more modestly trained .
Outcome: The proposed model outperforms dense models in a wide range of tasks and domains.
Uncovering Scaling Laws for Large Language Models via Inverse Problems (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) have achieved remarkable success across diverse domains.
Approach: inverse problems can efficiently uncover scaling laws that guide the building of LLMs, authors argue . authors propose brute-force approaches to improve LLM training costs due to high costs .
Outcome: This paper advocates that inverse problems can efficiently uncover scaling laws that guide the building of LLMs to achieve the desirable performance with significantly better cost-effectiveness.
Scaling Vision-Language Models with Sparse Mixture of Experts (2023.findings-emnlp)

Copied to clipboard

Challenge: a study explores the effectiveness of mixture-of-experts (MoE) techniques in scaling vision-language models . alayrac and colleagues demonstrate the effectiveness and performance of MoE in scaling VLMs .
Approach: They propose to use sparsely-gated mixture-of-experts techniques to scale vision-language models . they show that MoE can achieve state-of the-art performance over dense models a range of benchmarks .
Outcome: The proposed approach achieves state-of-the-art performance over dense models of equivalent computational cost.
Revisiting Scaling Laws for Language Models: The Role of Data Quality and Training Strategies (2025.acl-long)

Copied to clipboard

Challenge: Existing scaling laws suggest augmenting model size and training data results in enhanced performance, but recent studies reveal deviations, particularly in large language models, where performance improvements decelerate—a phenomenon known as sub-scaling.
Approach: They propose a sub-optimal scaling law that better predicts performance in sub-scaling regimes by examining data quality and training strategies.
Outcome: The proposed scaling law better predicts performance in sub-scaling regimes, highlighting the importance of data quality and diversity.
Scaling Laws for Multilingual Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing scaling laws for language models are limited to a limited number of languages, but they can be applied to arbitrary number of different languages.
Approach: They propose a scaling law for general-purpose decoder-only language models trained on multilingual data that shifts focus from individual languages to language families.
Outcome: The proposed scaling law can be applied to models trained on multilingual data . it can be used to predict performance across multiple languages and models .
Scaling Laws for Code: A More Data-Hungry Regime (2026.acl-long)

Copied to clipboard

Challenge: Code Large Language Models (LLMs) are revolutionizing software engineering, but scaling laws are primarily analyzed on Natural Language (NL).
Approach: They fit Chinchilla law and Farsser law to test scaling laws for code . they find code is more data-hungry and requires higher data-to-parameter ratio .
Outcome: The proposed scaling laws show that the more expressive Farsser law offers greater accuracy and scales with model size.
Temporal Scaling Law for Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing studies have found that the test loss of LLMs scales as power-laws with model size, computational budget, and dataset size.
Approach: They propose a concept of Temporal Scaling Law to study test loss of LLMs . they break down test loss into fine-grained token positions and develop a dynamic hyperbolic-law .
Outcome: The proposed model predicts the test loss of LLMs as the training steps scale up.
A Closer Look into Mixture-of-Experts in Large Language Models (2025.findings-naacl)

Copied to clipboard

Challenge: Mixture-of-experts (MoE) architectures are gaining increasing attention for their unique properties and remarkable performance.
Approach: They propose a mixture-of-experts architecture that allows for model scaling without sacrificing computational efficiency.
Outcome: The proposed model increases model size without sacrificing computational efficiency . the proposed model is modular and can be used by a broad spectrum of practitioners .
Scaling Laws for Code: Every Programming Language Matters (2026.findings-acl)

Copied to clipboard

Challenge: Existing studies focus on language-agnostic settings, neglecting the inherently multilingual nature of modern software development.
Approach: They propose a proportion-dependent scaling law that prioritizes high-utility languages . they propose PLs to have varying effects during pre-training that affect model performance .
Outcome: The proposed scaling law is based on 1000+ experiments across multiple languages and models.
Scaling Laws for BERT in Low-Resource Settings (2023.findings-acl)

Copied to clipboard

Challenge: Large language models require huge training corpora, which is unobtainable for most NLP practitioners.
Approach: They propose power-law formulas that relate model size, corpora size and computation power to find the optimal settings in advance given a fixed budget.
Outcome: The proposed models perform better on MLM and NLU tasks on four languages of different linguistic characteristics.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations