paper-with-me

홈 › Papers

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

2023-03-06 · Raphael Avalos, Florent Delgrange, Ann Nowé, Guillermo A. Pérez, Diederik M. Roijers

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.

📄 PDF Abstract BibTeX arXiv:2303.03284

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Finite Memory Belief Approximation for Optimal Control in Partially Observable Markov Decision Processes

2026-01-06 · Mintae Kim arxiv

We study finite memory belief approximation for partially observable (PO) stochastic optimal control (SOC) problems. While belief states are sufficient for SOC in partially observable Markov decision processes (POMDPs), …

Neural Bayesian Filtering

2025-10-04 · Christopher Solinas, Radovan Haluska, David Sychrovsky, Finbarr Timbers 외 arxiv

We present Neural Bayesian Filtering (NBF), an algorithm for maintaining distributions over hidden states, called beliefs, in partially observable systems. NBF is trained to find a good latent representation of the belie…

Computational Efficiency

A Framework for Sequential Planning in Multi-Agent Settings

2011-09-09 · P. Doshi, P. J. Gmytrasiewicz

This paper extends the framework of partially observable Markov decision processes (POMDPs) to multi-agent settings by incorporating the notion of agent models into the state space. Agents maintain beliefs over physical …

Decision Making

Real-time Tracking System with Partially Coupled Sources

2025-03-27 · Saeid Sadeghi Vilni, Risto Wichman

We consider a pull-based real-time tracking system consisting of multiple partially coupled sources and a sink. The sink monitors the sources in real-time and can request one source for an update at each time instant. Th…

Learned Belief Search: Efficiently Improving Policies in Partially Observable Settings

2021-06-16 · Hengyuan Hu, Adam Lerer, Noam Brown, Jakob Foerster

Search is an important tool for computing effective policies in single- and multi-agent environments, and has been crucial for achieving superhuman performance in several benchmark fully and partially observable games. H…

counterfactual