atlas

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

Randomized Exploration in Reinforcement Learning with General Value Function Approximation

ICML 2021 · Bandits and online learning › RL theory and MDPs · approach: Linear function approximation in RL · 3 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 multiple independently reward-perturbed regressions and take the maximum estimateLSVI-PHE · 12-state RiverSwim, H=40per-episode returnNo clear effect
Use multiple independently reward-perturbed regressions and take the maximum estimateLSVI-PHE · 10×10 DeepSeaper-episode returnNo clear effect
Increase the number of perturbation samples M (ablation)LSVI-PHE · 10×10 DeepSeaper-episode returnHelped
Set M=1 and σ²=1, reducing optimistic reward sampling to RLSVI (ablation)LSVI-PHE · Hard exploration tasksperformanceNo 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