atlas

Research map / Reinforcement learning / MDPs and planning

Regularization Guarantees Generalization in Bayesian Reinforcement Learning through Algorithmic Stability

AAAI 2022 · Reinforcement learning › MDPs and planning · approach: POMDPs and confounded RL · 5 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
Add L2 policy regularization to the empirical risk objectiveBayesian RL ERM policy · Bayesian RLgeneralization regret bound: 2λT + 2κ/(λN) + (4κ/λ + 3C_maxT)√(ln (1/δ)/(2N))Helped
Use regularization with a finite set of possible MDPsBayesian RL ERM policy · Finite MDP hypothesis setgeneralization regret bound: 2λT + √(C_max²T²/(2Nδ) + 48C_max³T³|A|/(2δλN minprior))Helped
Use unregularized ERM without additional assumptions on the problemBayesian RL ERM policy · Constructed Bayesian RL problemregret: N = 2^THurt
Use a structural assumption that bounds differences in history visitation across MDPsRegularized Bayesian RL · Bayesian RL with comparable history-transition probabilitiesgeneralization regret bound: κ=2D²C_max²T²|A|; κ/(λN)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