Exploring Singularities in point clouds with the graph Laplacian: An explicit approach
Martin Andersson, Benny Avelin
TL;DR
This work develops explicit, sharp bounds for the graph Laplacian $L_{n,t}$ acting on linear functionals $f(x)=v\cdot x$ near singularities of a data manifold $\Omega=\bigcup_i\Omega_i$, including intersections and boundaries. By decomposing the operator into restricted pieces $L_t^i$ on each component and deriving asymptotic forms such as $L_t^i f(x) = t^{d/2+1/2} A(d,r_0,\theta) v_{n,\Omega_i}\sin\theta\,r\,e^{ - \sin^2\theta\,r^2} + t^{d/2}B(x)e^{-r_0^2}$ (plus boundary-augmented terms in the non-flat case), the authors obtain finite-sample concentration bounds and construct hypothesis tests for singularities, as well as estimators for intersection location and angle. The results cover flat unions, general manifolds, and noisy samples, with numerical experiments validating tests on neural network loss-sets and demonstrating reliable estimation of geometric features in both flat and curved settings. The work advances practical tools for revealing and quantifying singular geometry in high-dimensional data, with potential applications to neural network landscapes and manifold-structured data analysis.
Abstract
We develop theory and methods that use the graph Laplacian to analyze the geometry of the underlying manifold of datasets. Our theory provides theoretical guarantees and explicit bounds on the functional forms of the graph Laplacian when it acts on functions defined close to singularities of the underlying manifold. We use these explicit bounds to develop tests for singularities and propose methods that can be used to estimate geometric properties of singularities in the datasets.
