Pith. sign in

REVIEW 1 cited by

Offline-to-Online Reinforcement Learning via Balanced Replay and Pessimistic Q-Ensemble

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 2107.00591 v2 pith:UZ3RM6UF submitted 2021-07-01 cs.RO cs.LG

classification cs.ROcs.LG
keywords offlineagentsbalancedduringinitiallearningonlinereinforcement
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Recent advance in deep offline reinforcement learning (RL) has made it possible to train strong robotic agents from offline datasets. However, depending on the quality of the trained agents and the application being considered, it is often desirable to fine-tune such agents via further online interactions. In this paper, we observe that state-action distribution shift may lead to severe bootstrap error during fine-tuning, which destroys the good initial policy obtained via offline RL. To address this issue, we first propose a balanced replay scheme that prioritizes samples encountered online while also encouraging the use of near-on-policy samples from the offline dataset. Furthermore, we leverage multiple Q-functions trained pessimistically offline, thereby preventing overoptimism concerning unfamiliar actions at novel states during the initial training phase. We show that the proposed method improves sample-efficiency and final performance of the fine-tuned robotic agents on various locomotion and manipulation tasks. Our code is available at: https://github.com/shlee94/Off2OnRL.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Dynamic Action Interpolation: A Universal Approach for Accelerating Reinforcement Learning with Expert Guidance

    cs.LG 2025-04 reject novelty 3.0 of 10

    Dynamic Action Interpolation linearly blends expert and RL actions with a time-decaying weight and claims faster learning and higher final rewards, but the supporting theory is asserted rather than derived.

Pith tools