atlas

Research map / Bandits and online learning / RL theory and MDPs

First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach

ICML 2022 · Bandits and online learning › RL theory and MDPs · approach: Regret bounds with function approximation · 3 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
Use robust Catoni estimation instead of least-squares estimation for next-state value expectationsFORCE in linear MDPs · Linear MDPsregret upper bound: LSVI-UCB: \widetilde{\cO}(\sqrt{d^3 H^4 K}) -> FORCE: \widetilde{\cO}(\sqrt{d^3 H^3 \cdot V^\star_1 \cdot K} + d^{3.5}H^Helped
Use covariance eigenvectors to form the linear approximationFORCE · Linear MDPsregret upper bound: \sqrt{d^3 H^3 V^\star_1 K} -> \sqrt{d^4 H^3 V^\star_1 K}Mixed
Use variance-normalized weighted least squares with a Bernstein-style self-normalized boundLinear MDP regression · Linear MDPsregret upper bound: (\sqrt{d} + \frac{H}{\sigminb}) \sqrt{\sigminb^2 HK} \ge H \sqrt{HK}Hurt

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