A \(k\)-points-based distance for robust geometric inference
From MaRDI portal
Publication:2203630
DOI10.3150/20-BEJ1214zbMath1469.62432OpenAlexW3009913040MaRDI QIDQ2203630
Clément Levrard, Claire Brécheteau
Publication date: 7 October 2020
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.bj/1598493638
quantizationminimax ratesdistance to measuretopological inference\(k\) power distance to measurerobust distance estimationVoronoi's measure
Nonparametric robustness (62G35) Minimax procedures in statistical decision theory (62C20) Topological data analysis (62R40)
Related Items (3)
Reweighting samples under covariate shift using a Wasserstein distance criterion ⋮ Topics in robust statistical learning ⋮ Statistical analysis of Mapper for stochastic and multivariate filters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient and fast estimation of the geometric median in Hilbert spaces with an averaged stochastic gradient algorithm
- Rates of convergence for robust geometric inference
- Manifold estimation and singular deconvolution under Hausdorff loss
- Tight minimax rates for manifold estimation under Hausdorff loss
- Geometric inference for probability measures
- Set estimation under convexity type assumptions
- Stability of persistence diagrams
- Elementary proof for Sion's minimax theorem
- Trimmed \(k\)-means: An attempt to robustify quantizers
- Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction
- Nonasymptotic rates for manifold, tangent space and curvature estimation
- Computing persistent homology
- Topological persistence and simplification
- Witnessed \(k\)-distance
- Nonasymptotic bounds for vector quantization in Hilbert spaces
- Finding the homology of submanifolds with high confidence from random samples
- Optimal rates of convergence for persistence diagrams in Topological Data Analysis
- Multiscale Dictionary Learning: Non-Asymptotic Bounds and Robustness
- Curvature Measures
- On the Optimality of Conditional Expectation as a Bregman Predictor
- On the Performance of Clustering in Hilbert Spaces
- Declutter and resample: Towards parameter free denoising.
- The minimax distortion redundancy in empirical quantizer design
- Least squares quantization in PCM
- Geometric and Topological Inference
- Lower bounds for k-distance approximation
- Efficient and Robust Persistent Homology for Measures
- Introduction to nonparametric estimation
This page was built for publication: A \(k\)-points-based distance for robust geometric inference