Name
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. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Optimization and Control | Residual,Mathematical optimization,Computer science,Apprenticeship learning,Markov decision process,Convex function,Artificial intelligence,Reinforcement learning |
DocType | Volume | Citations |
Journal | abs/1606.01128 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bilal Piot | 1 | 335 | 20.65 |
| Matthieu Geist | 2 | 385 | 44.31 |
| Olivier Pietquin | 3 | 664 | 68.60 |