Inverse Q-Learning Done Right: Offline Imitation Learning in Q^-Realizable MDPs

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 generated by an expert policy. Complementing a recent line of work on this topic that assumes the expert belongs to a tractable class of known policies, we approach this problem from a new angle and leverage a different type of structural assumption about the environment. Specifically, for the class of linear Q^-realizable MDPs, we introduce a new algorithm called saddle-point offline imitation learning (), which is guaranteed to match the performance of any expert up to an additive error with access to O (^-2) samples. Moreover, we extend this result to possibly non-linear Q^-realizable MDPs at the cost of a worse sample complexity of order O (^-4). Finally, our analysis suggests a new loss function for training critic networks from expert data in deep imitation learning. Empirical evaluations on standard benchmarks demonstrate that the neural net implementation of is superior to behavior cloning and competitive with state-of-the-art algorithms.