Scaling Law Phenomena Across Regression Paradigms: Multiple and Kernel Approaches
Not on the map. Why?
Abstract (arXiv)
Recently, Large Language Models (LLMs) have achieved remarkable success. A key factor behind this success is the scaling law observed by OpenAI. Specifically, for models with Transformer architecture, the test loss exhibits a power-law relationship with model size, dataset size, and the amount of computation used in training, demonstrating trends that span more than seven orders of magnitude. This scaling law challenges traditional machine learning wisdom, notably the Oscar Scissors principle, which suggests that an overparametrized algorithm will overfit the training datasets, resulting in poor test performance. Recent research has also identified the scaling law in simpler machine learning contexts, such as linear regression. However, fully explaining the scaling law in large practical models remains an elusive goal. In this work, we advance our understanding by demonstrating that the scaling law phenomenon extends to multiple regression and kernel regression settings, which are significantly more expressive and powerful than linear methods. Our analysis provides deeper insights into the scaling law, potentially enhancing our understanding of LLMs.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 103 of its 133 references that are in the map. First posted on arXiv 3 Mar 2025.
Builds on
103 of 133 references.
References · 103
- 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
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
- 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
- 2017Deep reinforcement learning from human preferencescited by 3,912
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
38 more
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,592
- 2021Calibrate Before Use: Improving Few-Shot Performance of Language Modelscited by 1,392
- 2020Making Pre-trained Language Models Better Few-shot Learnerscited by 1,256
- 2023LIMA: Less Is More for Alignmentcited by 1,100
- 2021Scaling Vision Transformerscited by 999
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2023LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attentioncited by 781
- 2022Transformers learn in-context by gradient descentcited by 732
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
- 2023LLaMA-Adapter V2: Parameter-Efficient Visual Instruction Modelcited by 602
- 2017Deep Learning Scaling is Predictable, Empiricallycited by 582
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 573
- 2020Scaling Laws for Autoregressive Generative Modelingcited by 522
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
- 2023Scaling Data-Constrained Language Modelscited by 403
- 2021Explaining Neural Scaling Lawscited by 363
- 2018Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layerscited by 340
- 2018Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Datacited by 261
- 2019A Constructive Prediction of the Generalization Error Across Scalescited by 210
- 2024A Dynamical Model of Neural Scaling Lawscited by 111
- 2023Fast Attention Requires Bounded Entriescited by 102
- 2021Generalization Error Rates in Kernel Regression: The Crossover from the Noiseless to Noisy Regimecited by 96
- 2018On the Convergence Rate of Training Recurrent Neural Networkscited by 82
- 2024Scaling Laws in Linear Regression: Compute, Parameters, and Datacited by 57
- 2020A Neural Scaling Law from the Dimension of the Data Manifoldcited by 52
- 2023Attention Scheme Inspired Softmax Regressioncited by 49
- 2023An Over-parameterized Exponential Regressioncited by 45
- 2023Solving Regularized Exp, Cosh and Sinh Regression Problemscited by 44
- 2023How to Capture Higher-order Correlations? Generalizing Matrix Softmax Attention to Kronecker Computationcited by 44
- 2024On Computational Limits of Modern Hopfield Models: A Fine-Grained Complexity Analysiscited by 41
- 2024On Statistical Rates and Provably Efficient Criteria of Latent Diffusion Transformers (DiTs)cited by 40
- 2023Randomized and Deterministic Attention Sparsification Algorithms for Over-parameterized Feature Dimensioncited by 37
- 2024LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformerscited by 37
- 2023An Iterative Algorithm for Rescaled Hyperbolic Functions Regressioncited by 35
- 2023STanHop: Sparse Tandem Hopfield Model for Memory-Enhanced Time Series Predictioncited by 35
50 most cited of 103 All 103 (JSON)
Built on by
Citing papers per year: 2025: 4.
4 papers.
- 2025Theoretical Guarantees for High Order Trajectory Refinement in Generative Flowscited by 10
- 2025Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decodingcited by 2
- 2025Theoretical Foundation of Flow-Based Time Series Generation: Provable Approximation, Generalization, and Efficiencycited by 2
- 2025Unifying Learning Dynamics and Generalization in Transformers Scaling Lawcited by 2
- 2025Unifying Learning Dynamics and Generalization in Transformers Scaling Law26 Dec 2025
- 2025Theoretical Foundation of Flow-Based Time Series Generation: Provable Approximation, Generalization, and Efficiency18 Mar 2025
- 2025Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decoding14 Mar 2025
- 2025Theoretical Guarantees for High Order Trajectory Refinement in Generative Flows12 Mar 2025