rlvr

Tag

Cards List
#rlvr

Bellman Policy Optimization

Hugging Face Daily Papers ↗ · 2026-09-14 Cached

Bellman Policy Optimization (BPO) is a critic-free reinforcement learning method that reformulates Policy Mirror Descent using the Bellman equation for autoregressive generation with terminal rewards, improving mathematical reasoning in large language models.

0 favorites 0 likes
#rlvr

Fork Where the Model Changes Its Mind: Belief-Shift Branching for Tree-Structured Reinforcement Learning

arXiv cs.AI ↗ · 2026-09-12 Cached

The paper proposes belief-shift branching for tree-structured reinforcement learning to enhance step-level credit assignment, demonstrating improved performance in mathematical and coding benchmarks.

0 favorites 0 likes
#rlvr

Difficulty-Adaptive Tree-Structured Policy Optimization for Expanding Reasoning Coverage in RLVR

Hugging Face Daily Papers ↗ · 2026-09-08 Cached

The paper proposes DATPO, a difficulty-adaptive tree-structured policy optimization method that enhances reasoning coverage in large models through sentence-entropy-guided branching and diversity-aware optimization, outperforming baselines in pass@k metrics.

0 favorites 0 likes
#rlvr

DataFlex-RL: An Evaluation Platform for RLVR Data Policies

Hugging Face Daily Papers ↗ · 2026-09-05 Cached

DataFlex-RL is an evaluation platform for RLVR data policies that finds uniform sampling performs comparably to adaptive methods across mathematics, logic, and science benchmarks.

0 favorites 0 likes
#rlvr

DE-Venus: A Data-Efficient RLVR Framework for Large Language Models

arXiv cs.LG ↗ · 2026-09-04 Cached

DE-Venus is a unified framework for data-efficient Reinforcement Learning with Verifiable Rewards in large language models, reducing annotation and training costs while maintaining performance.

0 favorites 0 likes
#rlvr

Group Adaptive Clipping Policy Optimization

arXiv cs.LG ↗ · 2026-09-02 Cached

The paper proposes Group Adaptive Clustering Policy Optimization (GAPO), a plug-in modification to GRPO methods that adapts the clipping boundary to rollout advantage, improving Pass@1 and Pass@k on math reasoning and coding benchmarks.

0 favorites 0 likes
#rlvr

Cliff: Learning Process Rewards from the First Mistake

Hugging Face Daily Papers ↗ · 2026-09-02 Cached

Cliff improves reinforcement learning with verifiable rewards by using an off-the-shelf LLM to detect the first reasoning mistake and shape token-level advantages, leading to consistent performance gains over existing methods.

0 favorites 0 likes
#rlvr

Locked at the Entrance, Open Inside: Where RLVR Narrows the Solution Space

arXiv cs.LG ↗ · 2026-09-01 Cached

This paper investigates how reinforcement learning with verifiable rewards (RLVR) narrows the solution space in LLM reasoning by analyzing where diversity is lost, finding it concentrated at the 'entrance' of trajectories. It demonstrates interventions to recover breadth without compromising accuracy.

0 favorites 0 likes
#rlvr

Putting Task Expertise into RL Achieves State-of-the-Art Performance on Text-to-SQL (18 minute read)

TLDR AI ↗ · 2026-08-28 Cached

The article describes a reinforcement learning method with verifiable rewards to fine-tune AI models for text-to-SQL, achieving human-level accuracy on the BIRD benchmark without scaffolding.

0 favorites 0 likes
#rlvr

Contrastive Branch Policy Optimization

arXiv cs.LG ↗ · 2026-08-26 Cached

CBPO introduces a contrastive branch policy optimization method for fine-grained credit assignment in reinforcement learning with verifiable rewards, enhancing language model performance in tool-integrated reasoning tasks across multiple benchmarks.

0 favorites 0 likes
#rlvr

Continual Reasoning Gym: Diagnosing and Harnessing Shared Reasoning in Continual RLVR

arXiv cs.LG ↗ · 2026-08-20 Cached

The paper introduces Continual Reasoning Gym to diagnose and improve continual reinforcement learning with verifiable rewards (RLVR), proposing Continual Prompt Replay (CPR) to harness shared reasoning structures and achieve multitask-level performance.

