Optimal Transport

Aligning Multilingual News for Stock Return Prediction ArXiv ID: 2510.19203 “View on arXiv” Authors: Yuntao Wu, Lynn Tao, Ing-Haw Cheng, Charles Martineau, Yoshio Nozawa, John Hull, Andreas Veneris Abstract News spreads rapidly across languages and regions, but translations may lose subtle nuances. We propose a method to align sentences in multilingual news articles using optimal transport, identifying semantically similar content across languages. We apply this method to align more than 140,000 pairs of Bloomberg English and Japanese news articles covering around 3500 stocks in Tokyo exchange over 2012-2024. Aligned sentences are sparser, more interpretable, and exhibit higher semantic similarity. Return scores constructed from aligned sentences show stronger correlations with realized stock returns, and long-short trading strategies based on these alignments achieve 10% higher Sharpe ratios than analyzing the full text sample. ...

Non-conservative optimal transport ArXiv ID: 2510.03332 “View on arXiv” 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. ...

Conditional Risk Minimization with Side Information: A Tractable, Universal Optimal Transport Framework ArXiv ID: 2509.23128 “View on arXiv” Authors: Xinqiao Xie, Jonathan Yu-Meng Li Abstract Conditional risk minimization arises in high-stakes decisions where risk must be assessed in light of side information, such as stressed economic conditions, specific customer profiles, or other contextual covariates. Constructing reliable conditional distributions from limited data is notoriously difficult, motivating a series of optimal-transport-based proposals that address this uncertainty in a distributionally robust manner. Yet these approaches remain fragmented, each constrained by its own limitations: some rely on point estimates or restrictive structural assumptions, others apply only to narrow classes of risk measures, and their structural connections are unclear. We introduce a universal framework for distributionally robust conditional risk minimization, built on a novel union-ball formulation in optimal transport. This framework offers three key advantages: interpretability, by subsuming existing methods as special cases and revealing their deep structural links; tractability, by yielding convex reformulations for virtually all major risk functionals studied in the literature; and scalability, by supporting cutting-plane algorithms for large-scale conditional risk problems. Applications to portfolio optimization with rank-dependent expected utility highlight the practical effectiveness of the framework, with conditional models converging to optimal solutions where unconditional ones clearly do not. ...

Nested Optimal Transport Distances ArXiv ID: 2509.06702 “View on arXiv” Authors: Ruben Bontorno, Songyan Hou Abstract Simulating realistic financial time series is essential for stress testing, scenario generation, and decision-making under uncertainty. Despite advances in deep generative models, there is no consensus metric for their evaluation. We focus on generative AI for financial time series in decision-making applications and employ the nested optimal transport distance, a time-causal variant of optimal transport distance, which is robust to tasks such as hedging, optimal stopping, and reinforcement learning. Moreover, we propose a statistically consistent, naturally parallelizable algorithm for its computation, achieving substantial speedups over existing approaches. ...

Solvability of the Gaussian Kyle model with imperfect information and risk aversion ArXiv ID: 2501.16488 “View on arXiv” Authors: Unknown Abstract We investigate a Kyle model under Gaussian assumptions where a risk-averse informed trader has imperfect information on the fundamental price of an asset. We show that an equilibrium can be constructed by considering an optimal transport problem that is solved under a measure that renders the utility of the informed trader martingale and a filtering problem under the historical measure. ...

MOT: A Mixture of Actors Reinforcement Learning Method by Optimal Transport for Algorithmic Trading ArXiv ID: 2407.01577 “View on arXiv” Authors: Unknown Abstract Algorithmic trading refers to executing buy and sell orders for specific assets based on automatically identified trading opportunities. Strategies based on reinforcement learning (RL) have demonstrated remarkable capabilities in addressing algorithmic trading problems. However, the trading patterns differ among market conditions due to shifted distribution data. Ignoring multiple patterns in the data will undermine the performance of RL. In this paper, we propose MOT,which designs multiple actors with disentangled representation learning to model the different patterns of the market. Furthermore, we incorporate the Optimal Transport (OT) algorithm to allocate samples to the appropriate actor by introducing a regularization loss term. Additionally, we propose Pretrain Module to facilitate imitation learning by aligning the outputs of actors with expert strategy and better balance the exploration and exploitation of RL. Experimental results on real futures market data demonstrate that MOT exhibits excellent profit capabilities while balancing risks. Ablation studies validate the effectiveness of the components of MOT. ...

Optimal Automated Market Makers: Differentiable Economics and Strong Duality ArXiv ID: 2402.09129 “View on arXiv” Authors: Unknown Abstract The role of a market maker is to simultaneously offer to buy and sell quantities of goods, often a financial asset such as a share, at specified prices. An automated market maker (AMM) is a mechanism that offers to trade according to some predetermined schedule; the best choice of this schedule depends on the market maker’s goals. The literature on the design of AMMs has mainly focused on prediction markets with the goal of information elicitation. More recent work motivated by DeFi has focused instead on the goal of profit maximization, but considering only a single type of good (traded with a numeraire), including under adverse selection (Milionis et al. 2022). Optimal market making in the presence of multiple goods, including the possibility of complex bundling behavior, is not well understood. In this paper, we show that finding an optimal market maker is dual to an optimal transport problem, with specific geometric constraints on the transport plan in the dual. We show that optimal mechanisms for multiple goods and under adverse selection can take advantage of bundling, both improved prices for bundled purchases and sales as well as sometimes accepting payment “in kind.” We present conjectures of optimal mechanisms in additional settings which show further complex behavior. From a methodological perspective, we make essential use of the tools of differentiable economics to generate conjectures of optimal mechanisms, and give a proof-of-concept for the use of such tools in guiding theoretical investigations. ...

The Martingale Sinkhorn Algorithm ArXiv ID: 2310.13797 “View on arXiv” Authors: Unknown Abstract We develop a numerical method for the martingale analogue of the Benamou-Brenier optimal transport problem, which seeks a martingale interpolating two prescribed marginals which is closest to the Brownian motion. Recent contributions have established existence and uniqueness for the optimal martingale under finite second moment assumptions on the marginals, but numerical methods exist only in the one-dimensional setting. We introduce an iterative scheme, a martingale analogue of the celebrated Sinkhorn algorithm, and prove its convergence in arbitrary dimension under minimal assumptions. In particular, we show that convergence holds when the marginals have finite moments of order $p > 1$, thereby extending the known theory beyond the finite-second-moment regime. The proof relies on a strict descent property for the dual value of the martingale Benamou–Brenier problem. While the descent property admits a direct verification in the case of compactly supported marginals, obtaining uniform control on the iterates without assuming compact support is substantially more delicate and constitutes the main technical challenge. ...

An optimal transport approach for the multiple quantile hedging problem ArXiv ID: 2308.01121 “View on arXiv” Authors: Unknown Abstract We consider the multiple quantile hedging problem, which is a class of partial hedging problems containing as special examples the quantile hedging problem (F{“ö”}llmer & Leukert 1999) and the PnL matching problem (introduced in Bouchard & Vu 2012). In complete non-linear markets, we show that the problem can be reformulated as a kind of Monge optimal transport problem. Using this observation, we introduce a Kantorovitch version of the problem and prove that the value of both problems coincide. In the linear case, we thus obtain that the multiple quantile hedging problem can be seen as a semi-discrete optimal transport problem, for which we further introduce the dual problem. We then prove that there is no duality gap, allowing us to design a numerical method based on SGA algorithms to compute the multiple quantile hedging price. ...