atlas

Research map / Reinforcement learning / MDPs and planning

Efficient Reinforcement Learning in Factored MDPs with Application to Constrained RL

ICLR 2021 · Reinforcement learning › MDPs and planning · approach: Offline RL sample complexity · 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 factorized empirical-variance confidence bonuses and refined variance decompositionFMDP-BF · Episodic FMDPregret upper bound: by a factor of \sqrt{nH\Gamma}Helped
Apply the refined variance decomposition theoremFMDP-BF compared with concurrent UCBVI and EULER methods · Episodic FMDPregret upper bound: by a factor of $\sqrt{n}$Helped
Represent remaining budget as factored state and estimate the cost distributionFMDP-BF for RLwK · RL with knapsack constraintsregret upper bound: O\left(\sqrt{HSA(1+dBm)T}\right) to roughly $O\left(\sqrt{HdSAT}\right)$Helped
Use Hoeffding-type instead of empirical-variance confidence bonusesFMDP-CH relative to FMDP-BF · Episodic FMDPregret upper boundHurt

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