AI Paper Atlas

Research map / Reinforcement learning / MDPs and planning

Efficiently Solving MDPs with Stochastic Mirror Descent

ICML 2020 · Reinforcement learning › MDPs and planning · approach: Offline RL sample complexity · 17 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 primal-dual stochastic mirror descent without the prior method's additional ergodicity conditionMixing AMDPs · Mixing AMDPsample complexity: \Otilb{\tau^2\tmix^2\A\eps^{-2}} -> \Otilb{\tmix^2\A\eps^{-2}}Helped
Use primal-dual stochastic mirror descentDiscounted MDPs · Discounted MDPsample complexity: \Otilb{(1-\gamma)^{-4}\A\eps^{-2}} vs. \Otilb{(1-\gamma)^{-3}\A\eps^{-2}}Mixed
Use local-norm variance bounds and carefully designed stochastic gradient estimatorsBox-simplex bilinear saddle-point problems · \ell_\infty-\ell_1 bilinear gamesruntime: \Otilde{((m+n)\linf{\M}^2+n\lones{\bb}^2+m\linf{\cc}^2)\eps^{-2}}Helped

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