When you can only reliably detect wrong answers (not confirm right ones), training by suppressing failures works better than rewarding unconfirmed successes—a practical approach for real-world verification constraints.
This paper addresses reinforcement learning when verification is one-sided: you can reliably detect failures but can't confirm successes. The authors propose NOPO, which learns by suppressing known failures rather than rewarding unconfirmed successes, improving code and math generation without complete verification.