arXiv (All)
open access
Reinforcement Learning with Verifiable yet Noisy Rewards under Imperfect Verifiers
Reinforcement Learning with Verifiable Rewards (RLVR) replaces costly human labeling with automated verifiers. To reduce verifier hacking, many RLVR systems binarize rewards to $\{0,1\}$, but imperfect verifiers inevitably introduce \emph{false negatives} (rejecting correct answers) and \emph{false
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Checking the Checkers: A Synthesis of Verifier Noise and Robustness in RLVR#1343030
- Learning to Solve, Forgetting to Retain: Correct-Set Turnover in RLVR#1131563
- Multiscale Reward Hedging from Correct Demonstrations#1077929
- Visual sensitivity is not claim retractability: persistence-aware credit assignment for multimodal reinforcement learning#1131773
- SOAR: Source-Aware Reinforcement Learning with Precise Credit Assignment for Search Agents#1297509
Record · ID 1201921
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive