arXiv Machine Learning July 10, 2026 By Viet Vu, Renyuan Xu, Jiacheng Zhang, Yufei Zhang

Expressivity and Statistical Trade-offs in Diffusion Policy Learning

Read the original on arXiv Machine Learning →

arXiv:2607. 07967v1 Announce Type: cross Abstract: Diffusion-based policies have recently emerged as powerful policy parameterizations for reinforcement learning, representing state-conditioned action distributions as terminal laws of diffusion processes with parameterized drifts.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

2d ago

Offline Deep Q* Estimation with Diffusion Models

arXiv:2608. 14401v1 Announce Type: cross Abstract: In offline RL, estimating the optimal action-value function $Q^*$ can be formulated as solving the optimal Bellman equation based solely on offline observations.

By Xiaohong Chen, Yuling Jiao, Lican Kang, Jerry Zhijian Yang, Chen Zhong

diffusion reinforcement-learning

arXiv Machine Learning

Jun 11

Reverse Flow Matching: A Unified Framework for Online Reinforcement Learning with Diffusion and Flow Policies

arXiv:2601. 08136v2 Announce Type: replace Abstract: Diffusion and flow policies are gaining prominence in online reinforcement learning (RL) due to their expressive power, yet training them efficiently remains a critical challenge.

By Zeyang Li, Sunbochen Tang, Navid Azizan

diffusion reinforcement-learning benchmarks

arXiv Machine Learning

Jul 22

Scalable Policy Optimization for Networked Multi-Agent Reinforcement Learning with Continuous State-Action Spaces

arXiv:2607. 18554v1 Announce Type: cross Abstract: We develop the Continuous Distributed Coupled Policy Gradient (CDCPG) algorithm for cooperative reinforcement learning in networked Markov decision processes with continuous state and action spaces.

By Dongming Wang, Pengcheng Dai, Wenwu Yu, Wei Ren

agents reinforcement-learning benchmarks

arXiv Machine Learning

Jul 21

Concentration and Mean-Square Bounds for Contractive Stochastic Approximation: A Unified Elementary Approach

arXiv:2607. 17595v1 Announce Type: new Abstract: We establish mean-square and concentration bounds for stochastic approximation (SA) with arbitrary norm contractive mappings, under a multiplicative noise model where the noise may scale affinely with the norm of the iterates, and the iterates are potentially unbounded.

By Siddharth Chandak

reinforcement-learning

arXiv Machine Learning

Jun 15

Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs

arXiv:2606. 14095v1 Announce Type: new Abstract: We study the sample complexity of learning in average-reward weakly-coupled Markov decision processes (WCMDPs) and Restless Bandits (RBs) under a generative model.

By Tianhao Wu, Matthew Zurek, Weina Wang, Qiaomin Xie

reinforcement-learning safety

arXiv AI

Jul 24

From Atoms to Entropy: Optimal Noise Allocation for Diffusion Training in the Convex Regime

arXiv:2607. 20540v1 Announce Type: cross Abstract: How should a diffusion model decide which noise levels to train on, and how much?

By Luca Ambrogioni, Giulio Franzese, Alberto Foresti, Gabriel Raya, Bac Nguyen, Georgios Batzolis, Yuhta Takida, Naoki Murata, Chieh-Hsin Lai, Yuki Mitsufuji

diffusion

Related stories

Offline Deep Q* Estimation with Diffusion Models

Reverse Flow Matching: A Unified Framework for Online Reinforcement Learning with Diffusion and Flow Policies

Scalable Policy Optimization for Networked Multi-Agent Reinforcement Learning with Continuous State-Action Spaces

Concentration and Mean-Square Bounds for Contractive Stochastic Approximation: A Unified Elementary Approach

Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs

From Atoms to Entropy: Optimal Noise Allocation for Diffusion Training in the Convex Regime