atlas

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

Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guarantees

NeurIPS 2022 · Bandits and online learning › RL theory and MDPs · approach: Regret bounds with function approximation · 1 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 optimistic selection among logarithmically many inflated Dirichlet posterior samples instead of one posterior samplePosterior sampling for episodic tabular RL · Episodic tabular MDPhigh-probability regret upper bound: single posterior sample: \tcO(H^2S\sqrt{AT}); OPSRL: \cO\left( \sqrt{H^3SAT L^3} + H^3 S^2 A L^3 \right)Helped
Use the new Dirichlet anti-concentration bound to establish optimism with logarithmically many samplesOPSRL · Episodic tabular MDPposterior samples per state-action pair: \tcO(S) to \tcO(1)Helped
Use OPSRL rather than UCBVITabular RL · Grid-world, 100 states, H=50, transition noise 0.2regretHelped
Use OPSRL rather than RLSVITabular RL · Grid-world, 100 states, H=50, transition noise 0.2regretHelped
Use OPSRL rather than PSRLTabular RL · Grid-world, 100 states, H=50, transition noise 0.2regretNo 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