atlas

Research map / Reinforcement learning / MDPs and planning

Sample-Efficient Reinforcement Learning of Undercomplete POMDPs

NeurIPS 2020 · Reinforcement learning › MDPs and planning · approach: POMDP policy optimization · 7 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 OOM-UCB with optimistic exploration and observable-operator confidence setsUndercomplete episodic finite POMDPs · Undercomplete episodic finite POMDPssample complexity for an ε-optimal policy: poly(H, S, A, O, α^{-1})/ε^2Helped
Use the specialized algorithm for deterministic transitionsDeterministic-transition POMDPs · Deterministic-transition POMDPssample complexity for an ε-optimal policy: O(H^2SA log(HSA/p)/(min{ε/(√O H),ξ})^2)Helped
Allow more latent states than observationsPOMDP reinforcement learning · Overcomplete POMDPssample complexity: Ω(A^{H-1})Hurt
Remove the lower bound on the minimum singular value of the observation matricesPOMDP reinforcement learning · Undercomplete POMDPssample complexity: Ω(A^{H-1})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