Towards a theoretical foundation for Laplacian-based manifold methods

2007/08/31 by Mikhail Belkin, Partha Niyogi · 479 citations
Computer Science · Mathematics · #Artificial intelligence #Computer science #Dimensionality reduction #Face and Expression Recognition #Graph #Laplace operator #Laplacian matrix #Manifold (fluid mechanics) #Manifold alignment #Mathematical analysis #Mathematics #Neural Networks and Applications #Nonlinear dimensionality reduction #Point cloud #Theoretical computer science #Topological and Geometric Data Analysis

paper · pdf · doi:10.1016/j.jcss.2007.08.006

published in Journal of Computer and System Sciences 74(8), 1289-1308 (Elsevier BV)

openalex publication_date 2007/08/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31

Cited by

• A Topological View of Unsupervised Learning from Noisy Data
• Behavior of Graph Laplacians on Manifolds with Boundary
• Lipschitz Bounds and Provably Robust Training by Laplacian Smoothing
• The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning
• In-Context Semi-Supervised Learning
• Asymptotics of the graph Laplace operator near an isolated singularity
• STARK denoises spatial transcriptomics images via adaptive regularization
• Approximating Loops in a Shortest Homology Basis from Point Data
• Search at Scale: Improving Numerical Conditioning of Ergodic Coverage Optimization for Multi-Scale Domains
• How do kernel-based sensor fusion algorithms behave under high dimensional noise?
• Decimated Framelet System on Graphs and Fast G-Framelet Transforms
• Extracting manifold information from point clouds
• The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
• Whole-brain Prediction Analysis with GraphNet
• A tutorial on spectral clustering
• Operator norm convergence of spectral clustering on level sets
• PDE-Free Mass-Constrained Learning of Complex Systems with Hidden States
• Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization
• Noncommutative Laplacian and numerical approximation of Laplace-Beltrami spectrum of compact Riemann surfaces
• When Scores Learn Geometry: Rate Separations under the Manifold Hypothesis
• Entropic Optimal Transport in Random Graphs
• Landing with the Score: Riemannian Optimization through Denoising
• The diffusion geometry of fibre bundles: Horizontal diffusion maps
• High-Dimensional Statistical Process Control via Manifold Fitting and Learning
• Machine learning of slow collective variables and enhanced sampling via spatial techniques
• Optimization of geometric hypergraph embedding
• Connection graph Laplacian methods can be made robust to noise
• DeepSphere: a graph-based spherical CNN
• Deep nets for local manifold learning
• Co-clustering for directed graphs: the Stochastic co-Blockmodel and spectral algorithm Di-Sim
• Semi-supervised Eigenvectors for Large-scale Locally-biased Learning
• Manifold Regularization for Locally Stable Deep Neural Networks
• Wavelets on graphs via spectral graph theory
• On the Consistency of Graph-based Bayesian Learning and the Scalability of Sampling Algorithms
• Disentangling by Subspace Diffusion
• Modified Virtual Grid Difference for Discretizing the Laplace-Beltrami Operator on Point Clouds
• An Analysis of the Convergence of Graph Laplacians
• Manifolds with kinks and the asymptotic behavior of the graph Laplacian operator with Gaussian kernel
• Minimax Optimal Regression over Sobolev Spaces via Laplacian Eigenmaps on Neighborhood Graphs
• Locality preserving projection on SPD matrix Lie group: algorithm and analysis
• Local Averaging Accurately Distills Manifold Structure From Noisy Data
• Towards Stratification Learning through Homology Inference
• Asymptotic Expansion of the Gaussian Integral Operators on Riemannian submanifolds of ℝⁿ
• Graph Semi-Supervised Learning for Point Classification on Data Manifolds
• Coarse Ricci curvature as a function on M× M
• Perturbation Bounds for Procrustes, Classical Scaling, and Trilateration, with Applications to Manifold Learning
• Categorical and geometric methods in statistical, manifold, and machine learning
• Nonparametric sparsity and regularization
• Spectral Convergence of the connection Laplacian from random samples
• Autoencoding Random Forests
• Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
• p-Laplacian Based Graph Neural Networks
• Stability of Entropic Wasserstein Barycenters and application to random geometric graphs
• Consistency of Dirichlet Partitions
• Cubature formulas on combinatorial graphs
• Learning Laplacian Matrix in Smooth Graph Signal Representations
• Eignets for function approximation on manifolds
• Geometric structure of graph Laplacian embeddings
• Data-driven thresholding in denoising with Spectral Graph Wavelet Transform
• Generating and Aligning from Data Geometries with Generative Adversarial\n Networks
• Practical Implementation of an End-to-End Methodology for SPC of 3-D Part Geometry: A Case Study
• Exploring nonlinear feature space dimension reduction and data representation in breast Cadx with Laplacian eigenmaps and t-SNE. [europepmc]
• SPANOL (SPectral ANalysis of Lobes): A Spectral Clustering Framework for Individual and Group Parcellation of Cortical Surfaces in Lobes. [europepmc]
• A Semiautomatic Multi-Label Color Image Segmentation Coupling Dirichlet Problem and Colour Distances. [europepmc]
• A Semi-Supervised Reduced-Space Method for Hyperspectral Imaging Segmentation. [europepmc]
• Research on Face Image Digital Processing and Recognition Based on Data Dimensionality Reduction Algorithm. [europepmc]
• Research on Real-Time Face Key Point Detection Algorithm Based on Attention Mechanism. [europepmc]
• The linear framework: using graph theory to reveal the algebra and thermodynamics of biomolecular systems. [europepmc]
• Estimating network dimension when the spectrum struggles. [europepmc]
• Regime-adaptive partial differential equations for interpretable multi-ethnic urban modeling. [europepmc]