Ground Truth.
AI, checked against the source.

AI papers — 2026-05-20

Every paper on Hugging Face's Daily Papers list, most-upvoted first — each linked to arXiv, with a plain-English summary and a technical breakdown underneath.Both are AI-written — the summary from the authors' abstract, the breakdown from the paper's full text — and are not individually fact-checked by us. The paper itself is the source.
← 2026-05-192026-05-202026-05-22 →
Jump to one of 18 papers
  1. Anti-Self-Distillation for Reasoning RL via Pointwise Mutual Information
  2. OpenComputer: Verifiable Software Worlds for Computer-Use Agents
  3. GoLongRL: Capability-Oriented Long Context Reinforcement Learning with Multitask Alignment
  4. Process Rewards with Learned Reliability
  5. AutoResearchClaw: Self-Reinforcing Autonomous Research with Human-AI Collaboration
  6. When Vision Speaks for Sound
  7. EnvFactory: Scaling Tool-Use Agents via Executable Environments Synthesis and Robust RL
  8. CogOmniControl: Reasoning-Driven Controllable Video Generation via Creative Intent Cognition
  9. Active Learners as Efficient PRP Rerankers
  10. Artifact-Bench: Evaluating MLLMs on Detecting and Assessing the Artifacts of AI-Generated Videos
  11. Aurora: Unified Video Editing with a Tool-Using Agent
  12. CEPO: RLVR Self-Distillation using Contrastive Evidence Policy Optimization
  13. MSAVBench: Towards Comprehensive and Reliable Evaluation of Multi-Shot Audio-Video Generation
  14. OmniGUI: Benchmarking GUI Agents in Omni-Modal Smartphone Environments
  15. Video Models Can Reason with Verifiable Rewards
  16. PixVerve: Advancing Native UHR Image Generation to 100MP with a Large-Scale High-Quality Dataset
  17. Semantic Generative Tuning for Unified Multimodal Models
  18. Overcoming Catastrophic Forgetting in Visual Continual Learning with Reinforcement Fine-Tuning

Anti-Self-Distillation for Reasoning RL via Pointwise Mutual Information →

arXiv 2605.11609 · ▲ 46 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Standard on-policy self-distillation for math reasoning RL produces inconsistent gains because the teacher model's privileged context inflates confidence on structural tokens while deflating it on the deliberation tokens that actually enable multi-step reasoning.

Method: Anti-Self-Distillation (AntiSD) inverts the standard KL minimization objective by ascending a divergence between student and teacher distributions, using Pointwise Mutual Information to target deliberation tokens specifically. An entropy-triggered gate disables the divergence term when teacher entropy collapses, preventing degenerate behavior. AntiSD is designed as a drop-in replacement for standard self-distillation within GRPO-style training.

Key results:

  • Reaches GRPO baseline accuracy in 2–10x fewer training steps
  • Up to 11.5 percentage point accuracy improvements over the baseline
  • Validated across five models ranging from 4B to 30B parameters on math reasoning benchmarks

Why it matters / caveats: AntiSD provides a theoretically grounded fix for a subtle failure mode in self-improvement pipelines for reasoning models, with strong efficiency gains. Results are on math reasoning only; generalization to other reasoning domains is not demonstrated.

OpenComputer: Verifiable Software Worlds for Computer-Use Agents →

arXiv 2605.19769 · ▲ 45 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Existing computer-use agent benchmarks lack scalable, auditable verification — relying on brittle heuristics or LLM-as-judge approaches that do not reliably measure fine-grained application state.

Method: OpenComputer integrates four components: app-specific state verifiers that expose structured inspection endpoints over real applications; a self-evolving verification layer that improves verifier reliability via execution-grounded feedback; a task-generation pipeline that synthesizes machine-checkable desktop tasks; and an evaluation harness that records full trajectories and computes auditable partial-credit rewards. The framework currently covers 33 desktop applications and 1,000 finalized tasks across browsers, office suites, creative tools, development environments, file managers, and communication platforms.

