Skip to content

EvoRS: On-Policy Self-Evolution of Reward Systems for Open-Ended Reinforcement Learning

Sep 2026 · 1 citation · 97 references
Computer Science

TL;DR

EvoRS is introduced, a self-evolving RL framework that evolves the reward system from on-policy experience, representing it as an executable Reward-DAG, and is updated from on-policy rollouts and reward traces to maintain train-time reliability.

Abstract

Open-ended reinforcement learning often relies on rubric-based rewards for tasks without directly verifiable answers. Yet the policy and reward system form a dynamic feedback loop: as the policy optimizes the current reward, an initially useful reward system may become unreliable due to reward hacking or reduced response discriminability. The reward system should therefore evolve rather than remain fixed during training. Existing dynamic-rubric methods adapt evaluation criteria, but reward failures can also arise from scoring mechanisms or signal composition. We introduce EvoRS, a self-evolving RL framework that evolves the reward system from on-policy experience, representing it as an executable Reward-DAG. Specifically, an agentic designer updates this system from on-policy rollouts and reward traces to maintain train-time reliability. Across writing and roleplay, EvoRS achieves the best quality under all three judges, outperforming the policy by \(2.107\) and \(4.767\) points, respectively, while reducing reward hacking and coverage failures and preserving reward informativeness. Ablations confirm that a comprehensive fixed reward system cannot remain reliable in open-ended tasks and must evolve throughout training.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

RewardWeaver: Long-Horizon Interactive Learning for Language Agents via Self-Evolving Reward Adaptation

RewardWeaver is introduced, a self-evolving reward adaptation framework for language agents in long-horizon interaction that maintains a validated capability space in which the semantics of admitted Rubrics remain fixed, and closes the loop between policy optimization, task evaluation, failure attribution, and reward a...

Heng-Bo Xiao, Bo-Yao Zhang, Pu-Rui Liu et al. · 0 citations
#machine learning Preprint Sep 2026

Gradients Know What Outcomes Don't: Unlocking Reinforcement Learning for LLM Reasoning with Gradient-Aligned Rewards

Gradient-Aligned Reward (GAR), which operates in the policy's own gradient space: truncated backpropagation through the output projection layer extracts a compact gradient vector for each rollout, and cosine similarity with an expert-anchor gradient yields a dense, reasoning-aware reward with less than 9% wall-clock ov...

Le-Qi Zheng, Jin-Bo Su, Fang Niu et al. · 2 citations
#artificial intelligence Preprint Sep 2026

Beyond Scripted Search: Sample-Efficient Reward Discovery via Agentic Black-box Optimization

An Agentic Reward Black-box Optimization (ARBO) framework is proposed, in which an LLM agent builds the search strategy at run time from an evaluation history maintained as its persistent workspace, which comprises two components: observations maintained by the evaluation oracle and an agent-maintained belief that reco...

Ming-Hao Li, Rui Tan, Rui-Hang Wang · 1 citation
#artificial intelligence Preprint Sep 2026

Demonstration-Free Success-Probability Reward Learning for Generalist Robot Policies

This work introduces eVTA, which learns success probabilities from mixed-quality policy rollouts through temporal-difference-style bootstrapping, without expert demonstrations or intermediate annotations, and introduces RL with Evolving Rewards (RLER), a closed-loop framework that adapts eVTA using newly collected roll...

Duo Wu, Hai-Feng Wang, Rongwei Lu et al. · 1 citation

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.