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

Yuval Reif

ACL 2026×2COLM 2026×2可解释性效率与系统数据与预训练检索与知识强化学习与后训练
新星分新星
85
一作贡献70
核心/参与10
方向广度13
合作网络12
2 一作 · 4 篇 · ACL 2026 / COLM 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

4
一作COLM 2026Poster· Poster Session 5· Grand Ballroom· #126

More Than Words: Compositional Tokenization for Efficient Language Models

Yuval Reif · Guy Kaplan · Roy Schwartz

Why do we choose to represent language as a flat 1D token sequence? In CoBPE, we attach function words and punctuation to lexical base tokens via embedding-space modifiers, cutting sequence length by 30% and enabling faster LLM training and inference

摘要

Language models process and generate text sequentially in token units, and the tokenizer determines how much text each inference step covers. Under standard tokenization, a short English phrase such as "On the table." is usually produced as four separate predictions for the preposition (On), article (the), noun (table), and punctuation (.), where each consumes a sequence position and adds inference cost. We introduce CoBPE, a compositional tokenization approach that represents such phrases as a lexical base token (table) attached with a small set of reusable surface modifiers, composed in embedding space at input and predicted jointly at output. In controlled pretraining from scratch at 780M and 1.3B scales, CoBPE shortens sequences by 30% and improves average downstream performance by 1.2 points relative to standard BPE under matched training compute. Our results suggest that part of what is now expressed through token sequences can instead be modeled through structured representations, opening a broad design space for more token-efficient and capable language models.

效率与系统数据与预训练可解释性tokenizationefficiencyBPElanguage modelsOpenReview
作者位次 #4/8COLM 2026Poster· Poster Session 2· Franciscan C· #95

Why Fine-Tuning Encourages Hallucinations and How to Fix It

Guy Kaplan · Zorik Gekhman · Zhen Zhu · Yuval Reif · Lotem Rozner · Swabha Swayamdipta · Derek Hoiem · Roy Schwartz

SFT-induced hallucinations are factual forgetting caused by interference between new and stored entity representations, and self-distillation prevents it.

摘要

Large language models are prone to hallucinating factually incorrect statements. A key source of these errors is exposure to new factual information through supervised fine-tuning (SFT), which can increase hallucinations w.r.t. knowledge acquired during pre-training. Since these errors arise as a by-product of knowledge degradation, we explore whether established continual learning tools can mitigate them. We propose a *self-distillation*–based SFT method that facilitates effective factual learning while minimizing hallucinations w.r.t. pre-existing knowledge by regularizing output-distribution drift. We also show that when new knowledge acquisition is unnecessary, suppressing factual plasticity by freezing parameter groups preserves task performance while reducing hallucinations. Lastly, we investigate the mechanism, contrasting capacity limitations, behavior cloning, and localized interference. Our experiments show that a main driver is interference among overlapping semantic representations, which self-distillation mitigates and an associative-memory model explains: forgetting grows with the overlap between new and stored facts.

检索与知识可解释性强化学习与后训练hallucinationsupervised fine-tuningfactual knowledgecatastrophic forgettingOpenReview
作者位次 #3/5ACL 2026Poster· Natural Language Processing

Follow the Flow: On Information Flow Across Textual Tokens in Text-to-Image Models

Guy Kaplan · Michael Toker · Yuval Reif · Yonatan Belinkov · Roy Schwartz

摘要

Text-to-image generation models suffer from alignment problems, where generated images fail to accurately capture the objects and relations in the text prompt. Prior work has focused on improving alignment by refining the diffusion process, ignoring the role of the text encoder, which guides the...

可解释性多模态对齐与偏好OpenReview 项目页
一作ACL 2026Findings· Findings of ACL

Vocab Diet: Reshaping the Vocabulary of LLM s via Vector Arithmetic

Yuval Reif · Guy Kaplan · Roy Schwartz

摘要

Large language models (LLMs) often encode word-form variation (e.g., walk vs. walk ed ) as linear directions in the embedding space. However, standard tokenization algorithms treat such variants as distinct words with different vocabulary entries—quickly filling the size-capped token vocabulary w...

数据与预训练可解释性效率与系统OpenReview 项目页

常见合作者