Key results:

  • Hard-coded state verifiers outperform LLM-as-judge on fine-grained application state alignment with human adjudication
  • Frontier agents show limited end-to-end task completion despite demonstrating partial progress
  • Open-source models show sharp performance drops compared to their OSWorld-Verified scores, revealing persistent gaps

Why it matters / caveats: OpenComputer addresses a critical infrastructure gap for computer-use agent research by providing ground-truth verifiable rewards at scale. Coverage is currently limited to 33 apps and the self-evolving verifier's long-term reliability is not fully characterized.

GoLongRL: Capability-Oriented Long Context Reinforcement Learning with Multitask Alignment →

arXiv 2605.19577 · ▲ 44 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Existing RLVR approaches for long-context language models focus narrowly on retrieval-heavy tasks and use reward formulations that fail to align across diverse task types, limiting broad long-context capability improvement.

Method: GoLongRL is an open-source post-training framework built on GRPO that introduces TMN-Reweight (Task-level Mean Normalization Reweighting), which applies task-level mean normalization for cross-task reward alignment combined with difficulty-adaptive weighting to stabilize advantage estimation across heterogeneous multitask settings. Training uses a dataset of 23,000 RLVR samples spanning 9 task types, synthesized from books, academic papers, and multi-turn dialogues guided by a long-context capability taxonomy.

Key results:

  • The released dataset alone outperforms the closed-source QwenLong-L1.5 dataset under vanilla GRPO
  • Qwen3-30B-A3B trained with GoLongRL reaches long-context performance comparable to DeepSeek-R1-0528 and Qwen3-235B-A22B-Thinking-2507
  • TMN-Reweight improves over vanilla GRPO while preserving general capabilities

Why it matters / caveats: GoLongRL demonstrates that broad task-type coverage and reward diversity matter more than retrieval-path complexity for long-context RL, and the dataset is open-sourced. The comparisons to very large closed models (235B) with a 30B model are compelling but depend on the specific evaluation suite chosen.

Process Rewards with Learned Reliability →

arXiv 2605.15529 · ▲ 44 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Existing Process Reward Models (PRMs) output single point-estimate rewards per reasoning step, providing no signal about how trustworthy each reward is, which limits their use in adaptive inference-time compute allocation.

Method: BetaPRM replaces point estimation with a Beta-Binomial likelihood model that learns both a step-level success probability and a reliability (uncertainty) estimate from Monte Carlo continuation supervision. The reliability signal then drives Adaptive Computation Allocation (ACA) for Best-of-N reasoning: generation stops early when a high-reward solution is reliable, and extra computation is directed at uncertain candidate prefixes.

Key results:

  • ACA achieves up to 33.57% token usage reduction while improving final-answer accuracy compared to fixed-budget Best-of-16
  • BetaPRM improves PRM-guided Best-of-N selection over point-estimate baselines across four backbones and four reasoning benchmarks
  • Improves the accuracy–token efficiency tradeoff overall

Why it matters / caveats: Learned reliability turns PRMs into adaptive compute routers, directly addressing inference-time efficiency. The method is evaluated on reasoning benchmarks; whether the Beta-Binomial calibration holds under distribution shift to harder domains is not assessed.

AutoResearchClaw: Self-Reinforcing Autonomous Research with Human-AI Collaboration →

arXiv 2605.20025 · ▲ 41 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Existing autonomous research systems cannot iteratively refine hypotheses and accumulate cross-run knowledge the way real research does, limiting their ability to handle multi-cycle scientific discovery.

Method: AutoResearchClaw is a multi-agent pipeline with five mechanisms: structured multi-agent debate for hypothesis generation and analysis; a self-healing executor with Pivot/Refine decision loops that convert execution failures into actionable information; verifiable result reporting to prevent hallucinated results or citations; human-in-the-loop collaboration with seven distinct intervention modes (from full autonomy to step-by-step oversight); and cross-run evolution that converts past failures into safeguards for subsequent runs.

