Pith. sign in

REVIEW 3 cited by

Revisiting the Minimalist Approach to Offline 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.09836 v2 pith:R2EKJTNV submitted 2023-05-16 cs.LG cs.AI

classification cs.LGcs.AI
keywords designofflinechoicesalgorithmsanalysislearningrebracrecent
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Recent years have witnessed significant advancements in offline reinforcement learning (RL), resulting in the development of numerous algorithms with varying degrees of complexity. While these algorithms have led to noteworthy improvements, many incorporate seemingly minor design choices that impact their effectiveness beyond core algorithmic advances. However, the effect of these design choices on established baselines remains understudied. In this work, we aim to bridge this gap by conducting a retrospective analysis of recent works in offline RL and propose ReBRAC, a minimalistic algorithm that integrates such design elements built on top of the TD3+BC method. We evaluate ReBRAC on 51 datasets with both proprioceptive and visual state spaces using D4RL and V-D4RL benchmarks, demonstrating its state-of-the-art performance among ensemble-free methods in both offline and offline-to-online settings. To further illustrate the efficacy of these design choices, we perform a large-scale ablation study and hyperparameter sensitivity analysis on the scale of thousands of experiments.

Discussion (0). Continue with ORCID 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. Generalizing Beyond Suboptimality: Offline Reinforcement Learning Learns Effective Scheduling through Random Solutions

    cs.LG 2025-09 conditional novelty 6.0 of 10

    An offline RL method for job shop scheduling learns competitive policies from random, suboptimal schedule data, sometimes outperforming policies trained on higher-quality genetic algorithm data.

  2. What Matters for Batch Online Reinforcement Learning in Robotics?

    cs.RO 2025-05 conditional novelty 6.0 of 10

    A recipe combining an imitation-trained diffusion policy, an IQL-learned Q-function, and implicit Q-guided action selection enables robots to self-improve from autonomous rollouts, outperforming imitation and filtered...

  3. Value Flows

    cs.LG 2025-10 reject novelty 5.0 of 10

    Value Flows fits the full return distribution in RL with a flow-matching critic and reweights its learning objective by estimated return variance; the central theoretical guarantee does not follow from the stated equations.

Pith tools