atlas

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

Kernel-Based Reinforcement Learning: A Finite-Time Analysis

ICML 2021 · 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 expert knowledge of room translation invariance in the kernel metric (ablation)Lip-UCBVI · Continuous two-room grid-worldsum of rewards / learning speedHelped
Kernel-based (Lip-UCBVI) instead of uniform discretization baselinesLip-UCBVI · Continuous two-room grid-worldsum of rewardsHelped
Larger kernel bias (bandwidth) for faster early learning, at cost of asymptotic performanceLip-UCBVI · Continuous two-room grid-worldsum of rewardsMixed
Replace full planning with RTDP-style incremental planning (Lip-UCBVI-Greedy)Lip-UCBVI · Theory: regret boundregret orderNo 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