Paper: arXiv 2510.03332

Authors: Gabriela Kováčová, Georg Menz, Niket Patel

Abstract

Motivated by optimal re-balancing of a portfolio, we formalize an optimal transport problem in which the transported mass is scaled by a mass-change factor depending on the source and destination. This allows direct modeling of the creation or destruction of mass. We discuss applications and position the framework alongside unbalanced, entropic, and unnormalized optimal transport. The existence of optimal transport plans and strong duality are established. The existence of optimal maps are deduced in two central regimes, i.e., perturbative mass-change and quadratic mass-loss. For $\ell_p$ costs we derive the analogue of the Benamou-Brenier dynamic formulation.

Complexity vs Empirical Score

  • Math Complexity: 9.0/10
  • Empirical Rigor: 1.0/10
  • Quadrant: Lab Rats — theoretically deep, empirically untested

Why this score: The paper introduces a novel mathematical framework for non-conservative optimal transport with advanced proofs and derivations (e.g., strong duality, existence of optimal maps, Benamou-Brenier analogue), but provides only a conceptual financial motivation without any backtesting, datasets, or implementation details.

Research Flowchart

  flowchart TD
  A["Research Goal<br>Formulate an optimal transport problem<br>modeling mass creation/destruction"] --> B["Methodology<br>Formalize framework with<br>mass-change factor μ(x,y)"]
  B --> C["Inputs<br>Portfolio rebalancing context<br>Unbalanced/Entropic OT benchmarks"]
  C --> D["Computational Process<br>Establish existence & strong duality<br>Derive Benamou-Brenier dynamics"]
  D --> E["Outcomes<br>Existence of optimal maps<br>perturbative & quadratic regimes"]
  E --> F["Applications<br>Multi-asset portfolio optimization<br>General mass-modifying transport"]

Cited References (32)

  1. Gradient flows: in metric spaces and in the space of probability measures (2008)
  2. A computational fluid mechanics solution to the M onge- K antorovich mass transfer problem (2000)
  3. Characterization of optimal shapes and masses through M onge- K antorovich equation (2001)
  4. Portfolio selection with transaction costs (1990)
  5. Extended K antorovich norms: a tool for optimization (2002)
  6. An extension of the K antorovich norm (1999)
  7. Optimal rebalancing of portfolios with transaction costs (2013)
  8. Markets with Transaction Costs Mathematical Theory (2009)
and 24 more
  1. On a functional space and certain extremum problems (1957)
  2. On a space of totally additive functions (1958)
  3. A new optimal transport distance on the space of finite R adon measures (2016)
  4. Optimal portfolio management with fixed transaction costs (1995)
  5. Topics in Optimal Transportation (2003)
  6. Optimal transport: old and new (2008)
  7. Convex Analysis (1970)
  8. Optimal Transport for Applied Mathematicians (2015)
  9. Free Boundaries in Optimal Transport and the Optimal Partial Transport Problem (2010) — link
  10. On the Regularity of the Free Boundary in the Optimal Partial Transport Problem (2013) — link
  11. Optimal Entropy‐Transport Problems and the H ellinger– K antorovich Distance (2018) — link
  12. An interpolating distance between optimal transport and F isher– R ao metrics (2018)
  13. Unbalanced Optimal Transport: Dynamic and K antorovich Formulations (2018) — link
  14. Scaling Algorithms for Unbalanced Transport Problems (2021) — link
  15. Neural Unbalanced Optimal Transport via Cycle-Consistent Semi-Couplings (2022) — link
  16. M 'e moire sur la th 'e orie des d 'e blais et des remblais (1781)
  17. Normalized Wasserstein Distance for Mixture Distributions with Applications in Adversarial Learning and Domain Adaptation (2019) — link
  18. Unnormalized optimal transport (2019)
  19. On translation of mass (in R ussian), Dokl (1942)
  20. Principles of Mathematical Analysis (1976) — link
  21. Chapter 12 - U nbalanced O ptimal T ransport, from theory to numerics (2023) — link
  22. Fundamentals of Convex Analysis and Optimization : A Supremum Function Approach (2023)
  23. Introduction to algorithms (2009)
  24. Information geometry in portfolio theory (2019)

0 of 32 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2518 linked papers.