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
The paper introduces Dually Regularized AIL, a model‑free algorithm for adversarial imitation learning that jointly applies KL policy regularization and a quadratic reward penalty based on expert and learner occupancies. It proves fast convergence rates, achieving a ×O(1/K+1/N) bound on the regularized imitation gap in finite‑horizon MDPs with general function approximation, and establishes the first algorithm to attain ×O(1/ε) sample complexity in both expert demonstrations and online interactions for this regularized objective.
By Hanbin Zhou, Shangzhe Li, Alexander Braverman, Weitong Zhang
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.
By \c{S}evket Kaan Alk{\i}r, Naci Sald{\i}, Berkay Anahtarc{\i}, Can Deha Kar{\i}ks{\i}z
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
arXiv:2610.32125v1 Announce Type: new
Abstract: Offline maximum entropy reinforcement learning seeks to estimate the optimal soft action-value function \(Q^*\) from a fixed dataset without further in...
By Hao Cheng, Yuling Jiao, Lican Kang, Jerry Zhijian Yang, Chen Zhong
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
arXiv:2606. 05152v1 Announce Type: cross Abstract: Reasoning models have advanced rapidly, but the dominant reinforcement learning from verifiable rewards (RLVR) recipe remains surprisingly narrow: sample many responses and reward each with a single bit indicating whether the final answer is correct.
By Rishabh Agrawal, Jacob Fein-Ashley, Paria Rashidinejad
arXiv:2608. 11052v1 Announce Type: new Abstract: Inverse reinforcement learning (IRL) aims to recover a reward function under which the resulting policy reproduces the behavior observed in expert demonstrations.
By Nikita Sevriukov, Anna Barabanova, Uliana Gagarina, Karina Ivanova, Sofiia Kasaeva, Ilya Levin, Marina Sheshukova
arXiv:2609.38955v1 Announce Type: cross
Abstract: Inverse Reinforcement Learning (IRL) aims to recover a reward function that explains expert demonstrations. Existing IRL methods typically rely on a...
By Yang chen, Yitan Zhang, Michael Witbrock, Shuyue Hu
arXiv:2610.02198v1 Announce Type: cross
Abstract: Several state-of-the-art methods for online reinforcement learning in continuous control improve policies using action gradients of a learned critic....
By Sebastian Sanokowski, Alireza Sarmadi, Majid Khadiv
arXiv:2609.30572v1 Announce Type: cross
Abstract: Large language models are often post-trained on expert demonstrations using cross-entropy (CE), even when the downstream objective is not to imitate...
By Mihir Dhanakshirur, Adam Ousherovitch, Ambuj Tewari
The paper examines the trade-off between using privileged expert distillation and standard reinforcement learning in partially observable settings. By analyzing a theoretical model called the perturbed Block MDP and running experiments on simulated locomotion tasks, it finds that the effectiveness of distillation depends on the stochasticity of latent dynamics and that the optimal latent policy is not always the best to distill. These insights provide guidelines for better leveraging privileged information to improve policy learning efficiency.
By Yuda Song, Dhruv Rohatgi, Aarti Singh, J. Andrew Bagnell