Pith. sign in

REVIEW 1 cited by

Reverb: A Framework For Experience Replay

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 2102.04736 v1 pith:3GMTRHG5 submitted 2021-02-09 cs.LG cs.AIcs.DC

classification cs.LGcs.AIcs.DC
keywords reverbexperiencereplaybufferdatadesignedelementsperformance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A central component of training in Reinforcement Learning (RL) is Experience: the data used for training. The mechanisms used to generate and consume this data have an important effect on the performance of RL algorithms. In this paper, we introduce Reverb: an efficient, extensible, and easy to use system designed specifically for experience replay in RL. Reverb is designed to work efficiently in distributed configurations with up to thousands of concurrent clients. The flexible API provides users with the tools to easily and accurately configure the replay buffer. It includes strategies for selecting and removing elements from the buffer, as well as options for controlling the ratio between sampled and inserted elements. This paper presents the core design of Reverb, gives examples of how it can be applied, and provides empirical results of Reverb's performance characteristics.

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. Advancing Geometry with AI: Multi-agent Generation of Polytopes

    math.CO 2025-01 conditional novelty 7.0 of 10

    An AI-guided search produced a 24-vertex width-6 prismatoid, giving a 19-dimensional non-Hirsch polytope, the smallest known, plus new bounds for monotone paths and neighbourly polytopes.

Pith tools