Infinite-Parameter LLMs: Generating and Adapting Weights from Live Data
On the map: Mixture-of-experts → MoE large language models
Abstract (arXiv)
Scaling laws hold that language models grow more capable with more parameters and more training data. Mixture-of-Experts (MoE) architectures are a remarkable demonstration of these laws, activating only a fraction of an enormous parameter bank for each token. But this success is built on static pretraining data --- the facts and corrections supplied by users during live interactions are a significant untapped source of potential improvement for a deployed model, but cannot be exploited by conventional architectures whose weights are frozen after training. Instead, this newfound knowledge must be placed in the context (by instruction or retrieval) and re-read on every request, only to be discarded afterwards. We seek instead to learn from live interactions by dynamically updating model weights. Inspired by MoEs, we propose the Infinite-Parameter LLM. A compact hypernetwork turns the online data into low-rank modulations of a shared base network, so feed-forward weights are generated from live data, not read from static memory. Whereas existing weight generators are held fixed after reading the context once, we form a Bayesian belief over the generator's latent state and update it online, such that the effective weights are re-derived as our belief evolves during the session. Although the model's memory footprint is constant, the feasible space of generated weights is thus effectively infinite. Representing live data in the weights rather than the prompt amortises compute, frees the context window, persists updates across turns, and can generalise better than in-context use. Our evaluation protocol applies this methodology to in-context learning and retrieval.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in MoE large language models, one of 12 directions in Mixture-of-experts. Builds on 92 of its 104 references that are in the map. First posted on arXiv 16 Sep 2026.
Builds on
92 of 104 references.
Closest ancestors · 13
Same direction, newest first
- 2025Bayesian Mixture of Experts For Large Language Models12 Nov
- 2025Qwen3 Technical Report14 May
- 2025Parameters vs FLOPs: Scaling Laws for Optimal Sparsity for Mixture-of-Experts Language Models21 Jan
- 2024Lory: Fully Differentiable Mixture-of-Experts for Autoregressive Language Model Pre-training6 May
- 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Models22 Feb
- 2024HyperMoE: Towards Better Mixture of Experts via Transferring Among Experts20 Feb
- 2024Scaling Laws for Fine-Grained Mixture of Experts12 Feb
- 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Models11 Jan
- 2024Mixtral of Experts8 Jan
- 2023QMoE: Practical Sub-1-Bit Compression of Trillion-Parameter Models25 Oct
- 2023Merging Experts into One: Improving Computational Efficiency of Mixture of Experts15 Oct
- 2022Sparse Upcycling: Training Mixture-of-Experts from Dense Checkpoints9 Dec
Other references · 79
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
- 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,695
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2023Toolformer: Language Models Can Teach Themselves to Use Toolscited by 4,182
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2016Learning without Forgettingcited by 2,496
- 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,333
38 more
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,986
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2020GLU Variants Improve Transformercited by 1,804
- 2023MemGPT: Towards LLMs as Operating Systemscited by 1,389
- 2016Progressive Neural Networkscited by 1,361
- 2016HyperNetworkscited by 1,027
- 2021An Explanation of In-context Learning as Implicit Bayesian Inferencecited by 938
- 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 896
- 2019Generalization through Memorization: Nearest Neighbor Language Modelscited by 800
- 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 671
- 2019Three scenarios for continual learningcited by 614
- 2025Kimi K2: Open Agentic Intelligencecited by 567
- 2018Progress & Compress: A scalable framework for continual learningcited by 520
- 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 502
- 2024Learning to (Learn at Test Time): RNNs with Expressive Hidden Statescited by 355
- 2017Variational Continual Learningcited by 339
- 2024Titans: Learning to Memorize at Test Timecited by 328
- 2023Orthogonal Subspace Learning for Language Model Continual Learningcited by 312
- 2022Unified Scaling Laws for Routed Language Modelscited by 253
- 2018Online Structured Laplace Approximations For Overcoming Catastrophic Forgettingcited by 201
- 2022Will we run out of data? Limits of LLM scaling based on human-generated datacited by 195
- 2016Structured Inference Networks for Nonlinear State Space Modelscited by 182
- 2024Mixture of LoRA Expertscited by 181
- 2016Using Fast Weights to Attend to the Recent Pastcited by 170
- 2015Conditional Computation in Neural Networks for faster modelscited by 167
- 2015Deep Kalman Filterscited by 166
- 2016Deep Variational Bayes Filters: Unsupervised Learning of State Space Models from Raw Datacited by 156
- 2023Pushing Mixture of Experts to the Limit: Extremely Parameter Efficient MoE for Instruction Tuningcited by 150
- 2024Continual Learning for Large Language Models: A Surveycited by 147
- 2024MixLoRA: Enhancing Large Language Models Fine-Tuning with LoRA-based Mixture of Expertscited by 147
- 2024Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Lawscited by 144
- 2019Large Memory Layers with Product Keyscited by 124
- 2023Bayesian Low-rank Adaptation for Large Language Modelscited by 115
- 2017A Disentangled Recognition and Nonlinear Dynamics Model for Unsupervised Learningcited by 107
- 2024The Surprising Effectiveness of Test-Time Training for Few-Shot Learningcited by 96
- 2018Iterative Amortized Inferencecited by 94
- 2023Fast Inference of Mixture-of-Experts Language Models with Offloadingcited by 91
50 most cited of 79 All 79 (JSON)
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024Toward Inference-optimal Mixture-of-Expert Large Language Models
- 2024LLaMA-MoE: Building Mixture-of-Experts from LLaMA with Continual Pre-training
- 2025Mixture-of-Experts Can Surpass Dense LLMs Under Strictly Equal Resource
- 2025dots.llm1 Technical Report
- 2025Beyond Sunk Costs: Boosting LLM Pre-training Efficiency via Orthogonal Growth of Mixture-of-Experts
- 2026How to Scale Mixture-of-Experts: From muP to the Maximally Scale-Stable Parameterization
- 2025Towards Greater Leverage: Scaling Laws for Efficient Mixture-of-Experts Language Models
- 2025L-MoE: End-to-End Training of a Lightweight Mixture of Low-Rank Adaptation Experts