Analyzes adversarial weaknesses of World-Action Models (WAMs) via BadWAM, a framework that crafts visual perturbations to decouple a model’s imagined future from its executed actions. Introduces two attack modes—action-only (disruptive) and imagination-preserving (stealthy)—and shows large drops in closed-loop task success (e.g., 96.5%→43.1%).
Enables RL post-training with million-token prompts under a fixed GPU budget by evaluating shared prompt state without autograd, retaining only minimal model state, and replaying short response branches; instantiated as GRPO and demonstrated on Qwen3.6-27B and GLM-5.2 up to multi-million token execution.
A PyTorch-native training framework for agentic reinforcement learning research that keeps researcher-facing code compact and editable. Uses an asynchronous loop to train multimodal and mixture-of-experts policies while never training on tokens the agent didn't generate; matches Megatron-style stacks under a comparable protocol and ships recipes and containers on GitHub.
Provides a unified survey of progress-reward modeling for robotic learning, detailing interfaces, modeling techniques, and evaluation practices. Organizes the literature into three perspectives—interface, model internals, and data/benchmarks—and highlights limitations and open problems. Useful for researchers designing rewards for long-horizon or sparse-reward robotic tasks.
Presents Skill Self-Play (Skill-SP), a co-evolutionary training loop where a proposer, solver, and dynamic skill controller generate, solve, and verify tasks conditioned on reusable skills — balancing verifiable execution with open-ended task diversity to boost LLM tool-use and reasoning.
Transforms open-ended LLM optimization into self-verifiable reinforcement learning by turning tasks into proxy environments that produce deterministic, rule-based rewards. Proposes RLSVR and SpyRL — an information-asymmetric self-play scheme where agents vote to identify a preassigned spy, yielding verifiable rewards without human annotation. Demonstrated on summarization, creative writing and mathematical reasoning.
Enables tactile-aware robot manipulation by pretraining a vision–tactile–language–action foundation model and improving offline policies with ALTER. Combines large-scale NeoData visuo-tactile pretraining, a latent tactile pathway for predictive touch signals, and advantage‑conditioned offline RL for contact-rich tasks.
Bridges the proprietary-to-open-source gap in agentic search by converting multi-step retrieval and reasoning traces into a structured, style-normalized JSON protocol and using it for joint distillation + RL. Produces denser supervision that improves student success rates while reducing style drift.
Provides a portable, robot-free UMI capture pipeline and shows that policies post-trained only on this high-fidelity data deploy directly on real robots matching teleoperation baselines. Capture achieves ~3 mm end-effector accuracy, microsecond sync, ultra-wide FOV, and releases 2,000h HiFi-UMI-2K.
Allocates token-level credit in rubric-conditioned GRPO by counterfactually replaying the same response under rubric and criteria-free prompts, using tokenwise log-likelihood contrasts to compute bounded, response-normalized weights that redistribute GRPO advantages without training an auxiliary scorer.
Regularizes latent world models by replacing the Epps–Pulley Gaussianization objective with a quantile–quantile matching loss that aligns projected latent samples to rank-matched Gaussian quantiles, improving tail correction and planning success via cross-batch ranking.
Evaluates vision-language model judges on computer-using agent (CUA) trajectories to measure verifier reliability. Provides OSReward-Hard and OSReward-Multi challenge sets, the OS-Shepherd-100K reasoning-annotated corpus, and trained OS-Shepherd reward models that match commercial judges at ~30–60× lower cost.