paper.dinq.meAI 与前沿科学顶会 · 学术新星雷达
登录 DINQ
返回新星榜
RJ

Ronald Guenther Junkins

COLM 2026检索与知识可解释性效率与系统
新星分贡献者
22
一作贡献0
核心/参与5
方向广度6
合作网络3
0 一作 · 1 篇 · COLM 2026

获取完整研究档案

首次获取该候选人的完整档案及 StartLux 评估共 20 积分;每位用户单独解锁,之后查看免费。主动刷新 20 积分。

联系方式

实时查找电子邮箱,费用不超过20积分;未找到邮箱不扣费。

2026 顶会论文

1
作者位次 #3/8COLM 2026Poster· Poster Session 3· Grand Ballroom· #117

MLPs are Hebbians: Constructing Efficient Fact-Storing MLPs for Transformers

Roberto Garcia · Jerry Weihong Liu · Ronald Guenther Junkins · Owen M Dugan · Dylan Zinsley · Sabri Eyuboglu · Atri Rudra · Christopher Re

This work shows how to build closed-form MLP memories that store facts at near-optimal scaling, work under realistic embedding geometries, and can actually plug into Transformers for robust recall and modular fact editing.

摘要

Large language models (LLMs) store factual knowledge in their parameters, yet the underlying mechanism remains unclear. Recent work has found that factual knowledge resides in LLM MLPs as key-value mappings and has provided closed-form fact-storing MLP constructions. However, existing constructive and mechanistic interpretability approaches fail to capture three empirically observed properties of MLPs in LLMs: optimal fact-storage capacity scaling, ability to handle arbitrary embedding geometries, and usability within Transformer blocks. Towards understanding fact-storage in LLMs, we analyze the decoding margin of MLPs, whereas prior work only studies MLP fact storage. Our analysis allows us to develop the first closed-form MLP construction that realizes all three properties. Under isotropic embeddings, our construction achieves optimal storage capacity scaling, reducing the capacity gap to trained MLPs by 8-16x over prior constructions. Further, our theoretical margin scaling bounds precisely characterize how embedding geometry governs empirical margin (R^2 > 0.95) and illustrate our construction’s ability to store fact-sets under arbitrary embedding geometries. Moreover, we show that MLPs can be used within Transformer blocks for factual recall tasks at optimal capacity scaling, reducing the capacity gap to trained MLPs by up to 100x over prior constructions. Finally, as a proof-of-concept, we show that fact-storing MLPs enable modular fact editing by swapping a Transformer's MLP with a new one.

检索与知识可解释性效率与系统fact storagelarge language modelsassociative memoryTransformersOpenReview

常见合作者