惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

有赞技术团队
有赞技术团队
美团技术团队
博客园 - 司徒正美
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
阮一峰的网络日志
阮一峰的网络日志
S
SegmentFault 最新的问题
博客园_首页
雷峰网
雷峰网
V
V2EX
The Cloudflare Blog
博客园 - 三生石上(FineUI控件)
量子位
Last Week in AI
Last Week in AI
人人都是产品经理
人人都是产品经理
爱范儿
爱范儿
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - 聂微东
V
Visual Studio Blog
Hugging Face - Blog
Hugging Face - Blog
博客园 - 【当耐特】
Jina AI
Jina AI
月光博客
月光博客
L
LangChain Blog

math.PR updates on arXiv.org

Visibility in the Boolean Model on Harmonic Manifolds Global estimates on the Brenier map Geodesics and Wandering Exponents in Brochette First-Passage Percolation State-dependent inverse-subordinator time changes of regenerative processes: Excursion structure and multiscale occupation-time limits Randomly twisted transfer operators and singular values statistics Generalized Bessel-Dunkl diffusions An almost sure invariance principle for the Takagi-van der Waerden class functions Central limit theorems for high dimensional lattice polytopes: cosmological polytopes Convergence rate estimates for semigroups and heat kernels associated with resistance forms Second-order Poincaré inequalities and localization on the Poisson space Maximum Probability of Independence in Transitive Matroids On global solutions to the semidiscrete stochastic heat equation The Poisson Tail Conjecture for primes in short intervals A Complete Spectral Analysis of the CEV Operator with Applications to Arbitrage Holographic functions and neural networks From Betting to Empirical Bernstein LIL Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise Pointwise Generalization in Deep Neural Networks Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors Wasserstein bounds for denoising diffusion probabilistic models via the Föllmer process A note on connections between the Föllmer process and the denoising diffusion probabilistic model Simple Approximation and Derivative Free Inference-Time Scaling for Diffusion Models via Sequential Monte Carlo on Path Measures Diffusion-Based Stochastic Operator Networks for Uncertainty Quantification in Stochastic Partial Differential Equations A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights Propagation of Chaos in Contextual Flow Maps Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures $α$-TCAV: A Unified Framework for Testing with Concept Activation Vectors Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model On the Limits of Latent Reuse in Diffusion Models State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives
Free probability via entropic optimal transport
Octavio Arizmendi, Samuel G. G. Johnston · 2023-09-22 · via math.PR updates on arXiv.org

Let $μ$ and $ν$ be probability measures on $\mathbb{R}$ with compact support, and let $μ\boxplus ν$ denote their additive free convolution. We show that for $z \in \mathbb{R}$ greater than the sum of essential suprema of $μ$ and $ν$, we have \begin{equation*} \int_{-\infty}^\infty \log(z - x) μ\boxplus ν(\mathrm{d}x) = \sup_Π \left\{ \mathbf{E}_Π[\log(z - (X+Y)] - H(Π|μ\otimes ν) \right\}, \end{equation*} where the supremum is taken over all couplings $Π$ of the probability measures $μ$ and $ν$, and $H(Π|μ\otimes ν)$ denotes the relative entropy of a coupling $Π$ against product measure. We prove similar formulas for the multiplicative free convolution $μ\boxtimes ν$ and the free compression $[μ]_τ$ of probability measures, as well as for multivariate free operations. Thus the integrals of a log-potential against the fundamental measure operations of free probability may be formulated in terms of entropic optimal transport problems. The optimal couplings in these variational descriptions of the free probability operations can be computed explicitly, and from these we can then deduce the standard $R$- and $S$-transform descriptions of additive and multiplicative free convolution. We use our optimal transport formulations to derive new inequalities relating free and classical operations on probability measures, such as the inequality \begin{equation*} \int_{-\infty}^\infty \log(z - x) μ\boxplus ν(\mathrm{d}x) \geq \int_{-\infty}^{\infty} \log(z-x) μ\ast ν( \mathrm{d}x) \end{equation*} relating free and classical convolution. Our approach is based on applying a large deviation principle on the symmetric group to the quadrature formulas of Marcus, Spielman and Srivastava.