
Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL
Several practical applications of reinforcement learning involve an agen...
read it

Provably Efficient RewardAgnostic Navigation with Linear Value Iteration
There has been growing progress on theoretical analyses for provably eff...
read it

Learning Near Optimal Policies with Low Inherent Bellman Error
We study the exploration problem with approximate linear actionvalue fu...
read it

Problem Dependent Reinforcement Learning Bounds Which Can Identify Bandit Structure in MDPs
In order to make good decision under uncertainty an agent must learn fro...
read it

Frequentist Regret Bounds for Randomized LeastSquares Value Iteration
We consider the explorationexploitation dilemma in finitehorizon reinf...
read it

Tighter ProblemDependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds
Strong worstcase performance bounds for episodic reinforcement learning...
read it

Robust SuperLevel Set Estimation using Gaussian Processes
This paper focuses on the problem of determining as large a region as po...
read it
Andrea Zanette
is this you? claim profile