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

Danqi Chen

COLM 2026×4ICLR 2026推理强化学习与后训练智能体与工具对齐与偏好效率与系统
新星分资深
31
一作贡献0
核心/参与15
方向广度13
合作网络12
0 一作 · 5 篇 · COLM 2026 / ICLR 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

5
作者位次 #3/3COLM 2026Poster· Poster Session 4· Grand Ballroom· #133

Language Models That Think, Chat Better

Adithya Bhaskar · Xi Ye · Danqi Chen

We train "thinking" language models on general ('unverifiable') prompts/tasks

摘要

Reinforcement learning with verifiable rewards (RLVR) trains language models to use long chain-of-thought reasoning (CoT) in domains like mathematics and code with rule-based verifiers. However, long CoT learned through RLVR does not generalize well to open-ended tasks---such as writing essay outlines or making meal plans---where humans reason routinely. This paper establishes the benefits of long CoT for general-purpose chat capabilities and introduces **RL** with **M**odel-rewarded **T**hinking (**RLMT**), which pushes RLVR beyond verifiable domains. Using diverse real-world prompts, RLMT requires LMs to generate long CoT reasoning before responding, and optimizes them with online RL against a preference-based reward model used in RLHF. Across 40 training runs on Llama-3.1-8B and Qwen-2.5-7B (both base and instruct) and multiple optimization algorithms (DPO, PPO, and GRPO), RLMT consistently outperforms standard RLHF pipelines. This includes substantial gains of 3-7 points on three chat benchmarks (AlpacaEval2, WildBench, and ArenaHardV2), along with 1-3 point improvements on other tasks like creative writing and general knowledge. RLMT can also be applied directly to base models without an SFT stage, akin to DeepSeek-R1-Zero. Remarkably, with only 7K prompts, Llama-3.1-8B base trained with our RLMT recipe outperforms Llama-3.1-8B-Instruct post-trained with a complex multi-staged pipeline with 25M+ examples. We close with qualitative and quantitative analyses of how trained models plan their responses. Our results rethink the post-training pipeline and call upon future work to understand and employ thinking more broadly.

强化学习与后训练推理对齐与偏好LLMreasoningthinkingRLOpenReview
作者位次 #4/4COLM 2026Poster· Poster Session 2· Franciscan B· #88

Agentic Aggregation for Parallel Scaling of Long-Horizon Agentic Tasks

Yoonsang Lee · Howard Yen · Xi Ye · Danqi Chen

We propose AggAgent, an aggregation agent that treats parallel long-horizon trajectories as an interactive environment.

摘要

We study parallel test-time scaling for long-horizon agentic tasks such as agentic search and deep research, where multiple rollouts are generated in parallel and aggregated into a final response. While such scaling has proven effective for chain-of-thought reasoning, agentic tasks pose unique challenges: trajectories are long, multi-turn, and tool-augmented, and outputs are often open-ended. Aggregating only final answers discards rich information from trajectories, while concatenating all trajectories exceeds the model’s context window. To address this, we propose AggAgent, an aggregation agent that treats parallel trajectories as an environment. We equip it with lightweight tools to inspect candidate solutions and search across trajectories, enabling it to navigate and synthesize information on demand. Across six benchmarks and three model families (GLM-4.7, Qwen3.5, MiniMaxM2.5), AggAgent outperforms all existing aggregation methods—by up to 5.3% absolute on average and 10.3% on two deep research tasks—while adding minimal overhead, as the aggregation cost remains bounded by a single agentic rollout. Our findings establish agentic aggregation as an effective and cost-efficient approach to parallel test-time scaling.

推理智能体与工具效率与系统long-horizon agenttest-time scalingparallel scalingdeep researchOpenReview
作者位次 #7/8COLM 2026Poster· Poster Session 2· Imperial Ballroom· #20

Lost in the Maze: Overcoming Context Limitations in Long-Horizon Agentic Search

Howard Yen · Yoonsang Lee · Ashwin Paranjape · Mengzhou Xia · Thejas Venkatesh · Jack Hessel · Danqi Chen · Yuhao Zhang

We introduce SLIM, a lightweight framework, for effective agentic search tasks, and an error taxonomy for characterizing long-horizon agentic search frameworks.

摘要

Long-horizon agentic search requires iteratively exploring the web over long trajectories and synthesizing information across many sources, enabling powerful applications like deep research systems. In this work, we show that popular agentic search frameworks struggle to scale to long trajectories primarily due to context limitations—they accumulate long, noisy content, hit context window and tool budgets, or stop early. We therefore introduce SLIM (Simple Lightweight Information Management), a simple framework that separates retrieval into distinct search and browse tools, and periodically summarizes the trajectory, keeping context concise while enabling longer, more focused searches. Across a wide range of long-horizon tasks, SLIM achieves comparable performance at substantially lower cost and far fewer tool calls than strong open-source frameworks with both proprietary and open-weight models, including RL-trained models for deep research. Specifically, with o3 as the base model, SLIM achieves 56% on BrowseComp and 33% on HLE, outperforming all open-source frameworks by 8 and 6 absolute points, respectively, while incurring 4–6x fewer tool calls. With GLM-4.7 Flash, SLIM achieves 10 points improvement over the next best open-source framework, Search-o1, on BrowseComp using a third of the cost. To systematically understand failure modes in long-horizon agentic search, we develop an automated fine-grained trajectory analysis pipeline and error taxonomy, and find that SLIM exhibits significantly fewer hallucinations than prior systems. We hope our analysis framework and simple tool design inform future long-horizon agents.

智能体与工具检索与知识安全search agentscontext managementlong-horizonOpenReview
作者位次 #11/13COLM 2026Poster· Poster Session 4· Imperial Ballroom· #11

Odysseus: Scaling VLMs to 100+ Turn Decision-Making in Games via Reinforcement Learning

Chengshuai Shi · Wenzhe Li · Xinran Liang · Yizhou Lu · Wenjia Yang · Ruirong Feng · Seth Karten · Ziran Yang · Zihan Ding · Gabriel Herbert Sarch · Danqi Chen · Karthik R Narasimhan · Chi Jin

We present Odysseus, an open and practical training framework for building VLM agents in long-horizon decision-making environments.

摘要

Given the rapidly growing capabilities of vision-language models (VLMs), extending them to interactive decision-making tasks such as video games has emerged as a promising frontier. However, existing approaches either rely on large-scale supervised fine-tuning (SFT) on human trajectories or apply reinforcement learning (RL) only in relatively short-horizon settings (typically around 20--30 environment turns). In this work, we study RL-based training of VLMs for long-horizon decision-making in Super Mario Land, a visually grounded environment requiring 100+ turns of interaction with coordinated perception, reasoning, and action. We begin with a systematic investigation of key algorithmic components and propose an adapted variant of PPO with a lightweight turn-level critic, which substantially improves training stability and sample efficiency over critic-free methods such as GRPO and Reinforce++. We further show that pretrained VLMs provide strong action priors, significantly improving sample efficiency during RL training and reducing the need for manual design choices such as action engineering, compared to classical deep RL trained from scratch. Building on these insights, we introduce Odysseus, an open training framework for VLM agents, achieving substantial gains across multiple levels of the game and at least $3\times$ average game progresses than frontier models. Moreover, the trained models exhibit consistent improvements under both in-game and cross-game generalization settings, while maintaining general-domain capabilities. Overall, our results identify key ingredients for making RL stable and effective in long-horizon, multi-modal settings, and provide practical guidance for developing VLMs as embodied agents.

多模态强化学习与后训练推理Reinforcement learning finetuningVision-language modelsEmbodied agentsOpenReview

常见合作者