arXiv Machine Learning July 22, 2026 By Dongming Wang, Pengcheng Dai, Wenwu Yu, Wei Ren

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

Read the original on arXiv Machine Learning →

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.

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

arXiv Machine Learning

Jun 11

Impact of Connectivity on Laplacian Representations in Reinforcement Learning

arXiv:2603. 08558v3 Announce Type: replace Abstract: Learning compact state representations in Markov Decision Processes (MDPs) has proven crucial for addressing the curse of dimensionality in large-scale reinforcement learning (RL) problems.

By Tommaso Giorgi, Pierriccardo Olivieri, Keyue Jiang, Laura Toni, Matteo Papini

reinforcement-learning

arXiv AI

Jun 4

A Unified Framework for Locality in Scalable MARL

arXiv:2602. 16966v2 Announce Type: replace-cross Abstract: Scalable methods for networked multi-agent reinforcement learning let each agent plan using only a small neighborhood of the agent graph.

By Sourav Chakraborty, Amit Kiran Rege, Claire Monteleoni, Lijun Chen

agents reinforcement-learning safety

arXiv AI

Jun 16

Direction-Conditioned Policies via Compositional Subgoal Scoring for Online Goal-Conditioned Reinforcement Learning

arXiv:2606. 16515v1 Announce Type: cross Abstract: Hamilton-Jacobi-Bellman theory implies that the optimal goal-conditioned action depends on the goal only through the gradient of the goal-reaching distance at the current state, yet standard online GCRL still conditions the actor on the raw goal -- a signal that is geometrically uninformative when the goal is far from the data distribution.

By Swaminathan S K, Damiya Gondha, Theyanesh Eswaramoorthy Rajahkrishnan, Aritra Hazra

reinforcement-learning robotics

arXiv Machine Learning

Jul 1

End-to-End Efficient RL for Linear Bellman Complete MDPs with Deterministic Transitions

arXiv:2603. 23461v2 Announce Type: replace Abstract: We study reinforcement learning (RL) with linear function approximation in Markov Decision Processes (MDPs) satisfying \emph{linear Bellman completeness} -- a fundamental setting where the Bellman backup of any linear value function remains linear.

By Zakaria Mhammedi, Alexander Rakhlin, Nneka Okolo

reinforcement-learning

arXiv AI

Jun 10

Bellman-Taylor Score Decoding for Markov Decision Processes with State-Dependent Feasible Action Sets

arXiv:2606. 10979v1 Announce Type: new Abstract: Many Markov decision processes (MDPs) in operations research have feasible actions that are state dependent and defined implicitly by various operational constraints.

By Yi Chen (Lucy), Rushuai Yang (Lucy), Qiang Chen (Lucy), Dongyan (Lucy), Huo

reinforcement-learning benchmarks

arXiv Machine Learning

Jul 10

Expressivity and Statistical Trade-offs in Diffusion Policy 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.

By Viet Vu, Renyuan Xu, Jiacheng Zhang, Yufei Zhang

diffusion reinforcement-learning multimodal

Related stories

Impact of Connectivity on Laplacian Representations in Reinforcement Learning

A Unified Framework for Locality in Scalable MARL

Direction-Conditioned Policies via Compositional Subgoal Scoring for Online Goal-Conditioned Reinforcement Learning

End-to-End Efficient RL for Linear Bellman Complete MDPs with Deterministic Transitions

Bellman-Taylor Score Decoding for Markov Decision Processes with State-Dependent Feasible Action Sets

Expressivity and Statistical Trade-offs in Diffusion Policy Learning