scientific article; zbMATH DE number 7164736

zbMath1434.68407arXiv1904.03335MaRDI QIDQ5214228

Ruiyi Yang, Daniel Sanz-Alonso, Nicolás García Trillos

Publication date: 7 February 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

spectral convergencegraph Laplacianmanifold denoisingmetric estimation

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Statistical aspects of big data and data science (62R07)

Related Items (10)

Balancing Geometry and Density: Path Distances on High-Dimensional Data ⋮ Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs ⋮ Unnamed Item ⋮ Optimal reach estimation and metric learning ⋮ Reconstruction of manifold embeddings into Euclidean spaces via intrinsic distances ⋮ Optimization on Manifolds via Graph Gaussian Processes ⋮ Kernel Methods for Bayesian Elliptic Inverse Problems on Manifolds ⋮ Unnamed Item ⋮ Asymptotic spectra of large (grid) graphs with a uniform local structure. I: Theory ⋮ The SPDE approach to Matérn fields: graph representations

Uses Software

• MNIST
• IntDim

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuum limit of total variation on point clouds
• Semi-supervised learning on Riemannian manifolds
• Spectral partitioning works: planar graphs and finite element meshes
• More honest foundations for data analysis
• Nonasymptotic rates for manifold, tangent space and curvature estimation
• Importance sampling: intrinsic dimension and computational cost
• A graph discretization of the Laplace-Beltrami operator
• Texture separation via a reference set
• Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
• Multiscale geometric methods for data sets. I: Multiscale SVD, noise and curvature.
• Estimating the reach of a manifold
• Consistency of spectral clustering
• Finding the homology of submanifolds with high confidence from random samples
• Diffusion maps
• From graph to manifold Laplacian: the convergence rate
• Uncertainty Quantification in Graph-Based Classification of High Dimensional Data
• Continuum Limits of Posteriors in Graph Bayesian Inverse Problems
• Curvature Measures
• The estimation of the gradient of a density function, with applications in pattern recognition
• Minimax Manifold Estimation
• Introduction to Partial Differential Equations
• A comprehensive approach to mode clustering

This page was built for publication: