Free probability via entropic optimal transport
Octavio Arizmendi, Samuel G. G. Johnston

TL;DR
This paper establishes a novel connection between free probability operations and entropic optimal transport, providing explicit formulas, new inequalities, and a large deviation principle approach to analyze free convolutions.
Contribution
It introduces entropic optimal transport formulations for free probability measures, enabling explicit computation of free convolutions and deriving new inequalities relating free and classical operations.
Findings
Explicit formulas for free convolutions via entropic optimal transport
New inequalities linking free and classical convolutions
Explicit computation of optimal couplings for free probability operations
Abstract
Let and be probability measures on with compact support, and let denote their additive free convolution. We show that for greater than the sum of essential suprema of and , we have \begin{equation*} \int_{-\infty}^\infty \log(z - x) \mu \boxplus \nu (\mathrm{d}x) = \sup_{\Pi} \left\{ \mathbf{E}_\Pi[\log(z - (X+Y)] - H(\Pi|\mu \otimes \nu) \right\}, \end{equation*} where the supremum is taken over all couplings of the probability measures and , and denotes the relative entropy of a coupling against product measure. We prove similar formulas for the multiplicative free convolution and the free compression of probability measures, as well as for multivariate free operations. Thus the integrals of a log-potential against the fundamental…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Diffusion and Search Dynamics · Statistical Mechanics and Entropy
