arXiv Machine Learning July 21, 2026 By Hany Hamed, Abhishek Naik, Colin Bellinger, A. Rupam Mahmood

Rethinking the Suitability of Reinforcement Learning Algorithms Under Practical Transfer Constraints

Read the original on arXiv Machine Learning →

arXiv:2607. 17326v1 Announce Type: new Abstract: Transfer-oriented reinforcement learning requires evaluating algorithms along dimensions that go beyond standard sample efficiency.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

reinforcement-learning

arXiv Machine Learning

1d ago

Reusing Past Samples in Proximal Policy Optimization: When and How Does It Help?

The paper investigates how reusing past samples can improve the sample efficiency of Proximal Policy Optimization (PPO). Two variants, wPPO-U and wPPO-BH, are introduced within a multiple importance weighting framework, each reusing data from recent iterations while preserving core PPO mechanics. The authors derive theoretical policy improvement bounds for both variants and empirically evaluate their impact on continuous control tasks.

By Alessandro Montenegro, Riccardo Venturelli, Marco Mussi, Matteo Papini, Alberto Maria Metelli

reinforcement-learning

arXiv AI

3d ago

ART for Diffusion Sampling: A Reinforcement Learning Approach to Timestep Schedule

arXiv:2601.18681v3 Announce Type: replace-cross Abstract: We consider time discretization for score-based diffusion models to generate samples from a learned reverse-time dynamic on a finite grid. Un...

By Yilie Huang, Wenpin Tang, Xunyu Zhou

diffusion reinforcement-learning

arXiv AI

Jul 3

ART for Diffusion Sampling: Continuous-Time Control and Actor-Critic Learning

arXiv:2607. 02137v1 Announce Type: cross Abstract: We study timestep allocation for score-based diffusion sampling, where a learned reverse-time dynamics is discretized on a finite grid.

By Yilie Huang, Wenpin Tang, Xun Yu Zhou

diffusion reinforcement-learning

arXiv AI

Jun 9

An Agency-Transferring Model-Free Policy Enhancement Technique

arXiv:2606. 09825v1 Announce Type: cross Abstract: Training reinforcement learning (RL) policies from scratch is costly: it requires careful reward and environment design, extensive tuning, and substantial computation.

By Anton Bolychev, Georgiy Malaniya, Sinan Ibrahim, Pavel Osinenko

rag agents reinforcement-learning benchmarks

arXiv AI

Sep 1

When Do Larger Batches Help Scale LLM Reinforcement Learning?

arXiv:2608.29296v1 Announce Type: cross Abstract: Larger batches reduce the variance of stochastic gradients per update and are therefore often expected to accelerate training. Yet whether this stati...

By Ziniu Li, Jinbo Wang, Guanhua Huang, Feiyuan Zhang, Pengbo Li, Alex Chen

llms reinforcement-learning efficiency

arXiv Machine Learning

Aug 26

WarpSAC: Towards the Pinnacle of Scalable Off-policy RL by Rethinking Exploration and Exploitation

arXiv:2608.24479v1 Announce Type: new Abstract: Massively parallel simulation changes the data regime in which off-policy reinforcement learning (RL) is trained, challenging stabilizers designed for...

By Zihao Wu, Hongyao Tang, Yi Ma, Huizhong Song, Pengyi Li, Yifu Yuan, Fei Ni, Jinyi Liu, Wei Wei, Jianrong Wang, Yan Zheng, Jianye Hao

reinforcement-learning robotics efficiency benchmarks

One email a morning, machine-written

Related stories

Reusing Past Samples in Proximal Policy Optimization: When and How Does It Help?

ART for Diffusion Sampling: A Reinforcement Learning Approach to Timestep Schedule

ART for Diffusion Sampling: Continuous-Time Control and Actor-Critic Learning

An Agency-Transferring Model-Free Policy Enhancement Technique

When Do Larger Batches Help Scale LLM Reinforcement Learning?

WarpSAC: Towards the Pinnacle of Scalable Off-policy RL by Rethinking Exploration and Exploitation