On the Rate of Convergence of Empirical Measures in ∞-transportation Distance

From MaRDI portal
Publication:3458252

DOI10.4153/CJM-2014-044-6zbMath1355.60009arXiv1407.1157OpenAlexW2963388623MaRDI QIDQ3458252

Nicolás García Trillos, Dejan Slepčev

Publication date: 18 December 2015

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.1157




Related Items (45)

Consistency of modularity clustering on random geometric graphs\(L^\infty\) estimates in optimal mass transportationLocal Versions of Sum-of-Norms ClusteringOn the quadratic random matching problem in two-dimensional domainsFrom graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data cloudsParametrization of Random Vectors in Polynomial Chaos Expansions via Optimal TransportationContinuum Limits of Posteriors in Graph Bayesian Inverse ProblemsLarge data limit for a phase transition model with the p-Laplacian on point cloudsSparse optimization on measures with over-parameterized gradient descentReweighting samples under covariate shift using a Wasserstein distance criterionUnnamed ItemRobust estimation of superhedging pricesOptimal Cheeger cuts and bisections of random geometric graphsTractable reformulations of two-stage distributionally robust linear programs over the type-\(\infty\) Wasserstein ballRandom Walk Approximation for Irreversible Drift-Diffusion Process on Manifold: Ergodicity, Unconditional Stability and ConvergenceStein Variational Gradient Descent on Infinite-Dimensional Space and Applications to Statistical Inverse ProblemsConsistency of Dirichlet PartitionsOptimal Matching of Random Samples and Rates of Convergence of Empirical MeasuresOn the Gamma convergence of functionals defined over pairs of measures and energy-measuresA compactness theorem for functions on Poisson point cloudsTransition Path Theory for Langevin Dynamics on Manifolds: Optimal Control and Data-Driven SolverError estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operatorMumford–Shah functionals on graphs and their asymptoticsOptimal transport methods for combinatorial optimization over two random point setsApplications of No-Collision Transportation Maps in Manifold LearningAsymptotic analysis of the Ginzburg–Landau functional on point cloudsScaling Limit of the Stein Variational Gradient Descent: The Mean Field RegimeOn the Wasserstein distance between classical sequences and the Lebesgue measureGromov-Hausdorff limit of Wasserstein spaces on point cloudsUnderstanding the topology and the geometry of the space of persistence diagrams via optimal partial transportUnnamed ItemProperly-weighted graph Laplacian for semi-supervised learningThe shape of data and probability measuresA variational approach to the consistency of spectral clustering\({\mathcal{W}}_\infty \)-transport with discrete target as a combinatorial matching problemAnalysis of $p$-Laplacian Regularization in Semisupervised LearningOn the rate of convergence of empirical measure in $\infty $-Wasserstein distance for unbounded density functionLarge data and zero noise limits of graph-based semi-supervised learning algorithmsDistributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision makingA new analytical approach to consistency and overfitting in regularized empirical risk minimizationData-driven efficient solvers for Langevin dynamics on manifold in high dimensionsSharp Wasserstein estimates for integral sampling and Lorentz summability of transport densitiesVariational Limits of $k$-NN Graph-Based Functionals on Data CloudsContinuum limit of total variation on point cloudsTechnical Note—Two-Stage Sample Robust Optimization




This page was built for publication: On the Rate of Convergence of Empirical Measures in ∞-transportation Distance