Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2507.05893 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914201157500928 |
|---|---|
| author | Anderson, Edward J. Keehan, Dominic S. T. |
| author_facet | Anderson, Edward J. Keehan, Dominic S. T. |
| contents | We study the problem of estimating a sequence of evolving probability distributions from historical data, where the underlying distribution changes over time in a nonstationary and nonparametric manner. To capture gradual changes, we introduce a model that penalises large deviations between consecutive distributions using the Wasserstein distance. This leads to a method in which we estimate the underlying series of distributions by maximizing the log-likelihood of the observations with a penalty applied to the sum of the Wasserstein distances between consecutive distributions. We show how this can be reduced to a simple network-flow problem enabling efficient computation. We call this the Wasserstein Probability Flow method. We derive some properties of the optimal solutions and carry out numerical tests in different settings. Our results suggest that the Wasserstein Probability Flow method is a promising tool for applications such as nonstationary stochastic optimization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_05893 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Nonstationary Distribution Estimation via Wasserstein Probability Flows Anderson, Edward J. Keehan, Dominic S. T. Optimization and Control 62G05, 90C35 (Primary) 62M20, 62M10 (Secondary) We study the problem of estimating a sequence of evolving probability distributions from historical data, where the underlying distribution changes over time in a nonstationary and nonparametric manner. To capture gradual changes, we introduce a model that penalises large deviations between consecutive distributions using the Wasserstein distance. This leads to a method in which we estimate the underlying series of distributions by maximizing the log-likelihood of the observations with a penalty applied to the sum of the Wasserstein distances between consecutive distributions. We show how this can be reduced to a simple network-flow problem enabling efficient computation. We call this the Wasserstein Probability Flow method. We derive some properties of the optimal solutions and carry out numerical tests in different settings. Our results suggest that the Wasserstein Probability Flow method is a promising tool for applications such as nonstationary stochastic optimization. |
| title | Nonstationary Distribution Estimation via Wasserstein Probability Flows |
| topic | Optimization and Control 62G05, 90C35 (Primary) 62M20, 62M10 (Secondary) |
| url | https://arxiv.org/abs/2507.05893 |