arXiv Machine Learning June 16, 2026 By \c{S}evket Kaan Alk{\i}r, Naci Sald{\i}, Berkay Anahtarc{\i}, Can Deha Kar{\i}ks{\i}z

Maximum Entropy Inverse Reinforcement Learning for Mean-Field Games with Average Reward

Read the original on arXiv Machine Learning →

arXiv:2606. 16759v1 Announce Type: new Abstract: We study inverse reinforcement learning for discrete-time, infinite-horizon mean-field games (MFGs) under an average-reward criterion.

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

Sep 11

Statistical analysis of Inverse Entropy-regularized Reinforcement Learning

The paper introduces a statistical framework for Inverse Entropy-regularized Reinforcement Learning that resolves the non-uniqueness of reward functions by combining entropy regularization with a least-squares reconstruction of the reward from the soft Bellman residual. It models expert demonstrations as a Markov chain, estimates the expert policy via penalized maximum likelihood, and provides high-probability bounds on the excess Kullback–Leibler divergence between the estimated and true policies. These results yield non-asymptotic minimax optimal convergence rates for the least-squares reward function, highlighting the trade-offs among smoothing, model complexity, and sample size.

By Denis Belomestny, Alexey Naumov, Artemy Rubtsov, Sergey Samsonov

reinforcement-learning

arXiv AI

Aug 7

Fast Rates for Inverse Reinforcement Learning

arXiv:2605. 14599v2 Announce Type: replace-cross Abstract: We establish novel structural and statistical results for entropy-regularized min-max inverse reinforcement learning (Min-Max-IRL) in finite-horizon MDPs with Borel state and action spaces.

By Andreas Schlaginhaufen, Maryam Kamgarpour

reinforcement-learning

arXiv AI

Jul 3

Trust Region Inverse Reinforcement Learning: Explicit Dual Ascent using Local Policy Updates

arXiv:2605. 11020v2 Announce Type: replace-cross Abstract: Inverse reinforcement learning (IRL) is typically formulated as maximizing entropy subject to matching the distribution of expert trajectories.

By Anish Diwan, Davide Tateo, Christopher E. Mower, Haitham Bou-Ammar, Jan Peters, Oleg Arenz

reinforcement-learning benchmarks safety

arXiv Machine Learning

Aug 24

Efficient Inference for Inverse Reinforcement Learning and Dynamic Discrete Choice Models

arXiv:2512.24407v2 Announce Type: replace Abstract: In many sequential decision-making problems, researchers observe actions but not the rewards that drive behavior, yet still wish to evaluate and co...

By Lars van der Laan, Aur\'elien Bibaut, Nathan Kallus

reinforcement-learning

arXiv AI

Jun 6

Retry Policy Gradients in Continuous Action Spaces

arXiv:2606. 05888v1 Announce Type: new Abstract: Retry-based objectives such as pass@K and max@K optimize the best return obtained from multiple sampled trajectories, and recent work has shown that they can promote exploration without explicit exploration bonuses.

By Soichiro Nishimori, Paavo Parmas

arXiv Machine Learning

Jun 9

Global Convergence of Wasserstein Policy Gradient for Entropy-Regularized Reinforcement Learning

arXiv:2605. 26078v3 Announce Type: replace Abstract: Wasserstein policy gradient (WPG) is a policy optimization method for reinforcement learning (RL) that exploits the optimal-transport geometry of action distributions.

By Zhaoyu Zhu, Rui Gao, Shuang Li

diffusion reinforcement-learning safety

One email a morning, machine-written

Related stories

Statistical analysis of Inverse Entropy-regularized Reinforcement Learning

Fast Rates for Inverse Reinforcement Learning

Trust Region Inverse Reinforcement Learning: Explicit Dual Ascent using Local Policy Updates

Efficient Inference for Inverse Reinforcement Learning and Dynamic Discrete Choice Models

Retry Policy Gradients in Continuous Action Spaces

Global Convergence of Wasserstein Policy Gradient for Entropy-Regularized Reinforcement Learning