Pith. sign in

REVIEW 3 cited by

Q-Ensemble for Offline RL: Don't Scale the Ensemble, Scale the Batch Size

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 2211.11092 v2 pith:PHDLNRYI submitted 2022-11-20 cs.LG cs.AIcs.NE

classification cs.LGcs.AIcs.NE
keywords trainingdurationlearningofflineq-ensemblesizedeepintroduced
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Training large neural networks is known to be time-consuming, with the learning duration taking days or even weeks. To address this problem, large-batch optimization was introduced. This approach demonstrated that scaling mini-batch sizes with appropriate learning rate adjustments can speed up the training process by orders of magnitude. While long training time was not typically a major issue for model-free deep offline RL algorithms, recently introduced Q-ensemble methods achieving state-of-the-art performance made this issue more relevant, notably extending the training duration. In this work, we demonstrate how this class of methods can benefit from large-batch optimization, which is commonly overlooked by the deep offline RL community. We show that scaling the mini-batch size and naively adjusting the learning rate allows for (1) a reduced size of the Q-ensemble, (2) stronger penalization of out-of-distribution actions, and (3) improved convergence time, effectively shortening training duration by 3-4x times on average.

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. Conservative Query and Adaptive Regularization for Offline RL Under Uncertainty Estimation

    cs.LG 2026-07 reject novelty 6.0 of 10

    CQ2L uses Morse-network uncertainty to select in-distribution action queries and to scale CQL's regularization, reporting higher D4RL scores than the prior OAP method.

  2. 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.

  3. Scaling DRL for Decision Making: A Survey on Data, Network, and Training Budget Strategies

    cs.LG 2025-08 conditional novelty 4.0 of 10

    A survey that categorizes deep reinforcement learning scaling strategies into data, network, and training budget dimensions and outlines challenges for scaling DRL systems.

Pith tools