Policy Distillation, Grounded Reasoning, and Robust ML Methods

8 selected AI/ML papers covering LG, AI, CL, CV, IR, stat.ML, stat.AP, SE, CR, RO and more

Today’s selection of 8 noteworthy AI/ML papers from arXiv, covering advances in reinforcement learning, multimodal systems, visual reasoning, and AI security.


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

Authors: Yifan Ding, Xincheng Wei, Yoshua Y. Li, Ziheng Li, Yuquan Lu et al. | Categories: cs.LG, cs.AI Link: arxiv.org/abs/2607.29209

Fusing RLVR’s response-level rewards with on-policy distillation’s dense token-level advantages often triggers entropy collapse due to magnitude and temporal mismatches. SAF introduces a sparsify-then-compress mechanism paired with a warm-up-then-anneal schedule applied only to the OPD advantage, resolving both issues. Across seven math and code benchmarks with Qwen3 models, SAF avoids entropy collapse and improves aggregate scores by 0.51–2.70% over fixed-coefficient fusion.

Takeaway: A practical solution to a real training-stability problem in hybrid RL frameworks — the “switchable stages” design offers flexible adoption with negligible overhead.


2. Translation with Thought: Difficulty-Adaptive Reasoning via Reinforcement Learning for Multi-Domain Machine Translation

Authors: Yongshi Ye, Biao Fu, Chongxuan Huang, Yidong Chen, Xiaodong Shi | Categories: cs.CL, cs.AI Link: arxiv.org/abs/2607.29287

TwT trains models to modulate between intuitive and deliberate reasoning for multi-domain translation, inspired by human translators’ effort adaptation. A two-stage pipeline uses difficulty-aware CoT traces distilled from DeepSeek-R1, followed by RL with a hybrid quality-efficiency reward. TwT-7B and 14B outperform larger SOTA reasoning models across 15 benchmarks and 59 unseen languages while reducing token usage by 32–60%.

Takeaway: Demonstrates that “thinking less when it’s easy” isn’t just efficient — it measurably improves quality and generalization in translation.


3. Don’t Mix Rewards, Mix Policies: Policy Decomposition and Optimization for Multi-Reward RL

Authors: Ruiming Liang, Yi Zhong, Yizhen Yuan, Yinan Zheng, Tianyi Tan et al. | Categories: cs.AI Link: arxiv.org/abs/2607.29246

Multi-reward RL suffers from an “alignment tax” where conflicting objectives cause unstable post-training. PRISM sidesteps this by optimizing standalone positive policies and a global negative policy in policy space, rather than compositing rewards directly. Experiments on scientific reasoning, tool-use, and helpfulness-safety alignment show consistent gains over multi-reward baselines, plus inference-time controllability.

Takeaway: A clever reframing — treating reward conflicts at the policy level instead of the objective level — that adds controllability as a bonus.


4. TraceViT: Grounded Trace Supervision for Visual Abstract Reasoning

Authors: Binnan Liu, Yechi Ma, Tian Xie, Wei Hua | Categories: cs.CV, cs.AI Link: arxiv.org/abs/2607.29586

TraceViT trains a looped visual reasoner on semantically monotonic transformation chains derived from programmatic ARC task implementations, grounding each iteration with task references and object workspaces. Soft trace alignment enforces ordering only, letting the model allocate loop iterations freely. Achieves 67.8% pass@2 on ARC-AGI-1 and 24.3% on ARC-AGI-2, with ablations showing trace supervision helps only when paired with grounding.

Takeaway: The finding that intermediate step supervision + grounding matters for ARC is a strong signal for how to make progress on abstract visual reasoning.


5. GALA: Generative Aligned Learning for Adaptive Multimodal Representation in the Taobao Shangou Recommender System

Authors: Jiping Liu, Zhongmin Zhang, Zisen Sang, Zhijia Fang, Tao Ouyang et al. | Categories: cs.IR, cs.LG Link: arxiv.org/abs/2607.29213

GALA bridges the pretraining-fine-tuning gap in multimodal recommender systems with a three-stage pipeline, highlighted by an intermediate “generative RL alignment” stage that builds multimodal pretraining data from user behavior and refines embeddings via GRPO. Deployed at Taobao Shangou serving 200M+ DAU, it delivers offline AUC gains of +0.12/+0.20 and a 0.55% online order-volume lift. The adaptive gating mechanism preserves multimodal contributions during long-term ID-dominant training.

Takeaway: A rare, fully deployed example of RL-based alignment in industrial recommenders — the “intermediate alignment stage” is a broadly applicable design idea.


6. Analytical and Bootstrap Confidence Intervals of Double Machine Learning: Simulation studies and an application to rural-urban difference in obesity prevalence

Authors: Haozheng Xu, Siyuan Ma, Qingyan Xiang | Categories: stat.ML, cs.LG, stat.AP Link: arxiv.org/abs/2607.29456

This simulation study compares DML confidence intervals — analytical vs. bootstrap — across five ML learners under varied data-generation settings, revealing substantial variability in coverage. Surprisingly, coverage probability decreases for both interval types as sample size grows in many settings. A real-data application confirms learner-dependent performance and finds greater rurality significantly increases county-level obesity prevalence.

Takeaway: A cautionary empirical result: DML inference reliability hinges critically on nuisance learner choice, and larger samples don’t automatically fix coverage — important for applied causal ML.


7. AgenticRepair: Multi-Faceted Program Context Engineering for Agentic Vulnerability Repair

Authors: Michael Fu, Qiyue Mei, Patanamon Thongtanunam, Kla Tantithamthavorn | Categories: cs.SE, cs.AI, cs.CR Link: arxiv.org/abs/2607.29422

AgenticRepair addresses three context gaps — code-structure, runtime-execution, and commit-history — in automated vulnerability repair that general bug-repair agents miss. It orchestrates three specialized LLM subagents to engineer contexts fed into a dedicated repair agent’s memory. On SEC-Bench with 300 real-world instances, it achieves a 73% success rate, outperforming the strongest baseline by 29%.

Takeaway: The “context engineering” framing is transferable beyond security, and the 29% margin over prior agents shows the value of domain-specific context design.


8. WCM: A World Critic Model for Vision-Language-Action Reinforcement Learning

Authors: Senyu Fei, Xiaopeng Yu, Siyin Wang, Xianzhong Zhao, Jingjing Gong et al. | Categories: cs.RO, cs.CL, cs.CV Link: arxiv.org/abs/2607.29613

The World Critic Model (WCM) fixes a fundamental mismatch in VLA RL: critics that evaluate single-frame observations ignore the partially observable nature of control. WCM uses a lightweight LeJEPA architecture to jointly predict future latent states and estimate values, making the critic’s representation explicitly temporal. Across 149 tasks and four benchmarks, WCM achieves SOTA in both in-distribution and OOD settings, with confirmed real-world deployment on OpenVLA-OFT and Pi0.5.

Takeaway: Diagnosing the critic’s “state approximation problem” is the key insight — future-state prediction turns out to be the missing supervision signal for robust value estimation in robot RL.


This content was generated with AI assistance. Paper information sourced from arXiv.