Where and What to Reward? Understanding Generalization Between Verifiable and Open-Ended Domains in Reinforcement Learning

arXiv:2605.15464 · cs.LG, cs.AI, cs.CL · Submitted 2026-05-14 · Read on arXiv

cs.LG, cs.AI, cs.CL

Submitted: 2026-05-14

Updated: 2026-10-26

Terminology

• Reinforcement Learning — 4× in this paper · explained in 4 episodes
• RLVR — 3× in this paper · explained in 2 episodes
• Generalization — 2× in this paper · explained in 14 episodes
• Benchmark — 1× in this paper · explained in 2 episodes
• Downstream Tasks — 1× in this paper · explained in 2 episodes
• Reinforcement Learning (RL) — 1× in this paper · explained in 26 episodes
• Verifiable Rewards — 1× in this paper · explained in 2 episodes
• Verifier — 1× in this paper · explained in 2 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks