Theory says REINFORCE can collapse coverage in LM post-training
Resetting the KL reference in Approximate Policy Mirror Descent is shown to restore global convergence for stylized PPO and GRPO.
18 stories, newest first · one card per story
Resetting the KL reference in Approximate Policy Mirror Descent is shown to restore global convergence for stylized PPO and GRPO.
The method uses one convex regression per layer and has sample dependence of order epsilon to the minus two.
CAT-CCB and CAT-CMDP use causal transportability and pessimistic optimization, with finite-sample suboptimality bounds.
Authors report about 4 percentage points higher average accuracy than the strongest baseline, with peak memory falling from about 70 GB to 56 GB on Olmo3-7B-Instruct.
ActionOPD distills black-box teacher decisions into Qwen3 agents, gaining 3.3-6.9 points out of distribution.
RSI-Anything uses predictive world models to recursively improve policies across code, GUI, lab, and chemistry tasks.
Relative policy differences, not expert strength alone, determine useful on-policy distillation transfer.
ViSkill stores visual skill cards for VLM agents, reaching 0.89 success and 0.91 with cold-start on grid tasks.
RGPO uses temporary rationale scaffolds to cut reward sparsity in reasoning RL for text and multimodal models.
Paper proves success conditioning converges to optimal policies on broad MDP classes, with O(1/ε^p) iterations for discounted MDPs and O(log(1/ε)) for single-period settings.
DepGPO improves RL for terminal agents by building command dependency graphs from execution traces to assign credit to reads and writes that actually affect task outcomes.
Neighborhood OPSD lifts Qwen3 math scores by routing student prefixes to nearby expert teachers.
PolyOCR introduces multi-scale OCR foundation models and a corrected OCRBench, reporting competitive document and scene-text results.
ReSPO replaces clipping in off-policy RL to fix gradient starvation on reused rollouts for Qwen3.
EvolveTrade lets LLM trading agents self-refine their tool-use policy from realized portfolio feedback, improving Sharpe ratios.
Bellman Policy Optimization, a critic-free RLVR method derived from Policy Mirror Descent, improves LLM mathematical reasoning without intermediate state-value estimation.
Bellman Policy Optimization is a critic-free RLVR method that reformulates Policy Mirror Descent as a trajectory-level objective for LLM reasoning training.
Researchers propose ERPO, enabling test-time reinforcement learning for code generation via probe-executed consensus rewards, rank masking, and entropy regularization.
Today 1.5K readers · 2.4K views · 754 reads · all time 189K views