Distribution of Distances based Object Matching: Asymptotic Inference
From MaRDI portal
Publication:6154012
Abstract: In this paper, we aim to provide a statistical theory for object matching based on the Gromov-Wasserstein distance. To this end, we model general objects as metric measure spaces. Based on this, we propose a simple and efficiently computable asymptotic statistical test for pose invariant object discrimination. This is based on an empirical version of a -trimmed lower bound of the Gromov-Wasserstein distance. We derive for distributional limits of this test statistic. To this end, we introduce a novel -type process indexed in and show its weak convergence. Finally, the theory developed is investigated in Monte Carlo simulations and applied to structural protein comparisons.
Cites work
- \(U\)-processes indexed by Vapnik-Červonenkis classes of functions with applications to asymptotics and bootstrap of \(U\)-statistics with estimated parameters
- \(U\)-processes, \(U\)-quantile processes and generalized linear statistics of dependent data
- A central limit theorem for Lp transportation cost on the real line with application to fairness assessment in machine learning
- A central limit theorem for Wasserstein type distances between two distinct univariate distributions
- A statistical test of isomorphism between metric-measure spaces using the distance-to-a-measure signature
- An empirical central limit theorem in L^1 for stationary sequences
- Assessing the similarity of distributions - finite sample performance of the empirical mallows distance
- Asymptotics for L₂ functionals of the empirical quantile process, with applications to tests of fit based on weighted Wasserstein distances
- Behavior of the Wasserstein distance between the empirical and the marginal distributions of stationary \(\alpha\)-dependent sequences
- Detecting relevant changes in the mean of nonstationary processes -- a mass excess approach
- Empirical optimal transport on countable metric spaces: distributional limits and statistical applications
- Equivalence of distance-based and RKHS-based statistics in hypothesis testing
- Feature-based reverse engineering of mannequin for garment design.
- Functional limit theorems for U-processes
- Gromov-Wasserstein distances and the metric approach to object matching
- scientific article; zbMATH DE number 5381778 (Why is no real title available?)
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- Inference for empirical Wasserstein distances on finite spaces
- Invariant histograms
- Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
- Natural pseudo-distance and optimal matching between reduced size functions
- On a new multivariate two-sample test.
- On reconstructing \(n\)-point configurations from the distribution of distances or areas
- One-dimensional empirical measures, order statistics, and Kantorovich transport distances
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Quadratic programming with one negative eigenvalue is NP-hard
- Shape classification based on interpoint distance distributions
- Shape distributions
- Tests of goodness of fit based on the L₂-Wasserstein distance
- The Gromov–Wasserstein distance between networks and stable network invariants
- Trimmed Comparison of Distributions
- Two‐sample homogeneity testing: A procedure based on comparing distributions of interpoint distances
- Weak convergence and empirical processes. With applications to statistics
- Weak convergence of the weighted empirical quantile process in \(L^ 2(0,1)\)
Cited in
(4)- A unifying approach to distributional limits for empirical optimal transport
- Empirical optimal transport under estimated costs: distributional limits and statistical applications
- A new class of nonparametric tests for second-order stochastic dominance based on the Lorenz P-P plot
- A two-sample test based on averaged Wilcoxon rank sums over interpoint distances
This page was built for publication: Distribution of Distances based Object Matching: Asymptotic Inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154012)
