AI Paper Atlas

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

Online Reinforcement Learning with Uncertain Episode Lengths

AAAI 2023 · Bandits and online learning › RL theory and MDPs · approach: Linear function approximation in RL · 2 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 generalized value iteration with the episode-length distribution and an effective horizon instead of fixed-horizon UCB-VIUCB-VI on Taxi · Taxi, geometric discounting (γ = 0.95 and 0.975) and quasi-hyperbolic discounting (all tested β)regretHelped
Use generalized value iteration with the episode-length distribution and an effective horizon instead of fixed-horizon UCB-VIUCB-VI on Taxi · Taxi, polynomial discountingregretNo clear effect
Estimate the unknown episode-length distribution over timeUCB-VI Generalized · Geometric discountingregret upper bound: \widetilde{O}\left({\sqrt{SAT}}/{(1-\gamma)^{1.5}} \right)No clear effect
Estimate the unknown episode-length distribution over timeUCB-VI Generalized · Polynomial discounting, p ≥ 2regret upper bound: \widetilde{O}\left(\sqrt{SA} T^{\frac{p+1}{2p}} \right) versus \widetilde{O}\left( S^{1/2} A^{1/2} T^{\frac{1}{2-1/p}} \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