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

Yoav Artzi

COLM 2026×2ICLR 2026检索与知识推理长上下文与架构效率与系统理论与学习动力学
新星分贡献者
49
一作贡献0
核心/参与15
方向广度13
合作网络9
0 一作 · 3 篇 · COLM 2026 / ICLR 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

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

Co-Evolving Structured Knowledge and Reasoning in Language Models

Ryan Thomas Noonan · Linxi Zhao · Menghan Xu · Akanksha Sarkar · Mihir Mishra · Dongyoung Go · Kilian Q Weinberger · Yoav Artzi · Jennifer J. Sun

We train language models to jointly construct and reason over structured knowledge, leading to more complete and consistent knowledge structures as well as improved compositional factual reasoning and knowledge controllability.

摘要

Retrieval-augmented methods improve factual accuracy by grounding language models in external knowledge, but retrieving over unstructured text often introduces irrelevant context and offers limited control over the retrieved information. Structured knowledge bases offer a more controllable alternative, yet they are expensive to construct and often brittle to reason over. To address these limitations, we propose KBevo: a co-evolving framework that jointly learns to construct a structured knowledge base and reason over it for knowledge-intensive question answering. By optimizing both components end-to-end with QA outcome rewards, our method enables reasoning success to directly improve the quality of the constructed knowledge base. This leads to larger, better-connected knowledge structures with higher answer reachability, while also improving compositional factual reasoning and controllability compared to standard retrieval baselines.

检索与知识推理长上下文与架构LLMs; Knowledge Retrieval; Multihop ReasoningOpenReview
作者位次 #2/2COLM 2026Poster· Poster Session 6· Imperial Ballroom· #27

Lost in Backpropagation: The LM Head is a Gradient Bottleneck

Nathan Godey · Yoav Artzi

The output layer of neural LMs strongly compress the backpropagation signal, resulting in suboptimal optimization steps that hamper pattern learning and training dynamics.

摘要

The last layer of neural language models (LMs) projects output features of dimension $D$ to logits in dimension $V$, the size of the vocabulary, where usually $D \ll V$. This mismatch is known to raise risks of limited expressivity in neural LMs, creating a so-called softmax bottleneck. We show the softmax bottleneck is not only an expressivity bottleneck but also an optimization bottleneck. Backpropagating $V$-dimensional gradients through a rank-$D$ linear layer induces unavoidable compression, which alters the training feedback provided to the vast majority of the parameters. We present a theoretical analysis of this phenomenon and measure empirically that 95-99\% of the gradient norm is suppressed by the output layer, resulting in vastly suboptimal update directions. We conduct controlled pretraining experiments showing that the gradient bottleneck makes trivial patterns unlearnable, and drastically affects the training dynamics of LLMs. We argue that this inherent flaw contributes to training inefficiencies at scale independently of the model architecture, and raises the need for new LM head designs.

效率与系统理论与学习动力学安全training efficiencyoptimizationsoftmax bottlenecklow-rankOpenReview

常见合作者