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

Omar Khattab

COLM 2026×2NeurIPS 2026×2VLDB 2026检索与知识推理代码安全可解释性
新星分贡献者
61
一作贡献0
核心/参与24
方向广度16
合作网络12
0 一作 · 5 篇 · COLM 2026 / NeurIPS 2026 / VLDB 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

5
作者位次 #5/6COLM 2026Poster· Poster Session 3· Grand Ballroom· #123

Meta-Harness: End-to-End Optimization of Model Harnesses

Yoonho Lee · Roshen Sanjay Nair · Qizheng Zhang · Kangwook Lee · Omar Khattab · Chelsea Finn

An agentic loop that searches over harness code for LLM systems.

摘要

The performance of large language model (LLM) systems depends not only on model weights, but also on their harness: the code that determines what information to store, retrieve, and present to the model. Yet harnesses are still designed largely by hand, and existing text optimizers are poorly matched to this setting because they compress feedback too aggressively. We introduce Meta-Harness, an outer-loop system that searches over harness code for LLM applications. It uses an agentic proposer that accesses the source code, scores, and execution traces of all prior candidates through a filesystem. On online text classification, Meta-Harness improves over a state-of-the-art context management system by 7.7 points while using 4x fewer context tokens. On retrieval-augmented math reasoning, a single discovered harness improves accuracy on 200 IMO-level problems by 4.7 points on average across five held-out models. On agentic coding, discovered harnesses surpass the best hand-engineered baselines on TerminalBench-2. Together, these results show that richer access to prior experience can enable automated harness engineering.

代码推理检索与知识agent harnesseslanguage model systemsin-context learningprogram synthesisOpenReview
作者位次 #4/8COLM 2026Poster· Poster Session 3· Imperial Ballroom· #7

Do LLMs Benefit From Their Own Words?

Jenny Y. Huang · Leshem Choshen · Wei Sun · Omar Khattab · Ramón Fernandez Astudillo · Mehul Damani · Tamara Broderick · Jacob Andreas

For multi-turn conversations with LLMs, storing the full conversation history is often unnecessary: most responses can be generated with minimal context, and including prior assistant responses can at times even hurt performance.

摘要

In multi-turn conversations, large language models typically condition on the full conversation history: both past user prompts and assistant responses. We revisit this design choice by comparing full-context prompting to four alternative, substantially-reduced context configurations. Analyzing in-the-wild multi-turn conversations across three open reasoning and one state-of-the-art model, we find that response quality is largely preserved under aggressive context filtering: replacing all prior assistant turns with one-sentence summaries or keeping only the most recent user--assistant exchange often matches storing full context in performance while using roughly 8x less context. To understand this result, we observe that a substantial fraction of user turns (36.4%) in multi-turn conversations are self-contained and that many follow-up turns can be addressed by seeing only the immediately preceding user--assistant exchange. Furthermore, we find that when models condition on their own past responses, this can lead to context pollution, a phenomenon in which reasoning errors, hallucinations, or stylistic artifacts propagate across turns. Motivated by these findings, we design a context-filtering approach that selectively omits the assistant-side history. Taken together, these findings suggest moving away from storing full dialogue transcripts and instead retaining only what is relevant.

检索与知识推理安全Multi-turn ConversationsContext ManagementContext PollutionChat LogsOpenReview
作者位次 #3/3NeurIPS 2026Poster

OBLIQ-Bench: Exposing Overlooked Bottlenecks in Modern Retrievers with Latent and Implicit Queries

Diane Tchuindjo · Devavrat Shah · Omar Khattab

检索与知识OpenReview

常见合作者