Difference of Convex Functions Programming Applied to Control with Expert Data

Bilal Piot 1, 2 Matthieu Geist 3 Olivier Pietquin 2, 1
2 SEQUEL - Sequential Learning
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : This paper reports applications of Difference of Convex functions (DC) programming to Learning from Demonstrations (LfD) and Reinforcement Learning (RL) with expert data. This is made possible because the norm of the Optimal Bellman Residual (OBR), which is at the heart of many RL and LfD algorithms, is DC. Improvement in performance is demonstrated on two specific algorithms, namely Reward-regularized Classification for Apprenticeship Learning (RCAL) and Reinforcement Learning with Expert Demonstrations (RLED), through experiments on generic Markov Decision Processes (MDP), called Garnets.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01629653
Contributor : Matthieu Geist <>
Submitted on : Monday, November 6, 2017 - 4:12:31 PM
Last modification on : Friday, March 22, 2019 - 1:36:17 AM

File

1606.01128.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01629653, version 1

Citation

Bilal Piot, Matthieu Geist, Olivier Pietquin. Difference of Convex Functions Programming Applied to Control with Expert Data. 2017. ⟨hal-01629653⟩

Share

Metrics

Record views

91

Files downloads

52