Graph connection Laplacian methods can be made robust to noise
From MaRDI portal
Publication:5963525
DOI10.1214/14-AOS1275zbMath1350.60036arXiv1405.6231OpenAlexW2230899220MaRDI QIDQ5963525
Hau-Tieng Wu, Noureddine El Karoui
Publication date: 22 February 2016
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.6231
noiserobustnessrandom matriceskernel methodsconcentration of measurespectral geometrygraph connection Laplacian methodsvector diffusion maps
Related Items (max. 100)
Embedding Riemannian manifolds by the heat kernel of the connection Laplacian ⋮ Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolation ⋮ The diffusion geometry of fibre bundles: horizontal diffusion maps ⋮ Approximations of the connection Laplacian spectra ⋮ Robust Inference of Manifold Density and Geometry by Doubly Stochastic Scaling ⋮ Learning low-dimensional nonlinear structures from high-dimensional noisy data: an integral operator approach ⋮ Spatiotemporal analysis using Riemannian composition of diffusion operators ⋮ Spectral convergence of the connection Laplacian from random samples ⋮ The geometry of synchronization problems and learning group actions ⋮ Solving Jigsaw Puzzles by the Graph Connection Laplacian ⋮ Think globally, fit locally under the manifold setup: asymptotic analysis of locally linear embedding ⋮ Embeddings of Riemannian manifolds with finite eigenvector fields of connection Laplacian ⋮ Explore Intrinsic Geometry of Sleep Dynamics and Predict Sleep Stage by Unsupervised Learning Techniques ⋮ The Steerable Graph Laplacian and its Application to Filtering Image Datasets ⋮ Wave-shape oscillatory model for nonstationary periodic time series analysis ⋮ Doubly Stochastic Normalization of the Gaussian Kernel Is Robust to Heteroskedastic Noise ⋮ Latent common manifold learning with alternating diffusion: analysis and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Alternating projection, ptychographic imaging and phase synchronization
- On information plus noise kernel random matrices
- Angular synchronization by eigenvectors and semidefinite programming
- Representation theoretic patterns in three dimensional cryo-electron microscopy. I: The intrinsic reconstitution algorithm
- Operator norm consistent estimation of large-dimensional sparse covariance matrices
- Concentration of measure and spectra of random matrices: applications to correlation matrices, elliptical distributions and beyond
- A class of generalized Laplacians on vector bundles devoted to multi-channel image processing
- Asymptotics of graphical projection pursuit
- Posterior convergence rates for Dirichlet mixtures of beta densities
- A theoretical and computational framework for isometry invariant recognition of point cloud data
- Eigenvector synchronization, graph rigidity and the molecule problem
- Two-Dimensional Tomography from Noisy Projections Taken at Unknown Random Directions
- A Perfect Match Condition for Point-Set Matching Problems Using the Optimal Mass Transport Approach
- Phase Retrieval with Polarization
- Ranking and Sparsifying a Connection Graph
- Vector diffusion maps and the connection Laplacian
- A Local Clustering Algorithm for Connection Graphs
- On robust regression with high-dimensional predictors
- Viewing Angle Classification of Cryo-Electron Microscopy Images Using Eigenvectors
- Asymptotic Statistics
- Comparing Top k Lists
- Continuous Procrustes Distance Between Two Surfaces
- Geometric Representation of High Dimension, Low Sample Size Data
This page was built for publication: Graph connection Laplacian methods can be made robust to noise