0 favorites 0 likes
#rlvr

PAIR: Pairwise-Aware Inclusion Reweighting for Adaptive Rollout Allocation in RLVR

arXiv cs.LG ↗ · 2026-08-13 Cached

This paper introduces PAIR, a pairwise-aware inclusion reweighting method for adaptive rollout allocation in RLVR, improving sample efficiency and accuracy over pointwise allocators by correcting biases in pairwise gradient estimation.

0 favorites 0 likes
#rlvr

Now we have a timeline of the OpenAI accidental attack against Hugging Face

Simon Willison's Blog ↗ · 2026-08-08 Cached

Simon Willison analyzes the timeline of OpenAI's accidental attack on Hugging Face, suggesting that RLVR training of a new model explains the lack of safety behaviors and lax monitoring.

0 favorites 0 likes
#rlvr

Fable, GPT-5.6 and other frontier models are assholes. Here's why.

Reddit r/artificial ↗ · 2026-08-04

Explains why frontier AI models often behave rudely or disobediently, citing former Meta engineer Kun Chen on RLHF and RLVR training that optimizes for task success over human-friendly communication.

0 favorites 0 likes
#rlvr

Distill Where You Fail: Recovering Learning Signals of Negative RL-Groups from Adaptive Teacher Guidance

arXiv cs.CL ↗ · 2026-08-04 Cached

This paper introduces RSTG, a method that selectively applies on-policy distillation to recover learning signals from zero-variance GRPO groups during LLM post-training, achieving substantial gains on math and code reasoning benchmarks.

0 favorites 0 likes
#rlvr

Verifier-Induced Support Reshaping in On-Policy Optimization

arXiv cs.LG ↗ · 2026-08-04 Cached

The paper introduces verifier-induced support reshaping, showing that on-policy RL with verifiable rewards can improve the current objective while making successful behaviors for later objectives too rare to sample. Experiments across math reasoning and instruction following demonstrate that endpoint improvements do not guarantee future trainability.

0 favorites 0 likes
#rlvr

From RLVR to RLSVR (GitHub Repo)

TLDR AI ↗ · 2026-08-04 Cached

Introduces RLSVR, a task-transformation paradigm that extends RLVR to open-ended tasks via self-verifiable rewards from self-play games, instantiated in SpyRL and Vision-Zero. It improves LLM performance on summarization, creative writing, and math reasoning.

0 favorites 0 likes
#rlvr

@vintcessun: The hardest problems are the ones models can't learn? GRPO's dead zone is right here: when all rollouts in a group are wrong, group-wise advantage goes to zero, and gradients vanish too. https://arxiv.org/abs/2607.27787 LSPO temporarily attaches LoRA to these "cliff problems": briefly SFT with standard derivations, ...

X AI KOLs Timeline ↗ · 2026-08-03 Cached

This paper proposes LSPO (LoRA Scaffolded Policy Optimization) to solve the vanishing-gradient problem of GRPO on zero-reward "cliff problems": a temporary LoRA adapter is used for a short SFT, successful trajectories are sampled, corrected via importance sampling, and then fed back into the RL batch; ultimately, only the base model is updated. Experiments on DeepMath-103K show it outperforms the DAPO baseline by an average of 3.8 points.

0 favorites 0 likes
#rlvr

LEEPS: Latent-Guided Explore-Exploit Prompt Sampling for Efficient RLVR in Large Language Models

arXiv cs.CL ↗ · 2026-07-31 Cached

This paper introduces LEEPS, a latent-guided explore-exploit prompt sampler for efficient reinforcement learning with verifiable rewards (RLVR) in LLMs. It adaptively balances reuse of informative prompts and exploration of uncertain ones, improving reasoning benchmark scores by 2.6-3.7% over baselines while adding only ~2 seconds of overhead per training step.

0 favorites 0 likes
#rlvr

SAF-OPD: Stable Advantage Fusion for On-Policy Distillation

Hugging Face Daily Papers ↗ · 2026-07-31 Cached

SAF-OPD introduces a Stable Advantage Fusion framework that combines RLVR with on-policy distillation, addressing magnitude and temporal mismatches to improve training stability and performance on math and code benchmarks.

0 favorites 0 likes
← Previous
Next →
← Back to home

Submit Feedback