RL training dataset for long-context language-model fine-tuning with ~23K samples and nine reward types, provided in Parquet with bilingual ground-truth and reward metadata for direct RL/bench evaluation.
Combines internalizing general skills with task-specific skill utilization via a difficulty-aware router to improve in-distribution and out-of-distribution performance for agentic RL. Uses privileged distillation for hard tasks and diagnostic probing for easy tasks; evaluated on ALFWorld and WebShop.
Uses search-agent reading traces and tiered distractors to train LLMs for long-context, multi-hop reasoning, and introduces a rubric reward that supervises entity-level steps (applied only to correct finals). Improves evidence-grounded reasoning and resists reward hacking across 4B–30B models.
Proposes TrOPD, a method that restricts token-level on-policy distillation to regions where teacher supervision is reliable to stabilize training under teacher–student distribution mismatch. Adds outlier handling (clipping, masking, forward-KL) and off-policy guidance; shows consistent gains on math reasoning, code generation and general benchmarks.
Analyzes how single-domain RL fine-tuning on LLMs induces cross-domain interference and shows this damage concentrates in a low-dimensional shared conflict subspace; proposes a local perturbation theory and short domain "refresh" procedures that selectively recover earlier domains with minimal collateral loss.
A 20B retrieval subagent trained with reinforcement learning inside a stateful search harness that externalizes recoverable search state (candidate pool, curated evidence, verification records). The harness lets the policy focus on semantic search decisions, improving curated recall and transfer robustness.
Learns fine-grained preferences over sub-trajectories to identify and penalize redundant steps in long chain-of-thoughts, letting models "fold" reasoning chains into concise paths; reports ~56% token reduction on DeepSeek-R1-Distill-Qwen-7B while keeping accuracy.
Trains LLMs with reinforcement learning using a surface chrF reward so models learn to extract and apply linguistic signals from rich context for translating completely unseen languages. Demonstrates better zero-shot translation than in-context learning or supervised fine-tuning, framing outcome-based RL as a meta-skill for language learning from context.
Analyzes the parameter-space geometry of on-policy distillation (OPD) for LLM training, showing OPD updates affect fewer weights, avoid principal directions, and rapidly lock into a low-dimensional update subspace. Compares OPD with supervised fine-tuning (SFT) and reinforcement learning with verifiable rewards (RLVR) and studies implications for optimization and objective mixing.
Models visual preference as distributions over rubric scores and introduces Z-Reward, a teacher–student framework that decouples reasoning-heavy judgment (teacher trained with GDSO) from efficient deployment (student via RISD). Demonstrates higher human-preference accuracy and works as a differentiable reward for text-to-image optimization.
Lets a single LLM simultaneously act as agent and environment to bootstrap co-evolutional training — using state-prediction process rewards (World-In-Agent) and failure-mode retrieval (Agent-In-World) to reshape training data; reports ~4% average benchmark gain.
Shifts branching and credit assignment in agentic RL from coarse units to fine-grained decision points in generated sequences. Uses a Branching Score combining token uncertainty and policy-induced likelihood gains plus procedure-level advantage scaling; improves performance across 13 benchmarks while keeping efficient tool calls.