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

Ruslan Salakhutdinov

COLM 2026×3CVPR 2026ECCV 2026推理智能体与工具多模态可解释性对齐与偏好
新星分资深
33
一作贡献0
核心/参与15
方向广度16
合作网络12
0 一作 · 5 篇 · COLM 2026 / CVPR 2026 / ECCV 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

5
作者位次 #14/16COLM 2026Poster· Poster Session 1· Grand Ballroom· #126

Scaling Test-Time Compute for Agentic Coding

Joongwon Kim · Wannan Yang · Kelvin Niu · Hongming Zhang · Yun Zhu · Eryk Helenowski · Ruan Silva · Zhengxing Chen · Srini Iyer · Manzil Zaheer · Daniel Fried · Hannaneh Hajishirzi · Sanjeev Arora · Ruslan Salakhutdinov · Gabriel Synnaeve · Anirudh Goyal

We develop an inference-time scaling method for agentic coding by applying compact representations of agentic rollouts to parallel selection and sequential reuse, yielding improvements in SWE-Bench Verified and Terminal-Bench across frontier models.

摘要

Test-time scaling has emerged as a powerful way to improve LLMs. However, existing methods are best suited to short, bounded outputs that can be directly compared, ranked or refined. Long-horizon coding agents violate this premise: each attempt produces an extended trajectory of actions, observations, errors, and partial progress taken by the agent. In this setting, the main challenge is no longer generating more attempts, but representing prior experience in a form that can be effectively selected from and reused. We propose a test-time scaling framework for agentic coding based on compact representations of rollout trajectories. Our framework converts each rollout into a structured summary that preserves its salient hypotheses, progress, and failure modes while discarding low-signal trace details. These representations enable two complementary forms of scaling. For parallel scaling, we introduce Recursive Tournament Voting (RTV), which recursively narrows a population of rollout summaries through small-group comparisons. For sequential scaling, we adapt Parallel-Distill-Refine (PDR) to condition new rollouts on summaries of prior attempts. Our method consistently improves the performance of frontier coding agents across SWE-Bench Verified and Terminal-Bench v2.0. For example, by using our method Claude 4.5 Opus improves from 70.9% to 77.6% on SWE-Bench Verified (mini-SWE-agent) and 46.9% to 59.1% on Terminal-Bench v2.0 (Terminus 1). Our results suggest that test-time scaling for long-horizon agents is fundamentally a problem of representation, selection, and reuse.

推理智能体与工具可解释性agentsinference-time scalingagentic codingreasoningOpenReview
作者位次 #6/6COLM 2026Poster· Poster Session 3· Franciscan B· #81

iOSWorld: A Realistic iOS Environment for Benchmarking Phone Agents with Personalized User Identity and Memory

Lawrence Keunho Jang · Mareks Woodside · Geronimo Carom · Andrew Keunwoo Jang · Jing Yu Koh · Ruslan Salakhutdinov

We build a realistic iOS environment with 26 apps and a rich user identity to benchmark phone agents across 120+ tasks requiring cross-app memory and preference discovery, comparing vision-only, XML-augmented, and leading CUA frameworks.

摘要

A useful phone agent needs to be personally intelligent. It should reason over a user’s identity, history, and preferences as they exist on the device, not just follow isolated instructions in an impersonal sandbox. Existing mobile agent benchmarks lack this kind of personalization. We introduce iOSWorld, the first interactive native iOS simulator benchmark built around a persistent user identity spanning 26 newly built iOS apps. These apps form a controlled ecosystem for one synthetic user, with connected transactions, messages, travel records, social relationships, and financial activity. iOSWorld includes 133 tasks across three increasingly difficult categories. Single-app tasks (27) test one app, multi-app tasks (60) span 2 to 8 apps, and memory and personalization tasks (46) require agents to infer patterns from personal data. We evaluate frontier and open-source computer-use models in both vision-only and privileged vision+XML settings. The best configuration reaches 52% overall but only 37% on multi-app tasks. Privileged vision+XML access improves frontier models by up to 26 percentage points, while smaller models do not benefit from added accessibility-tree input. We release iOSWorld as an open-source benchmark with all apps, seeded data, tasks, rubrics, and evaluation code at https://iosworld.io.

智能体与工具对齐与偏好多模态LLM AgentsMobile Device AgentsMultimodal AgentsOpenReview
作者位次 #4/4COLM 2026Poster· Poster Session 6· Imperial Ballroom· #46

Odysseys: Benchmarking Web Agents on Realistic Long Horizon Tasks

Lawrence Keunho Jang · Jing Yu Koh · Daniel Fried · Ruslan Salakhutdinov

Odysseys is a benchmark of long-horizon web tasks derived from real user browsing behavior, evaluated with rubric-based metrics that align well with human judgement; the best frontier models achieve ~53% success rates (6% on the hardest tasks).

摘要

Existing web agent benchmarks have largely converged on short, single-site tasks that frontier models are approaching saturation on. However, real-world web use consists of long-horizon, multi-site workflows. Common web navigation tasks, such as comparing products across different domains, planning trips across multiple services, or summarizing information from multiple search queries, require sustained context and cross-site reasoning over potentially hours of browsing. To capture and evaluate such behaviors, we introduce Odysseys: a benchmark of 200 long-horizon web tasks derived from real world browsing sessions evaluated on the live Internet. We find that binary pass/fail evaluation is inadequate for long-horizon settings and introduce a rubric-based evaluation, annotating each Odysseys task with an average of 6.1 graded rubrics. We demonstrate that this yields higher agreement with humans and provides a more fine-grained signal than commonly used trajectory-level LLM-as-a-judge evaluation metrics. We tested several leading frontier models and find that the strongest models achieve a success rate of 44.5%, which leaves substantial room for future improvements. Beyond task success, we argue that efficiency is a first-class concern for long-horizon agents. We introduce a Trajectory Efficiency metric (rubric score[object Object] per step) and find that even frontier agents achieve only 1.15%, marking an evident need for agents that can succeed efficiently and not simply eventually. Odysseys isolates the critical evaluation of long-horizon proficiency in open-web environments, providing a realistic benchmark to measure progress towards computer-use agents that can potentially productively operate for hours. We release our tasks, evaluation scripts, and other results at https://odysseysbench.com.

评测与基准智能体与工具推理LLM AgentsMultimodal AgentsComputer Use AgentsOpenReview

常见合作者