mlsanityData to 7 Oct 2026

The Wasserstein Believer: Learning Belief Updates for Partially Observable Environments through Reliable Latent Space Models

arXiv 2303.03284 ↗First posted 6 Mar 2023cs.LG cs.AIcited by 9

Not on the map. Why?

Abstract (arXiv)

Partially Observable Markov Decision Processes (POMDPs) are used to model environments where the full state cannot be perceived by an agent. As such the agent needs to reason taking into account the past observations and actions. However, simply remembering the full history is generally intractable due to the exponential growth in the history space. Maintaining a probability distribution that models the belief over what the true state is can be used as a sufficient statistic of the history, but its computation requires access to the model of the environment and is often intractable. While SOTA algorithms use Recurrent Neural Networks to compress the observation-action history aiming to learn a sufficient statistic, they lack guarantees of success and can lead to sub-optimal policies. To overcome this, we propose the Wasserstein Belief Updater, an RL algorithm that learns a latent model of the POMDP and an approximation of the belief update. Our approach comes with theoretical guarantees on the quality of our approximation ensuring that our outputted beliefs allow for learning the optimal value function.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 28 of its 76 references that are in the map. First posted on arXiv 6 Mar 2023.

Builds on

28 of 76 references.

References · 28

  1. 2017Neural Discrete Representation Learningcited by 4,650
  2. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  3. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
  4. 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,341
  5. 2017Improved Training of Wasserstein GANscited by 2,223
  6. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
  7. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  8. 2019Dream to Control: Learning Behaviors by Latent Imaginationcited by 1,598
  9. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
  10. 2020Mastering Atari with Discrete World Modelscited by 990
  11. 2016Conditional Image Generation with PixelCNN Decoderscited by 859
  12. 2017Masked Autoregressive Flow for Density Estimationcited by 680
16 more
  1. 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 457
  2. 2017Wasserstein Auto-Encoderscited by 371
  3. 2019Stochastic Latent Actor-Critic: Deep Reinforcement Learning with a Latent Variable Modelcited by 228
  4. 2019DeepMDP: Learning Continuous Latent Space Models for Representation Learningcited by 204
  5. 2018Deep Variational Reinforcement Learning for POMDPscited by 122
  6. 2020Machine Learning in Python: Main developments and technology trends in data science, machine learning, and artificial intelligencecited by 81
  7. 2022Partially Observable Markov Decision Processes in Robotics: A Surveycited by 81
  8. 2019Shaping Belief States with Generative Environment Models for RLcited by 65
  9. 2023POPGym: Benchmarking Partially Observable Reinforcement Learningcited by 59
  10. 2018Temporal Difference Variational Auto-Encodercited by 48
  11. 2019Particle Filter Recurrent Neural Networkscited by 36
  12. 2020Steady State Analysis of Episodic Reinforcement Learningcited by 21
  13. 2022Flow-based Recurrent Belief State Learning for POMDPscited by 16
  14. 2014Optimal Cost Almost-sure Reachability in POMDPscited by 12
  15. 2022Recurrent networks, hidden states and beliefs in partially observable environmentscited by 11
  16. 2021Distillation of RL Policies with Formal Guarantees via Variational Abstraction of Markov Decision Processes (Technical Report)cited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 6; 2026: 1.

9 papers.