Key results:

  • Outperforms AI Scientist v2 by 54.7% on ARC-Bench (25-topic experiment-stage evaluation)
  • Ablation across 7 collaboration modes shows that targeted human intervention at high-leverage decision points outperforms both full autonomy and exhaustive step-by-step oversight

Why it matters / caveats: The explicit human-AI collaboration framework and cross-run learning move autonomous research closer to iterative scientific practice. ARC-Bench is a new benchmark introduced by the authors, so independent validation is pending.

When Vision Speaks for Sound →

arXiv 2605.16403 · ▲ 40 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Video-capable MLLMs appear to understand audio but actually exploit visual-acoustic correlations without genuinely processing the audio stream — a failure mode the authors term the "audio-visual Clever Hans effect."

Method: The authors introduce Thud, an intervention-driven probing framework applying three counterfactual audio edits: Shift (tests temporal synchronization), Mute (tests sound existence), and Swap (tests audio-visual consistency). A two-stage alignment recipe is then applied: intervention-derived preference pairs teach audio verification, while event-level general video preference pairs regularize against over-specialization.

Key results:

  • 28 percentage point improvement across the three Thud intervention dimensions using a 10K-sample training recipe
  • Slight performance gains also observed on general video and audio-visual QA benchmarks
  • The Clever Hans effect is documented in both leading open-source omni models and closed-source models from Google and OpenAI

Why it matters / caveats: This exposes a fundamental evaluation blind spot in multimodal audio-video understanding and provides a targeted fix. The 10K-sample recipe is relatively small, and whether the gains transfer to real-world audio-visual tasks beyond the three counterfactual interventions is an open question.

EnvFactory: Scaling Tool-Use Agents via Executable Environments Synthesis and Robust RL →

arXiv 2605.18703 · ▲ 36 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Agentic RL for tool-use is bottlenecked by the lack of scalable, robust execution environments and the scarcity of realistic multi-turn training data capturing implicit human reasoning.

Method: EnvFactory automatically explores and verifies stateful tool environments from authentic resources, then synthesizes multi-turn SFT and RL trajectories using topology-aware sampling and calibrated refinement to generate natural, grounded queries with implicit intents rather than over-specified instructions. The framework operates across 85 verified environments spanning 7 domains.

Key results:

  • +15% on BFCLv3 benchmark for Qwen3-series models
  • +8.6% on MCP-Atlas benchmark
  • +6% on conversational benchmarks (τ²-Bench and VitaBench)
  • Achieved using 5x fewer environments than prior work, with only 2,575 SFT and RL trajectories

Why it matters / caveats: EnvFactory shows that automated, topology-aware environment synthesis can outperform larger manually curated pipelines, pointing toward fully automated agentic training infrastructure. Evaluated only on Qwen3-series models; generalization to other model families is not shown.

CogOmniControl: Reasoning-Driven Controllable Video Generation via Creative Intent Cognition →

arXiv 2605.19995 · ▲ 31 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Diffusion-based video generation models fail under abstract, sparse, or complex control conditions (such as storyboard sketches) because they cannot bridge the gap between sparse creative intent and generation-ready conditioning.

Method: CogOmniControl factorizes controllable video generation into two stages. CogVLM, a vision-language model trained on authentic anime production data, interprets sparse creative inputs and performs creative intent cognition. CogOmniDiT, a unified diffusion transformer, takes CogVLM outputs and executes multi-condition video generation via in-context generation, aligned with CogVLM through reinforcement learning. Evaluation uses CogVLM for planning-specific evaluators with Best-of-N selection on two new benchmarks: CogReasonBench and CogControlBench.

Key results:

  • Surpasses existing open-source models on CogReasonBench and CogControlBench (specific numerical margins not reported in abstract)

Why it matters / caveats: The closed-loop architecture connecting a reasoning VLM to a generation model via RL is a principled approach to bridging intent understanding and video synthesis. Quantitative numbers beyond benchmark rankings are not available from the abstract, and both evaluation benchmarks are introduced by the same authors.

Active Learners as Efficient PRP Rerankers →

