Offline Imitation Learning by Controlling the Effective Planning Horizon

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Ahn, Hee-Jun, Shim, Seong-Woong, Lee, Byung-Jun
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866929214104535040
author Ahn, Hee-Jun
Shim, Seong-Woong
Lee, Byung-Jun
author_facet Ahn, Hee-Jun
Shim, Seong-Woong
Lee, Byung-Jun
contents In offline imitation learning (IL), we generally assume only a handful of expert trajectories and a supplementary offline dataset from suboptimal behaviors to learn the expert policy. While it is now common to minimize the divergence between state-action visitation distributions so that the agent also considers the future consequences of an action, a sampling error in an offline dataset may lead to erroneous estimates of state-action visitations in the offline case. In this paper, we investigate the effect of controlling the effective planning horizon (i.e., reducing the discount factor) as opposed to imposing an explicit regularizer, as previously studied. Unfortunately, it turns out that the existing algorithms suffer from magnified approximation errors when the effective planning horizon is shortened, which results in a significant degradation in performance. We analyze the main cause of the problem and provide the right remedies to correct the algorithm. We show that the corrected algorithm improves on popular imitation learning benchmarks by controlling the effective planning horizon rather than an explicit regularization.
format Preprint
id arxiv_https___arxiv_org_abs_2401_09728
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Offline Imitation Learning by Controlling the Effective Planning Horizon
Ahn, Hee-Jun
Shim, Seong-Woong
Lee, Byung-Jun
Machine Learning
In offline imitation learning (IL), we generally assume only a handful of expert trajectories and a supplementary offline dataset from suboptimal behaviors to learn the expert policy. While it is now common to minimize the divergence between state-action visitation distributions so that the agent also considers the future consequences of an action, a sampling error in an offline dataset may lead to erroneous estimates of state-action visitations in the offline case. In this paper, we investigate the effect of controlling the effective planning horizon (i.e., reducing the discount factor) as opposed to imposing an explicit regularizer, as previously studied. Unfortunately, it turns out that the existing algorithms suffer from magnified approximation errors when the effective planning horizon is shortened, which results in a significant degradation in performance. We analyze the main cause of the problem and provide the right remedies to correct the algorithm. We show that the corrected algorithm improves on popular imitation learning benchmarks by controlling the effective planning horizon rather than an explicit regularization.
title Offline Imitation Learning by Controlling the Effective Planning Horizon
topic Machine Learning
url https://arxiv.org/abs/2401.09728