Pith. sign in

REVIEW 3 cited by

PROTO: Iterative Policy Regularized Offline-to-Online Reinforcement Learning

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 2305.15669 v1 pith:XHPEH5OA submitted 2023-05-25 cs.LG cs.AIcs.RO

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

Offline-to-online reinforcement learning (RL), by combining the benefits of offline pretraining and online finetuning, promises enhanced sample efficiency and policy performance. However, existing methods, effective as they are, suffer from suboptimal performance, limited adaptability, and unsatisfactory computational efficiency. We propose a novel framework, PROTO, which overcomes the aforementioned limitations by augmenting the standard RL objective with an iteratively evolving regularization term. Performing a trust-region-style update, PROTO yields stable initial finetuning and optimal final performance by gradually evolving the regularization term to relax the constraint strength. By adjusting only a few lines of code, PROTO can bridge any offline policy pretraining and standard off-policy RL finetuning to form a powerful offline-to-online RL pathway, birthing great adaptability to diverse methods. Simple yet elegant, PROTO imposes minimal additional computation and enables highly efficient online finetuning. Extensive experiments demonstrate that PROTO achieves superior performance over SOTA baselines, offering an adaptable and efficient offline-to-online RL framework.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. The Three Regimes of Offline-to-Online Reinforcement Learning

    cs.LG 2025-10 conditional novelty 6.0 of 10

    Offline-to-online fine-tuning works best when the chosen method preserves the stronger of the pretrained policy or the offline dataset; a three-regime taxonomy organizes these choices.

  2. Online Pre-Training for Offline-to-Online Reinforcement Learning

    cs.LG 2025-07 conditional novelty 6.0 of 10

    A new 'online pre-training' phase trains a second value function that is then blended with the offline one during fine-tuning, improving offline-to-online RL across D4RL benchmarks.

  3. Safe Domain Randomization via Uncertainty-Aware Out-of-Distribution Detection and Policy Adaptation

    cs.LG 2025-07 conditional novelty 6.0 of 10

    UARL gates policy deployment on ensemble critic variance computed on a target-domain dataset, iteratively expanding domain randomization until the uncertainty threshold is met.

Pith tools