Pith. sign in

REVIEW 3 cited by

The Challenges of Exploration for 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 2201.11861 v2 pith:Q6DVXAVL submitted 2022-01-27 cs.LG

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

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Offline Reinforcement Learning (ORL) enablesus to separately study the two interlinked processes of reinforcement learning: collecting informative experience and inferring optimal behaviour. The second step has been widely studied in the offline setting, but just as critical to data-efficient RL is the collection of informative data. The task-agnostic setting for data collection, where the task is not known a priori, is of particular interest due to the possibility of collecting a single dataset and using it to solve several downstream tasks as they arise. We investigate this setting via curiosity-based intrinsic motivation, a family of exploration methods which encourage the agent to explore those states or transitions it has not yet learned to model. With Explore2Offline, we propose to evaluate the quality of collected data by transferring the collected data and inferring policies with reward relabelling and standard offline RL algorithms. We evaluate a wide variety of data collection strategies, including a new exploration agent, Intrinsic Model Predictive Control (IMPC), using this scheme and demonstrate their performance on various tasks. We use this decoupled framework to strengthen intuitions about exploration and the data prerequisites for effective offline RL.

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. Unsupervised Data Generation for Offline Reinforcement Learning: A Perspective from Model

    cs.LG 2025-06 conditional novelty 5.0 of 10

    Training a diverse set of policies, relabeling their experience with the target reward, and selecting the highest-return buffer improves model-based offline RL on unknown tasks, supported by a Wasserstein-distance analysis.

  2. Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity

    cs.LG 2025-06 conditional novelty 4.0 of 10

    Applying single-shot SNIP pruning with dataset-size-dependent sparsity reduces overfitting and improves episodic return of offline RL algorithms on 5k to 100k sample D4RL continuous control tasks.

  3. Iterative Batch Reinforcement Learning via Safe Diversified Model-based Policy Search

    cs.LG 2024-11 conditional novelty 4.0 of 10

    An iterative batch RL method combining model-based policy search with minimum pairwise trajectory diversity and behavior-based safety constraints speeds up cost reduction across batch iterations in Industrial Benchmar...

Pith tools