Pith. sign in

REVIEW 2 cited by

ENOTO: Improving Offline-to-Online Reinforcement Learning with Q-Ensembles

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.06871 v4 pith:CYQQSTDB submitted 2023-06-12 cs.LG cs.AIcs.RO

classification cs.LGcs.AIcs.RO
keywords learningoffline-to-onlineonlineperformanceofflineenotoexistingfine-tuning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Offline reinforcement learning (RL) is a learning paradigm where an agent learns from a fixed dataset of experience. However, learning solely from a static dataset can limit the performance due to the lack of exploration. To overcome it, offline-to-online RL combines offline pre-training with online fine-tuning, which enables the agent to further refine its policy by interacting with the environment in real-time. Despite its benefits, existing offline-to-online RL methods suffer from performance degradation and slow improvement during the online phase. To tackle these challenges, we propose a novel framework called ENsemble-based Offline-To-Online (ENOTO) RL. By increasing the number of Q-networks, we seamlessly bridge offline pre-training and online fine-tuning without degrading performance. Moreover, to expedite online performance enhancement, we appropriately loosen the pessimism of Q-value estimation and incorporate ensemble-based exploration mechanisms into our framework. Experimental results demonstrate that ENOTO can substantially improve the training stability, learning efficiency, and final performance of existing offline RL methods during online fine-tuning on a range of locomotion and navigation tasks, significantly outperforming existing offline-to-online RL methods.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning to Trust Bellman Updates: Selective State-Adaptive Regularization for Offline RL

    cs.LG 2025-05 conditional novelty 6.0 of 10

    SSAR replaces the fixed global regularization strength in offline RL with state-adaptive coefficients and applies regularization only to high-quality actions, improving D4RL performance over CQL and TD3+BC.

  2. Efficient Online RL Fine Tuning with Offline Pre-trained Policy Only

    cs.LG 2025-05 conditional novelty 6.0 of 10

    PORL fine-tunes a pre-trained policy online by first collecting epsilon-greedy interaction data and learning a fresh Q-function from scratch, removing the need for pre-trained critics or offline data.

Pith tools