mlsanityData to 7 Oct 2026

Hindsight Expectation Maximization for Goal-conditioned Reinforcement Learning

arXiv 2006.07549 ↗First posted 13 Jun 2020cs.LG stat.MLcited by 12

Not on the map. Why?

Abstract (arXiv)

We propose a graphical model framework for goal-conditioned RL, with an EM algorithm that operates on the lower bound of the RL objective. The E-step provides a natural interpretation of how 'learning in hindsight' techniques, such as HER, to handle extremely sparse goal-conditioned rewards. The M-step reduces policy optimization to supervised learning updates, which greatly stabilizes end-to-end training on high-dimensional inputs such as images. We show that the combined algorithm, hEM significantly outperforms model-free baselines on a wide range of goal-conditioned benchmarks with sparse rewards.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 5; 2023: 1; 2024: 2; 2025: 2.

12 papers.