AI Paper Atlas

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

Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound

ICML 2020 · Bandits and online learning › RL theory and MDPs · approach: Linear function approximation in RL · 37 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 a Frobenius-norm confidence ball instead of the 2-1 norm ball, under stronger feature regularity (ablation)UC-MatrixRL · Online episodic MDP, feature spaceregret upper bound: O[√(Cψ(CM + {C′ψ}²) · ln(CφT)] · H² · √(d³T) -> O[√(Cψ(CM + {C′ψ}²) · ln(CφT)] · dH² · √THelped
Represent features through kernel functions rather than explicit feature vectors (ablation)MatrixRL · Online episodic MDP, kernel spaceregret upper bound: O(Cψ · ||P||Hφ×Hψ · log(T) · d̃ · H² · √T)Helped
Replace maximization over the confidence ball with the stated closed-form confidence bound (ablation)UC-MatrixRL · Online episodic MDP, feature spaceregret upper boundNo clear effect
Add optimistic reward estimation when rewards are unknown and linearly parameterized (ablation)MatrixRL · Online episodic MDP with unknown linear rewardsregret: an extra Õ(d√T) regretHurt

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