Extending RLVR to Open-ended Tasks Without Verifiers
Establish effective strategies to extend Reinforcement Learning from Verifiable Rewards (RLVR) to open-ended natural language tasks, such as creative writing and brainstorming, that lack objective ground-truth verifiers, enabling reliable learning despite the absence of verifiable rewards.
References
Extending this success to open-ended tasks (e.g., creative writing, brainstorming) remains an open challenge due to the lack of ground-truth verifiers~\citep{zhang2025auditable, simonds2025self}.
Extending the protocol to partially verifiable domains is open.
Our analysis and experiments are restricted to RLVR on tasks such as mathematical reasoning and code generation; we do not validate the proposed geometry on RLHF, multi-turn agentic decision-making, or open-ended generation, where whether the same properties hold remains open.
Experiments are limited to mathematical reasoning with Qwen3 models and rule-based verifiers, leaving generalization to other domains, model families, and noisy or subjective reward signals untested.