English
Related papers

Related papers: How Do Large Language Monkeys Get Their Power (Law…

200 papers

Recent work has identified simple empirical scaling laws for language models, linking compute budget, dataset size, model size, and autoregressive modeling loss. The validity of these simple power laws across orders of magnitude in model…

Machine Learning · Statistics 2021-09-27 Amélie Chatelain , Amine Djeghri , Daniel Hesslow , Julien Launay , Iacopo Poli

Large Language Models (LLMs) are leading a new technological revolution as one of the most promising research streams toward artificial general intelligence. The scaling of these models, accomplished by increasing the number of parameters…

Machine Learning · Computer Science 2025-03-17 Leonardo Berti , Flavio Giorgi , Gjergji Kasneci

As AI model size grows, neural scaling laws have become a crucial tool to predict the improvements of large models when increasing capacity and the size of original (human or natural) training data. Yet, the widespread use of popular models…

Machine Learning · Computer Science 2024-06-03 Elvis Dohmatob , Yunzhen Feng , Pu Yang , Francois Charton , Julia Kempe

The performance of a language model has been shown to be effectively modeled as a power-law in its parameter count. Here we study the scaling behaviors of Routing Networks: architectures that conditionally use only a subset of their…

Achieving high-performing language models which include medium- and lower-resource languages remains a challenge. Massively multilingual models still underperform compared to language-specific adaptations, especially at smaller model…

Computation and Language · Computer Science 2025-12-12 Kevin Glocker , Kätriin Kukk , Romina Oji , Marcel Bollmann , Marco Kuhlmann , Jenny Kunz

This paper investigates the mathematical reasoning capabilities of large language models (LLMs) using 50 newly constructed high-school-level word problems. Unlike prior studies that focus solely on answer correctness, we rigorously analyze…

Artificial Intelligence · Computer Science 2025-02-24 Johan Boye , Birger Moell

The recent surge of generative AI has been fueled by the generative power of diffusion probabilistic models and the scalable capabilities of large language models. Despite their potential, it remains elusive whether diffusion language…

Computation and Language · Computer Science 2025-02-25 Jiasheng Ye , Zaixiang Zheng , Yu Bao , Lihua Qian , Quanquan Gu

Large language models (LLMs) have demonstrated impressive capabilities, but still suffer from inconsistency issues (e.g. LLMs can react differently to disturbances like rephrasing or inconsequential order change). In addition to these…

Computation and Language · Computer Science 2024-06-19 Zhe Yang , Yichang Zhang , Tianyu Liu , Jian Yang , Junyang Lin , Chang Zhou , Zhifang Sui

We analyze neural scaling laws in a solvable model of last-layer fine-tuning where targets have intrinsic, instance-heterogeneous difficulty. In our Latent Instance Difficulty (LID) model, each input's target variance is governed by a…

Machine Learning · Computer Science 2026-01-08 Noam Levi

Larger language models become simultaneously better and worse at handling contextual information -- better at ignoring false claims, worse at ignoring irrelevant tokens. We formalize this apparent paradox through the first scaling laws for…

Computation and Language · Computer Science 2026-04-16 Dikshant Kukreja , Kshitij Sah , Gautam Gupta , Avinash Anand , Rajiv Ratn Shah , Zhengkui Wang , Aik Beng Ng , Erik Cambria

The scaling of large language models (LLMs) emphasizes increasing depth, yet performance gains diminish with added layers. Prior work introduces the concept of "effective depth", arguing that deeper models fail to fully utilize their layers…

Computation and Language · Computer Science 2025-12-17 Yi Hu , Cai Zhou , Muhan Zhang

Within the scaling laws paradigm, which underpins the training of large neural networks like ChatGPT and Llama, we consider a supervised regression setting and establish the existance of a strong form of the model collapse phenomenon, a…

Machine Learning · Computer Science 2024-10-10 Elvis Dohmatob , Yunzhen Feng , Arjun Subramonian , Julia Kempe

We provide sufficient conditions for polynomial rate of convergence in the weak law of large numbers for supercritical general indecomposable multi-type branching processes. The main result is derived by investigating the embedded…

Probability · Mathematics 2014-11-07 Alexander Iksanov , Matthias Meiners

Recent work has shown that large pretrained Language Models (LMs) can not only perform remarkably well on a range of Natural Language Processing (NLP) tasks but also start improving on reasoning tasks such as arithmetic induction, symbolic…

Computation and Language · Computer Science 2022-08-11 Jing Qian , Hong Wang , Zekun Li , Shiyang Li , Xifeng Yan

Scientific idea generation and selection requires exploration following a target probability distribution. In contrast, current AI benchmarks have objectively correct answers, and training large language models (LLMs) via reinforcement…

Machine Learning · Computer Science 2025-11-19 Ivy Yuqian Yang , David Yu Zhang

Consistently scaling pre-trained language models (PLMs) imposes substantial burdens on model adaptation, necessitating more efficient alternatives to conventional fine-tuning. Given the advantage of prompting in the zero-shot setting and…

Computation and Language · Computer Science 2023-06-01 Yulin Chen , Ning Ding , Xiaobin Wang , Shengding Hu , Hai-Tao Zheng , Zhiyuan Liu , Pengjun Xie

We present the first systematic investigation of Martin's Law - the empirical relationship between word frequency and polysemy - in text generated by neural language models during training. Using DBSCAN clustering of contextualized…

Computation and Language · Computer Science 2025-11-27 Kai Kugler

Multilinguality is crucial for extending recent advancements in language modelling to diverse linguistic communities. To maintain high performance while representing multiple languages, multilingual models ideally align representations,…

Computation and Language · Computer Science 2024-07-18 Anton Schäfer , Shauli Ravfogel , Thomas Hofmann , Tiago Pimentel , Imanol Schlag

Scaling laws provide important insights that can guide the design of large language models (LLMs). Existing work has primarily focused on studying scaling laws for pretraining (upstream) loss. However, in transfer learning settings, in…

Computation and Language · Computer Science 2026-01-30 Berivan Isik , Natalia Ponomareva , Hussein Hazimeh , Dimitris Paparas , Sergei Vassilvitskii , Sanmi Koyejo

Can autoregressive large language models (LLMs) learn consistent probability distributions when trained on sequences in different token orders? We prove formally that for any well-defined probability distribution, sequence perplexity is…

Computation and Language · Computer Science 2025-05-14 Xiaoliang Luo , Xinyi Xu , Michael Ramscar , Bradley C. Love