mlsanityData to 14 Oct 2026

Organizing Experience: A Deeper Look at Replay Mechanisms for Sample-based Planning in Continuous State Domains

arXiv 1806.04624 ↗First posted 12 Jun 2018cs.AIcited by 19

Not on the map. Why?

Abstract (arXiv)

Model-based strategies for control are critical to obtain sample efficient learning. Dyna is a planning paradigm that naturally interleaves learning and planning, by simulating one-step experience to update the action-value function. This elegant planning strategy has been mostly explored in the tabular setting. The aim of this paper is to revisit sample-based planning, in stochastic and continuous domains with learned models. We first highlight the flexibility afforded by a model over Experience Replay (ER). Replay-based methods can be seen as stochastic planning methods that repeatedly sample from a buffer of recent agent-environment interactions and perform updates to improve data efficiency. We show that a model, as opposed to a replay buffer, is particularly useful for specifying which states to sample from during planning, such as predecessor states that propagate information in reverse from a state more quickly. We introduce a semi-parametric model learning approach, called Reweighted Experience Models (REMs), that makes it simple to sample next states or predecessors. We demonstrate that REM-Dyna exhibits similar advantages over replay-based methods in learning in continuous state problems, and that the performance gap grows when moving to stochastic domains, of increasing size.

Key facts. Cited by 19 papers in the map (data through 14 Oct 2026). First posted on arXiv 12 Jun 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2019: 1; 2020: 0; 2021: 7; 2022: 4; 2023: 1; 2024: 2; 2025: 1; 2026: 3.

19 papers.

Sort:

By area:

  1. 2023Sample-Efficient Multi-Objective Learning via Generalized Policy Improvement Prioritizationcited by 48
  2. 2022The Benefits of Model-Based Generalization in Reinforcement Learningcited by 17
  3. 2019Generative predecessor models for sample-efficient imitation learningcited by 14
  4. 2021Continual Learning In Environments With Polynomial Mixing Timescited by 14
  5. 2022Goal-Space Planning with Subgoal Modelscited by 12
  6. 2021Simplifying Deep Reinforcement Learning via Self-Supervisioncited by 9
  7. 2022Analysis of Stochastic Processes through Replay Bufferscited by 9
  8. 2021Improved Soft Actor-Critic: Mixing Prioritized Off-Policy Samples with On-Policy Experiencecited by 8
  9. 2021Revisiting Prioritized Experience Replay: A Value Perspectivecited by 7
  10. 2021Sim and Real: Better Togethercited by 7
  11. 2022No More Pesky Hyperparameters: Offline Hyperparameter Tuning for RLcited by 6
  12. 2024Investigating the Interplay of Prioritized Replay and Generalizationcited by 5
7 more
  1. 2025Clustering-Based Weight Orthogonalization for Stabilizing Deep Reinforcement Learningcited by 2
  2. 2026Value Bonuses using Ensemble Errors for Exploration in Reinforcement Learningcited by 1
  3. 2021Planning with Expectation Models for Controlcited by 0
  4. 2021Improving Experience Replay through Modeling of Similar Transitions' Setscited by 0
  5. 2024A New View on Planning in Online Reinforcement Learningcited by 0
  6. 2026Endpoint Replay: Compressing the Recency Buffer in Deep Reinforcement Learningcited by 0
  7. 2026Foundations of Reinforcement Learning and Control:Connections and New Perspectivescited by 0