SOTAVerified

Imitation Learning

Imitation Learning is a framework for learning a behavior policy from demonstrations. Usually, demonstrations are presented in the form of state-action trajectories, with each pair indicating the action to take at the state being visited. In order to learn the behavior policy, the demonstrated actions are usually utilized in two ways. The first, known as Behavior Cloning (BC), treats the action as the target label for each state, and then learns a generalized mapping from states to actions in a supervised manner. Another way, known as Inverse Reinforcement Learning (IRL), views the demonstrated actions as a sequence of decisions, and aims at finding a reward/cost function under which the demonstrated decisions are optimal.

Finally, a newer methodology, Inverse Q-Learning aims at directly learning Q-functions from expert data, implicitly representing rewards, under which the optimal policy can be given as a Boltzmann distribution similar to soft Q-learning

Source: Learning to Imitate

Papers

Showing 16111620 of 2122 papers

TitleStatusHype
When Will Generative Adversarial Imitation Learning Algorithms Attain Global Convergence0
Adversarial Soft Advantage Fitting: Imitation Learning without Policy OptimizationCode1
Aligning Time Series on Incomparable SpacesCode1
PICO: Primitive Imitation for COntrol0
AutoOD: Automated Outlier Detection via Curiosity-guided Search and Self-imitation Learning0
Modelling Agent Policies with Interpretable Imitation Learning0
Reparameterized Variational Divergence Minimization for Stable Imitation0
Active Imitation Learning from Multiple Non-Deterministic Teachers: Formulation, Challenges, and Algorithms0
Self-Imitation Learning via Generalized Lower Bound Q-learning0
PAC Bounds for Imitation and Model-based Batch Learning of Contextual Markov Decision Processes0
Show:102550
← PrevPage 162 of 213Next →

No leaderboard results yet.