提出无限参数LLM架构,可实时生成权重适应新数据
Infinite-Parameter LLMs: Generating and Adapting Weights from Live Data
这个研究挺有意思的,作者想解决传统LLM在运行时无法学习新知识的问题,提出的无限参数架构挺有创意,通过实时生成权重来适应新数据,比单纯用提示词或检索的方法可能更高效。
这篇论文提出了一种名为 Infinite-Parameter LLM 的新架构,它借鉴了 Mixture-of-Experts (MoE) 的思想。该模型通过一个紧凑的超网络,将运行时提供的数据转化为对共享基础网络的低秩调制,从而让模型的权重能够从实时数据中动态生成,而不是存储在固定的参数库中。与以往的方法不同,这种方法在会话过程中持续更新生成器的潜在代码的贝叶斯信念,使得权重在会话期间不断重新推导,而非在读取一次后固定。这样,虽然存储的模型大小保持不变,但模型能够编译的权重实际上是无限的。这种方法将运行时提供的事实和修正直接写入权重,而不是放在提示中,从而在计算上更高效,释放了上下文窗口,知识可以跨回合持久化,并且比上下文学习有更好的泛化能力。
Infinite-Parameter LLMs: Generating and Adapting Weights from Live Data
The scaling laws hold that a language model grows more capable with more parameters and more training data, and Mixture-of-Experts (MoE) architectures have ridden these laws to remarkable results, activating only a fraction of an enormous stored parameter bank for each token. That success is built on static pretraining data. A deployed model faces a different world, where much of the data that would make it more useful is not in its training set but in the live interaction it is currently handling, such as the facts a user supplies or the corrections they give. A conventional model cannot learn from this data, because its weights are frozen after training. Instead, the knowledge and behaviour supplied at run time are placed in the prompt, by retrieval or instruction, and re-read on every request only to be discarded once the request ends. We ask how an architecture could learn from live interaction by writing it into its weights. Taking inspiration from MoE, we propose the \textbf{Infinite-Parameter LLM}. A compact hypernetwork turns the data given at run time into a low-rank modulation of a shared base network, so the feed-forward weights are generated from live data rather than stored in a fixed bank. Where prior weight generators read the context once and freeze, we carry a Bayesian belief over the generator's latent code and update it online, so the effective weight is re-derived from that evolving belief as the session proceeds rather than fixed after one read. The stored footprint stays fixed, yet the weights the model can compile are effectively infinite. For the knowledge and behaviour supplied at run time, carrying them in the weights rather than the prompt is amortized in compute, frees the context window, persists across turns, and can generalise better than in-context use. We specify an evaluation protocol that tests exactly this against in-context learning and retrieval.