Wasserstein Formulation of Reinforcement Learning. An Optimal Transport Perspective on Policy Optimization

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Dus, Mathias
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866917413263507456
author Dus, Mathias
author_facet Dus, Mathias
contents We present a geometric framework for Reinforcement Learning (RL) that views policies as maps into the Wasserstein space of action probabilities. First, we define a Riemannian structure induced by stationary distributions, proving its existence in a general context. We then define the tangent space of policies and characterize the geodesics, specifically addressing the measurability of vector fields mapped from the state space to the tangent space of probability measures over the action space. Next, we formulate a general RL optimization problem and construct a gradient flow using Otto's calculus. We compute the gradient and the Hessian of the energy, providing a formal second-order analysis. Finally, we illustrate the method with numerical examples for low-dimensional problems, computing the gradient directly from our theoretical formalism. For high-dimensional problems, we parameterize the policy using a neural network and optimize it based on an ergodic approximation of the cost.
format Preprint
id arxiv_https___arxiv_org_abs_2604_14765
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Wasserstein Formulation of Reinforcement Learning. An Optimal Transport Perspective on Policy Optimization
Dus, Mathias
Machine Learning
Optimization and Control
Probability
We present a geometric framework for Reinforcement Learning (RL) that views policies as maps into the Wasserstein space of action probabilities. First, we define a Riemannian structure induced by stationary distributions, proving its existence in a general context. We then define the tangent space of policies and characterize the geodesics, specifically addressing the measurability of vector fields mapped from the state space to the tangent space of probability measures over the action space. Next, we formulate a general RL optimization problem and construct a gradient flow using Otto's calculus. We compute the gradient and the Hessian of the energy, providing a formal second-order analysis. Finally, we illustrate the method with numerical examples for low-dimensional problems, computing the gradient directly from our theoretical formalism. For high-dimensional problems, we parameterize the policy using a neural network and optimize it based on an ergodic approximation of the cost.
title Wasserstein Formulation of Reinforcement Learning. An Optimal Transport Perspective on Policy Optimization
topic Machine Learning
Optimization and Control
Probability
url https://arxiv.org/abs/2604.14765