atlas

Research map / Learning theory and algorithms / Sample complexity

Tightening the Dependence on Horizon in the Sample Complexity of Q-Learning

ICML 2021 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of MDPs · 8 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
sharpened error decomposition and recursion analysis of vanilla synchronous Q-learningvanilla Q-learning, discounted infinite-horizon MDP · generative model, l-infinity errorsample complexity dependence on 1/(1-γ): from (1-γ)^-5 to (1-γ)^-4 (order-wise improvement of 1/(1-γ))Helped
rescaled linear or constant learning rates with the new analysisvanilla Q-learning, finite-horizon MDP · generative model, l-infinity errorsample complexity in HHelped
learning rate schedule choice (rescaled linear vs iteration-invariant constant)vanilla Q-learning, discounted infinite-horizon MDP · generative modelsample complexity orderNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy