Author
Michael D. Goldman
Recent research
- AI & ComputingOpen access
Subadditivity and optimal matching of unbounded samples
We obtain new bounds for the optimal matching cost for empirical measures with unbounded support. For a large class of radially symmetric and rapidly decaying probability laws, we prove for the first time the asymptotic rate of convergence for the whole range of power exponents p...