atlas

Research map / Reinforcement learning / Offline RL

From Static Policies to Adaptive Priors in Offline Reinforcement Learning

NeurIPS 2026 · Reinforcement learning › Offline RL · approach: Offline RL sample complexity theory · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Position paper arguing offline RL should learn adaptive policy priors that preserve memory, exploration, and self-correction for test-time adaptation and online fine-tuning, with Bayesian offline RL as a principled direction.

Problem

Classical offline RL optimizes policies for direct deployment under conservatism, leaving little capacity for improvement when the offline-trained policy is later updated through test-time adaptation or online interaction.

Approach

Reframe the objective of the offline stage as learning adaptive policy priors (formalized as adaptive offline RL, AORL) that retain memory, exploration, and self-correction, and motivate this via a Bayesian epistemic POMDP view where the offline posterior over MDPs serves as the prior for online inference.

Key results

Limitations

Experimental setup

Builds on: Bayes-adaptive MDPs offline-to-online RL conservative Q-learning Decision Transformer meta-RL

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