Name
Title | ||
|---|---|---|
A Function Approximation Method for Model-based High-Dimensional Inverse Reinforcement Learning. |
Abstract | ||
|---|---|---|
This works handles the inverse reinforcement learning problem in high-dimensional state spaces, which relies on an efficient solution of model-based high-dimensional reinforcement learning problems. To solve the computationally expensive reinforcement learning problems, we propose a function approximation method to ensure that the Bellman Optimality Equation always holds, and then estimate a function based on the observed human actions for inverse reinforcement learning problems. The time complexity of the proposed method is linearly proportional to the cardinality of the action set, thus it can handle high-dimensional even continuous state spaces efficiently. We test the proposed method in a simulated environment to show its accuracy, and three clinical tasks to show how it can be used to evaluate a doctoru0027s proficiency. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Learning | Mathematical optimization,Function approximation,Cardinality,Inverse reinforcement learning,Optimality equation,Time complexity,Mathematics,Reinforcement learning |
DocType | Volume | Citations |
Journal | abs/1708.07738 | 1 |
PageRank | References | Authors |
0.35 | 10 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kun Li | 1 | 6 | 3.47 |
| Burdick, J.W. | 2 | 2988 | 516.87 |