arXiv 2605.14236 · ▲ 23 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Pairwise Ranking Prompting (PRP) for document reranking produces noisy, order-sensitive, and sometimes intransitive LLM judgments that violate sorting assumptions, reducing ranking quality under LLM call budgets.

Method: The paper reframes PRP as an active learning problem, replacing sorting-based aggregation with active rankers that adaptively select which pairs to compare. A randomized-direction oracle is introduced that converts systematic position bias into unbiased noise using a single LLM call per pair instead of bidirectional calls, enabling noise-robust pairwise aggregation.

Key results:

  • Improved NDCG@10 per LLM call in call-constrained scenarios compared to standard PRP sorting
  • Specific NDCG@10 numbers are not reported in the abstract

Why it matters / caveats: Treating reranking as active learning under noisy comparisons is a principled framework with potential for broad applicability wherever LLM-based pairwise ranking is used. Concrete numerical results on standard BEIR or TREC benchmarks are not surfaced in the abstract.

Artifact-Bench: Evaluating MLLMs on Detecting and Assessing the Artifacts of AI-Generated Videos →

arXiv 2605.18984 · ▲ 21 on Hugging Face · HF page · PDF

Technical breakdown

Problem: There is no systematic benchmark for evaluating multimodal LLMs' ability to detect and assess realism artifacts in AI-generated videos across different synthesis styles (photorealistic, animated, CG).

Method: Artifact-Bench defines a three-level hierarchical taxonomy of realism artifacts covering photorealistic, animated, and CG-style videos, and instantiates three complementary evaluation tasks: real vs. AI-generated video classification, pairwise realism comparison, and fine-grained artifact identification.

Key results:

  • 19 leading MLLMs evaluated
  • Many models show random or below-random performance in challenging settings
  • Substantial misalignment between MLLM judgments and human perceptual preferences across all three tasks

Why it matters / caveats: Artifact-Bench provides a rigorous diagnostic showing that current MLLMs cannot reliably serve as automated quality evaluators for AI-generated video, which is directly relevant to video generation evaluation pipelines. The benchmark itself is the primary contribution; no improved detection model is proposed.

Aurora: Unified Video Editing with a Tool-Using Agent →

arXiv 2605.18748 · ▲ 15 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Real user video editing requests are underspecified — lacking precise text descriptions, reference images, or spatial grounding — making them incompatible with current diffusion model conditioning interfaces.

Method: Aurora pairs a tool-augmented VLM agent with a unified video diffusion transformer. The VLM agent is trained with supervised learning on complete edit planning and reference-image selection tasks, plus preference pairs for robust tool use and instruction refinement. The diffusion transformer uses a unified conditioning design that jointly processes text, source video, and reference images to handle replacement, removal, style transfer, and reference-driven insertion through shared conditioning channels.

Key results:

  • Outperforms instruction-only baselines on AgentEdit-Bench (a new benchmark introduced for this work) and two existing video editing benchmarks
  • The VLM agent transfers successfully to compatible frozen video editing models

Why it matters / caveats: Aurora demonstrates a practical decomposition of the user-intent gap in video editing by pairing a planning agent with a unified generative backbone. AgentEdit-Bench is author-defined; independent benchmark results are limited.

CEPO: RLVR Self-Distillation using Contrastive Evidence Policy Optimization →

arXiv 2605.19436 · ▲ 12 on Hugging Face · HF page · PDF

Technical breakdown

Problem: In RLVR training, all tokens in a correct rollout receive the same reward signal regardless of their contribution to reasoning, causing imprecise credit assignment that wastes training signal on filler tokens.

Method: Contrastive Evidence Policy Optimization (CEPO) uses contrastive analysis between two teacher models — one derived from accepted rollouts and one constructed from rejected rollouts already in the training batch — to identify tokens where the correct answer provides positive evidence versus the wrong answer. This sharpens credit assignment at decisive tokens at no additional sampling cost and inherits structural safety guarantees from the prior state-of-the-art RLVR methods.

