Paperlane

no. 16 · Tuesday 17 November 2026

A convex approach for Markov chain estimation from aggregate data via inverse optimal transport

Michele Mascherpa, Axel Ringh, Amirhossein Taghvaei and Johan Karlsson

math.OC · v2 · 10 pp

Abstract

We address the problem of identifying the dynamical law governing the evolution of a population of indistinguishable particles, when only aggregate distributions at successive times are observed. Assuming a Markovian evolution on a discrete state space, the task reduces to estimating the underlying transition probability matrix from distributional data. We formulate this inverse problem within the framework of entropic optimal transport, as a joint optimization over the transition matrix and the transport plans connecting successive distributions. This formulation results in a convex optimization problem, and we propose an efficient iterative algorithm based on the entropic proximal method. We illustrate the accuracy and convergence of the method in two numerical setups, considering estimation from independent snapshots and estimation from a time series of aggregate observations, respectively.

comments
10 pages, 5 figures. Published in European Journal of Control
journal
European Journal of Control, 101592 (2026)
fields
Optimization and Control
pdf ↗ page arXiv:2511.16458 ↗