arXiv Machine Learning June 24, 2026 By Luca Viano, Till Freihaut, Emanuele Nevali, Volkan Cevher, Matthieu Geist, Giorgia Ramponi

Multi-agent imitation learning with function approximation: Linear Markov games and beyond

Read the original on arXiv Machine Learning →

arXiv:2602. 22810v2 Announce Type: replace Abstract: In this work, we present the first theoretical analysis of multi-agent imitation learning (MAIL) in linear Markov games where both the transition dynamics and each agent's reward function are linear in some given features.

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

agents

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 8

CHDP: Cooperative Hybrid Diffusion Policies for Reinforcement Learning in Parameterized Action Space

arXiv:2601. 05675v2 Announce Type: replace Abstract: Hybrid action space, which combines discrete choices and continuous parameters, is prevalent in domains such as robot control and game AI.

By Bingyi Liu, Jinbo He, Haiyong Shi, Enshu Wang, Weizhen Han, Jingxiang Hao, Peixi Wang, Zhuangzhuang Zhang

rag agents diffusion reinforcement-learning robotics benchmarks

arXiv AI

Jun 9

Difference-Aware Retrieval Policies for Imitation Learning

arXiv:2606. 09758v1 Announce Type: cross Abstract: Parametric imitation learning via behavior cloning can suffer from poor generalization to out-of-distribution states due to compounding errors during deployment.

By Quinn Pfeifer, Ethan Pronovost, Paarth Shah, Khimya Khetarpal, Siddhartha Srinivasa, Abhishek Gupta

robotics

arXiv AI

Jun 10

Model-Based Reinforcement Learning in Discrete-Action Non-Markovian Reward Decision Processes

arXiv:2512. 14617v2 Announce Type: replace-cross Abstract: Many practical decision-making problems involve tasks whose success depends on the entire system history, rather than on achieving a state with desired properties.

By Alessandro Trapasso, Luca Iocchi, Fabio Patrizi

agents reinforcement-learning benchmarks

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 3

On the Sample Efficiency of Inverse Dynamics Models for Semi-Supervised Imitation Learning

arXiv:2602. 02762v2 Announce Type: replace Abstract: Semi-supervised imitation learning (SSIL) consists in learning a policy from a small dataset of action-labeled trajectories and a much larger dataset of action-free trajectories.

By Sacha Morin, Moonsub Byeon, Alexia Jolicoeur-Martineau, S\'ebastien Lachapelle

benchmarks

Related stories

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

CHDP: Cooperative Hybrid Diffusion Policies for Reinforcement Learning in Parameterized Action Space

Difference-Aware Retrieval Policies for Imitation Learning

Model-Based Reinforcement Learning in Discrete-Action Non-Markovian Reward Decision Processes

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

On the Sample Efficiency of Inverse Dynamics Models for Semi-Supervised Imitation Learning