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

E. Kelly Buchanan

COLM 2026×2长上下文与架构效率与系统检索与知识数据与预训练推理
新星分贡献者
38
一作贡献0
核心/参与10
方向广度10
合作网络6
0 一作 · 2 篇 · COLM 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

2
作者位次 #4/6COLM 2026Poster· Poster Session 2· Grand Ballroom· #136

Switching Linear Attention

Hyun Dong Lee · Xavier Gonzalez · Nicolas Zucchet · E. Kelly Buchanan · Emily Fox · Scott Linderman

We propose Switching Linear Attention, a sequence layer that uses a mixture of linear regressors to form an expressive retrieval map while retaining, as in linear attention, a recurrent state whose size is independent of sequence length.

摘要

Designing expressive sequence layers with efficient inference remains a central challenge in modern machine learning. Standard softmax attention achieves excellent sequence modeling performance through rich nonlinear token interactions, but it requires a key-value cache that grows linearly with sequence length, limiting its scalability. Linear attention enables efficient recurrent computation with a constant memory footprint, yet its reduced expressivity often yields inferior modeling performance. We introduce Switching Linear Attention (SwiLA), a novel sequence layer that bridges this gap by enhancing representational capacity while retaining the fixed-size recurrent state of linear attention. We derive the SwiLA recurrence from the test-time regression framework, casting the state update rule as online expectation-maximization in a mixture of linear regressions model. At test time, each output dimension dynamically selects among multiple linear attention components based on the input. Across associative recall, in-context language learning, and language modeling benchmarks, SwiLA shows strong performance and narrows the gap to softmax attention, even surpassing it in several settings.

长上下文与架构效率与系统检索与知识recurrent architecturesequence modelingtest-time regressionmixture modelOpenReview
作者位次 #8/10COLM 2026Poster· Poster Session 2· Franciscan B· #90

Test-Time Scaling Makes Overtraining Compute-Optimal

Nicholas Roberts · Sungjun Cho · Zhiqi Gao · Tzu-Heng Huang · Albert Wu · Gabriel Orlanski · Avi Trost · E. Kelly Buchanan · Aws Albarghouthi · Frederic Sala

We show that test-time scaling via repeated sampling shifts Chinchilla scaling towards much smaller, more overtrained models.

摘要

Modern LLMs scale at test-time, e.g. via repeated sampling, where inference cost grows with model size and the number of samples. This creates a trade-off that pretraining scaling laws, such as Chinchilla, do not address. We present Train-to-Test ($T^2$) scaling laws that jointly optimize model size, training tokens, and number of inference samples under fixed end-to-end budgets. $T^2$ modernizes pretraining scaling laws with pass@$k$ modeling used for test-time scaling, then jointly optimizes pretraining and test-time decisions. Forecasts from $T^2$ are robust over distinct modeling approaches: measuring joint scaling effect on the task loss and modeling impact on task accuracy. Across eight downstream tasks, we find that when accounting for inference cost, optimal pretraining decisions shift radically into the overtraining regime, well-outside of the range of standard pretraining scaling suites. We validate our results by pretraining heavily overtrained models in the optimal region that $T^2$ scaling forecasts, confirming their substantially stronger performance compared to pretraining scaling alone. Finally, as frontier LLMs are post-trained, we show that our findings survive the post-training stage, making $T^2$ scaling meaningful in modern deployments.

数据与预训练推理强化学习与后训练Test-Time ScalingScaling LawsPretrainingOpenReview

常见合作者