arXiv Statistics ML

Entropy Regularization: A Free Correction to Cross-Entropy for Verified Demonstrations

arXiv Computer Vision
Aug 27

Boosting Reasoning in Large Multimodal Models via Activation Replay

The paper introduces Activation Replay, a training‑free method that improves reasoning in post‑trained large multimodal models (LMMs) by replaying low‑entropy activations from the base model’s input context. It shows that Reinforcement Learning with Verifiable Rewards (RLVR) shifts low‑entropy activations and that modulating these activations enhances reasoning across tasks such as mathematics, visual agents, and video reasoning. Experiments demonstrate that Activation Replay outperforms alternatives like high‑entropy replay or direct cross‑model intervention, boosting Pass@K and broadening RLVR’s reasoning coverage.

By Yun Xing, Xiaobin Hu, Qingdong He, Jiangning Zhang, Shuicheng Yan, Shijian Lu, Yu-Gang Jiang
Hugging Face Trending Papers
Oct 27

When All Rollouts Fail: Policy-Compatible Joint Decoding for Hard-Problem Reasoning

The paper introduces Policy-Compatible Reinforcement Learning (PICO), a method that combines distribution-constrained joint decoding with on-policy rollouts to address the learning cliff in reinforcement learning with verifiable rewards (RLVR). PICO guides token-level decoding using expert data while preserving the model’s relative token probabilities, and employs a dynamic top‑k mechanism to keep sampling within a finite divergence budget. This approach yields verified, policy‑compatible trajectories that are jointly optimized with on‑policy rollouts, leading to consistent performance gains over standard RLVR and prior off‑policy baselines across diverse reasoning datasets and agentic benchmarks.

arXiv AI
Oct 28

When All Rollouts Fail: Policy-Compatible Joint Decoding for Hard-Problem Reasoning

The paper introduces Policy-Compatible Reinforcement Learning (PICO), a method that addresses the learning cliff in reinforcement learning with verifiable rewards (RLVR) by performing distribution-constrained joint decoding. PICO guides token-level decoding with expert data while preserving the model’s token probabilities, and uses a dynamic top‑k mechanism to keep sampling within a finite divergence budget. The resulting trajectories are verified and policy‑compatible, and are jointly optimized with on‑policy rollouts using a mixed‑behavior objective that mitigates distribution mismatch via importance sampling, leading to consistent performance gains over standard RLVR and prior off‑policy baselines on diverse reasoning datasets and agentic benchmarks.

By Zehao Wang, Hanzhu Chen, Runquan Gui, Zhe Wang, Lin Yang
arXiv Machine Learning
Sep 30

Provable Benefits of Regularization: Fast Rates for Adversarial Imitation Learning

The paper introduces Dually Regularized AIL, a model‑free algorithm for adversarial imitation learning that jointly applies KL policy regularization and a quadratic reward penalty based on expert and learner occupancies. It proves fast convergence rates, achieving a ×O(1/K+1/N) bound on the regularized imitation gap in finite‑horizon MDPs with general function approximation, and establishes the first algorithm to attain ×O(1/ε) sample complexity in both expert demonstrations and online interactions for this regularized objective.

By Hanbin Zhou, Shangzhe Li, Alexander Braverman, Weitong Zhang