Key results:

  • 2B scale: 43.43% average accuracy vs. 41.17% for GRPO baseline on multimodal math reasoning benchmarks
  • 4B scale: 60.56% average accuracy vs. 57.43% for GRPO baseline
  • Distribution-matching self-distillation methods (OPSD, SDPO) fall below the untrained baseline, consistent with theoretical predictions

Why it matters / caveats: CEPO offers a theoretically grounded, zero-overhead improvement to RLVR credit assignment with consistent gains. Evaluated on multimodal mathematical reasoning; broader reasoning tasks remain untested.

MSAVBench: Towards Comprehensive and Reliable Evaluation of Multi-Shot Audio-Video Generation →

arXiv 2605.20183 · ▲ 11 on Hugging Face · HF page · PDF

Technical breakdown

Problem: No existing benchmark comprehensively evaluates multi-shot audio-video generation systems on the combined dimensions of video quality, audio quality, shot coherence, and reference consistency.

Method: MSAVBench is an evaluation framework with an adaptive self-correction mechanism for shot segmentation robustness, instance-wise rubrics for subjective metric assessment, and tool-grounded evidence extraction for complex judgment tasks. The benchmark spans four evaluation dimensions (video, audio, shot, and reference characteristics) and supports up to 15-shot sequences including non-realistic scenarios.

Key results:

  • 91.5% Spearman rank correlation between automated metrics and human judgments
  • 19 state-of-the-art models evaluated (closed- and open-source)
  • Current systems consistently struggle with director-level control and fine-grained audio-visual synchronization
  • Modular and agentic pipelines show promise in narrowing the open/closed-source performance gap

Why it matters / caveats: A 91.5% Spearman correlation is strong evidence that MSAVBench's automated metrics are trustworthy proxies for human preference in this domain. The benchmark focuses on generation evaluation; it does not propose new generation methods.

OmniGUI: Benchmarking GUI Agents in Omni-Modal Smartphone Environments →

arXiv 2605.18758 · ▲ 11 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Existing GUI agent benchmarks rely on static screenshots, failing to evaluate agents that must process synchronized audio cues and video dynamics during smartphone interactions.

Method: OmniGUI provides a step-level evaluation framework built on 709 expert-demonstrated episodes with 2,579 action steps across 29 applications. Each action step is paired with interleaved static images, synchronous audio, and video clips, with systematic annotation of multimodal dependency levels. Evaluation uses foundational omni-modal models as agent proxies.

Key results:

  • Current models perform adequately on visually static tasks but show significant degradation when environments require synchronous temporal and auditory signals
  • Cross-modal interference from task-irrelevant environmental noise identified as a major bottleneck in ablation studies

Why it matters / caveats: OmniGUI fills an important gap by requiring genuine audio-visual temporal reasoning rather than pure screen parsing. The 709-episode dataset is relatively small, and results are currently limited to a narrow set of omni-modal model baselines.

Video Models Can Reason with Verifiable Rewards →

arXiv 2605.15458 · ▲ 8 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Video diffusion models are optimized for perceptual plausibility rather than verifiable rule-consistent reasoning, limiting their use in tasks with explicit spatial, temporal, or logical constraints.

Method: VideoRLVR applies reinforcement learning with verifiable rewards to video diffusion using three components: SDE-GRPO as the optimization backbone for the diffusion model; dense decomposed rewards providing rule-based feedback signals at fine granularity; and an Early-Step Focus strategy that restricts policy optimization to early denoising timesteps. Evaluated on three procedurally generated reasoning domains: Maze, FlowFree, and Sokoban.

Key results:

  • Consistently outperforms supervised fine-tuning baselines across all three domains
  • Early-Step Focus reduces training latency by ~40% while preserving performance
  • Outperforms both proprietary and open-source video generation models on verifiable reasoning benchmarks and out-of-domain evaluations

Why it matters / caveats: VideoRLVR is a notable proof of concept that RL with verifiable rewards can extend to video diffusion models, moving toward task-conditioned video generation with logical guarantees. The evaluation domains (Maze, FlowFree, Sokoban) are synthetic; real-world video reasoning tasks remain untested.

