AI Paper Atlas

Research map / Reinforcement learning / Offline RL

An Optimal Online Method of Selecting Source Policies for Reinforcement Learning

AAAI 2018 · Reinforcement learning › Offline RL · approach: Offline RL sample complexity theory · 30 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 UCB1 to select source policies online and combine the selected policy with random actionsQ-learning with policy reuse · Grid-based robot navigation, target task Ωaverage evaluation rewardHelped
Use online source-policy selection with a decreasing reuse probabilityQ-learning with policy reuse · Grid-based robot navigation, randomly selected target tasksaverage evaluation rewardHelped
Retain ε-greedy exploration as source-policy reuse decreasesQ-learning with policy reuse · Grid-based robot navigation, target task Ω′ with no useful source policyaverage evaluation rewardNo clear effect
Continue exploration rather than stopping when the greedy policy beats source-policy rewardsQ-learning with policy reuse · Grid-based robot navigation, target task Ωsource-policy selection frequencyHelped

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