3 citations · 8 across the 23 of their papers we have counts for
7 papers · 1 filter
Rate optimal learning of equilibria from data
Till Freihaut, Luca Viano, Emanuele Nevali +3
We close open theoretical gaps in Multi-Agent Imitation Learning (MAIL) by characterizing the limits of non-interactive MAIL and presenting the first interactive algorithm with nea…
Inverse Q-Learning Done Right: Offline Imitation Learning in -Realizable MDPs
Antoine Moulin, Gergely Neu, Luca Viano
We study the problem of offline imitation learning in Markov decision processes (MDPs), where the goal is to learn a well-performing policy given a dataset of state-action pairs ge…
Learning Equilibria from Data: Provably Efficient Multi-Agent Imitation Learning
Till Freihaut, Luca Viano, Volkan Cevher +2
This paper provides the first expert sample complexity characterization for learning a Nash equilibrium from expert data in Markov Games. We show that a new quantity named the sing…
IL-SOAR : Imitation Learning with Soft Optimistic Actor cRitic
Stefano Viel, Luca Viano, Volkan Cevher
This paper introduces the SOAR framework for imitation learning. SOAR is an algorithmic template that learns a policy from expert demonstrations with a primal dual style algorithm…
Optimistically Optimistic Exploration for Provably Efficient Infinite-Horizon Reinforcement and Imitation Learning
Antoine Moulin, Gergely Neu, Luca Viano
We study the problem of reinforcement learning in infinite-horizon discounted linear Markov decision processes (MDPs), and propose the first computationally efficient algorithm ach…
Multi-Step Alignment as Markov Games: An Optimistic Online Gradient Descent Approach with Convergence Guarantees
Yongtao Wu, Luca Viano, Yihang Chen +4
Reinforcement Learning from Human Feedback (RLHF) has been highly successful in aligning large language models with human preferences. While prevalent methods like DPO have demonst…
Best of Both Worlds: Regret Minimization versus Minimax Play
Adrian Müller, Jon Schneider, Stratis Skoulakis +2
In this paper, we investigate the existence of online learning algorithms with bandit feedback that simultaneously guarantee regret compared to a given comparator strategy,…