AI Paper Atlas

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

Tiered Reinforcement Learning: Pessimism in the Face of Uncertainty and Constant Regret

Jiawei Huang, Li Zhao, Tao Qin, Wei Chen, Nan Jiang, Tie-Yan Liu

NeurIPS 2022 · Bandits and online learning › RL theory and MDPs · approach: Regret bounds with function approximation · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 Pessimistic Value Iteration as the exploitation algorithm for risk-averse usersTiered RL (Alg^E) · Gap-dependent tabular MDPsregret of risk-averse usersImproved
Separate exploitation and online policies in the gap-independent settingTiered RL · Gap-independent minimaxregret of risk-averse usersNo clear effect
Keep the online policy running while the exploitation policy uses pessimismAlg^O in tiered RL · Gap-dependent tabular MDPsregret of online usersNo clear effect
Use LCB with UCB online policy in stochastic banditsTiered bandits · Stochastic multi-armed banditsregret of exploitation usersImproved

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