arXiv AI By Ningyuan Xi, Hao Xu, Hongsheng Xin, Ning Miao

TD-Grokking: Learning from Zero-Reward Problems by Training-Time Decomposition

Read the original on arXiv AI →

arXiv:2606. 09883v1 Announce Type: cross Abstract: Large language models (LLMs) have made remarkable progress in reasoning tasks, largely driven by post-training paradigms, especially reinforcement learning with verifiable rewards (RLVR).

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
6d ago

Verifiable Process Rewards for Agentic Reasoning

The paper introduces Verifiable Process Rewards (VPR), a framework that uses symbolic or algorithmic task-solving oracles as action-level verifiers to provide dense rewards for intermediate actions in agentic reasoning tasks. VPR is applied to Sokoban, Sudoku, and Minesweeper, and improves policy performance over outcome-reward baselines. The authors also demonstrate VPR’s effectiveness in a tool‑use benchmark, highlighting its reliance on reliable task oracles and the difficulty of extending it to less structured environments.

By Huining Yuan, Zelai Xu, Huaijie Wang, Xiangmin Yi, Jiaxuan Gao, Xiao-Ping Zhang, Yu Wang, Chao Yu, Yi Wu
arXiv Machine Learning
Jun 2

Advantage Collapse in Group Relative Policy Optimization: Diagnosis and Mitigation

arXiv:2605. 21125v2 Announce Type: replace Abstract: Group Relative Policy Optimization (GRPO), a prominent algorithm within the Reinforcement Learning from Verifiable Rewards (RLVR) framework, has achieved strong results in improving the reasoning capabilities of large language models (LLMs).

By Xixiang He, Qiyao Sun, Ao Cheng, Xingming Li, Xuanyu Ji, Hailun Lu, Runke Huang, Qingyong Hu
arXiv Computation and Language
Sep 7

ConsensusBench: Benchmark of Consensus Nodes for LLM Reasoning via Outcome Reward Densifying

ConsensusBench is a new dataset that supplies rule‑based process‑level signals for large language model reasoning. It identifies key intermediate conclusions—called Consensus Nodes—by filtering correct trajectories and clustering semantically equivalent statements. By incorporating a process reward derived from these nodes into GRPO‑style reinforcement learning, the authors create ConsensusPR, which reduces reward sparsity and improves performance on benchmarks such as AIME, GSM8K, and MATH‑500.

By Shi-Qi Yan, Chao-Hong Tan, Qian Chen, Wen Wang, Xiangang Li, Zhen-Hua Ling