The variance conjecture for entropy-regularized optimal transport maps

About 3 years old · traced to

Let μ\mu and ν\nu be subGaussian measures. Let T1,mT_{1,m} denote a single map term based on mm samples, and let T^n\hat{T}_n denote the resulting estimator based on n=kmn=km samples, where kk is the number of terms. The norm is the L2(μ)L^2(\mu) norm and expectations are over the sampling procedure.

Variance conjecture.

E∥T1,m−E[T1,m]∥L2(μ)2≲1m.\mathbb{E}\left\lVert T_{1,m}-\mathbb{E}[T_{1,m}]\right\rVert_{L^2(\mu)}^2\lesssim \frac{1}{m}.

Equivalently,

E∥T^n−E[T^n]∥L2(μ)2≲1k⋅1m=1n,\mathbb{E}\left\lVert\hat{T}_n-\mathbb{E}[\hat{T}_n]\right\rVert_{L^2(\mu)}^2\lesssim \frac{1}{k}\cdot\frac{1}{m}=\frac{1}{n},

with a constant independent of mm, kk, and nn.

The conjecture concerns the empirically observed variance decay for subGaussian source and target measures. A positive answer would improve the variance contribution in the estimator's bias-variance analysis from order k−1k^{-1} to order n−1n^{-1}, and would improve the resulting convergence rates. It remains open according to the source.

References

Primary source

Matthew Werenski, James M. Murphy and Shuchin Aeron, “Estimation of entropy-regularized optimal transport maps between non-compactly supported measures”, arXiv:2311.11934 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.