research
∙
05/18/2023
Optimistic Natural Policy Gradient: a Simple Efficient Policy Optimization Framework for Online RL
While policy optimization algorithms have played an important role in re...
share
research
∙
02/25/2023
Exponential Hardness of Reinforcement Learning with Linear Function Approximation
A fundamental question in reinforcement learning theory is: suppose the ...
research
∙
10/27/2022
Confident Approximate Policy Iteration for Efficient Local Planning in q^π-realizable MDPs
We consider approximate dynamic programming in γ-discounted Markov decis...
research
∙
10/05/2021
TensorPlan and the Few Actions Lower Bound for Planning in MDPs under Linear Realizability of Optimal Value Functions
We consider the minimax query complexity of online planning with a gener...
research
∙
02/03/2021
On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function
We consider the problem of local planning in fixed-horizon Markov Decisi...
research
∙
10/03/2020
Exponential Lower Bounds for Planning in MDPs With Linearly-Realizable Optimal Action-Value Functions
We consider the problem of local planning in fixed-horizon Markov Decisi...
research
∙
08/27/2019
Exploration-Enhanced POLITEX
We study algorithms for average-cost reinforcement learning problems wit...
research
∙
07/02/2018
LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration
We consider the problem of configuring general-purpose solvers to run ef...
research
∙
02/11/2018
