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

Kazuki Egashira

COLM 2026×2ICLR 2026推理评测与基准强化学习与后训练检索与知识安全
新星分新星
82
一作贡献70
核心/参与5
方向广度13
合作网络6
2 一作 · 3 篇 · COLM 2026 / ICLR 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

3
一作COLM 2026Poster· Poster Session 2· Grand Ballroom· #102

Delay, Plateau, or Collapse: Evaluating the Impact of Systematic Verification Error on RLVR

Kazuki Egashira · Mark Vero · Jasper Dekoninck · Florian E. Dorner · Robin Staab · Martin Vechev

We study the impact of systematic verification errors in RLVR, where outputs with certain properties are consistently assigned incorrect rewards, and show that the result is different from what is previously discussed with randomly noisy verifier.

摘要

Reinforcement Learning with Verifiable Rewards (RLVR) has become a powerful approach for improving the reasoning capabilities of large language models (LLMs). While RLVR is designed for tasks with verifiable ground-truth answers, real-world verifiers (e.g., static code checkers) can introduce errors into the reward signal. Prior analyses have largely treated such errors as random and independent across samples, concluding that errors merely slow training with limited effect on final performance. However, practical verifiers tend to exhibit systematic errors. This introduces a risk of models learning unwanted consistent behavior from a structurally incorrect reward signal. In this work, we study the impact of such systematic verification errors on RLVR. Through controlled experiments on arithmetic tasks, we show that systematic false negatives lead to similar effects as random noise. On the other hand, systematic false positives can cause a wide range of behaviors from sub-optimal plateaus to performance collapse. Crucially, these outcomes are not determined by the overall error rate but by the specific pattern of introduced errors, making pre-hoc mitigation difficult. Our results show that, in contrast to prior conclusions, realistic verification errors can critically shape RLVR outcomes and that verifier quality has to be understood beyond its sample-level error rate.

强化学习与后训练推理评测与基准LLMRLVRverification errorOpenReview 项目页
作者位次 #3/12COLM 2026Poster· Poster Session 4· Imperial Ballroom· #33

WebChoreArena: Evaluating Web Browsing Agents on Realistic Tedious Web Tasks

Atsuyuki Miyai · Zaiying Zhao · Kazuki Egashira · Atsuki Sato · Tatsumi Sunada · Shota Onohara · Hiromasa Yamanishi · Mashiro Toyooka · Kunato Nishina · Ryoma Maeda · Kiyoharu Aizawa · Toshihiko Yamasaki

We propose WebChoreArena, a benchmark of 532 complex and tedious web tasks. State-of-the-art LLM agents show notable performance drops, highlighting their limitations beyond general browsing.

摘要

Powered by large language models (LLMs), web browsing agents operate graphical user interfaces in a human-like manner, offering a transparent and general framework for automating web-based tasks. As these agents rapidly improve and achieve strong performance on existing benchmarks such as WebArena, a key question arises: $\textit{Can current benchmarks still accurately evaluate the capabilities of increasingly powerful agents, especially for more tedious and cognitively demanding tasks?}$ In this paper, we present $\textbf{WebChoreArena}$, a substantial extension of WebArena designed to push beyond general browsing scenarios. WebChoreArena introduces 532 carefully curated tasks developed over 300+ hours, explicitly targeting more labor-intensive and complex web chores. It systematically expands the evaluation space along three critical dimensions: (i) $\textbf{Massive Memory}$, requiring agents to accurately retain and retrieve large amounts of information from observations; (ii) $\textbf{Calculation}$, demanding precise mathematical reasoning over collected information; and (iii) $\textbf{Long-Term Memory}$, necessitating consistent information tracking across multiple webpages. Built directly on top of the four reproducible WebArena environments, WebChoreArena ensures strict compatibility and enables fair, controlled comparisons with prior work. Our experimental results demonstrate that as LLMs evolve, significant performance improvements are observed on WebChoreArena. These findings suggest that WebChoreArena is well-suited to measure the advancement of state-of-the-art LLMs with greater clarity. Nevertheless, the results also indicate that even with GPT-5, there remains substantial room for improvement compared to WebArena, highlighting the increased challenges posed by WebChoreArena.

评测与基准推理检索与知识benchmarkweb browsing agentOpenReview

常见合作者