PixVerve: Advancing Native UHR Image Generation to 100MP with a Large-Scale High-Quality Dataset →

arXiv 2605.20147 · ▲ 7 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Native ultra-high-resolution (UHR) text-to-image generation at 100 megapixels is held back by the absence of large-scale high-quality datasets with fine-grained annotations at that resolution.

Method: The paper introduces PixVerve-95K, a curated dataset of 95,000 images each at minimum 100MP with seven-dimensional per-image annotations across diverse scenarios. Multiple T2I foundation models are adapted to native 100MP generation via three distinct training schemes. A new evaluation protocol, PixVerve-Bench, combines conventional image quality metrics with MLLM-based semantic alignment assessment.

Key results:

  • Dataset: 95,000 images, each ≥100MP, with 7-dimensional annotations
  • Target generation resolution: 100MP (native, not patch-stitched)
  • PixVerve-Bench introduced for standardized UHR evaluation (specific numerical comparisons not reported in abstract)

Why it matters / caveats: PixVerve-95K is a foundational infrastructure contribution for UHR image generation research. Quantitative performance comparisons with other UHR approaches are not detailed in the abstract, making independent assessment of generation quality difficult.

Semantic Generative Tuning for Unified Multimodal Models →

arXiv 2605.18714 · ▲ 7 on Hugging Face · HF page · PDF

Technical breakdown

Problem: Unified multimodal models that jointly handle visual understanding and generation are hampered by decoupled training objectives — sparse text supervision for understanding and dense pixel objectives for generation — which create misaligned representation spaces that prevent mutual reinforcement.

Method: Semantic Generative Tuning (SGT) introduces image segmentation as a generative proxy task during post-training to bridge understanding and generation. Hierarchical visual tasks are formulated as generative proxies, with segmentation identified empirically as the optimal proxy because it provides structural semantics without distracting low-level texture detail. SGT is applied as a post-training paradigm on top of existing unified multimodal architectures.

Key results:

  • Consistently improves both multimodal comprehension and generative fidelity across mainstream benchmarks (specific numbers not reported in abstract)
  • Mechanistic analysis shows improved feature linear separability and optimized visual-textual attention allocation patterns

Why it matters / caveats: SGT provides a principled, lightweight post-training recipe for unifying understanding and generation in multimodal models, grounded in mechanistic analysis. Specific benchmark numbers are not provided in the abstract, limiting direct quantitative comparison.

Overcoming Catastrophic Forgetting in Visual Continual Learning with Reinforcement Fine-Tuning →

arXiv 2605.09640 · ▲ 5 on Hugging Face · HF page · PDF

Technical breakdown

Problem: It is an open question whether reinforcement fine-tuning methods like GRPO can overcome catastrophic forgetting in challenging visual continual learning settings such as class-incremental learning (CIL) and domain-incremental learning (DIL).

Method: The paper identifies Trajectory-level Drift Agnosticism — where rollouts with identical task rewards show large KL divergence variations from prior-task policies, correlating with forgetting — as the root cause. Retention-aware Policy Optimization (RaPO) addresses this with two components: a Retention Reward that converts trajectory-level distribution drift into a continuous reward signal to prioritize knowledge-preserving rollouts, and Cross-Task Advantage Normalization (CTAN) that maintains an exponential moving average of reward statistics across task boundaries to stabilize optimization.

Key results:

  • RaPO substantially reduces catastrophic forgetting while preserving plasticity across 5 visual continual learning settings (specific accuracy numbers not reported in abstract)
  • First systematic exploration of RFT in visual continual learning

Why it matters / caveats: RaPO offers a practical mechanism for extending RLVR-based training to continual learning scenarios, which is underexplored. Specific numerical improvements are not provided in the abstract, and the evaluation is limited to visual CIL/DIL settings without broader language or multimodal continual learning tasks.

← 2026-05-192026-05-202026-05-22 →