Study of Manifold Geometry using Multiscale Non-Negative Kernel Graphs
Not on the map. Why?
Abstract (arXiv)
Modern machine learning systems are increasingly trained on large amounts of data embedded in high-dimensional spaces. Often this is done without analyzing the structure of the dataset. In this work, we propose a framework to study the geometric structure of the data. We make use of our recently introduced non-negative kernel (NNK) regression graphs to estimate the point density, intrinsic dimension, and the linearity of the data manifold (curvature). We further generalize the graph construction and geometric estimation to multiple scale by iteratively merging neighborhoods in the input data. Our experiments demonstrate the effectiveness of our proposed approach over other baselines in estimating the local geometry of the data manifolds on synthetic and real datasets.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 9 of its 37 references that are in the map. First posted on arXiv 31 Oct 2022.
Builds on
9 of 37 references.
References · 9
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2018Estimating the intrinsic dimension of datasets by a minimal neighborhood informationcited by 246
- 2019Deep geometric knowledge distillation with graphscited by 21
- 2021Channel-Wise Early Stopping without a Validation Set via NNK Polytope Interpolationcited by 11
- 2018Laplacian Networks: Bounding Indicator Function Smoothness for Neural Network Robustnesscited by 7
- 2020Representing Deep Neural Networks Latent Space Geometries with Graphscited by 7
- 2022The Geometry of Self-supervised Learning Models and its Impact on Transfer Learningcited by 7
- 2021Channel redundancy and overlap in convolutional neural networks with channel-wise NNK graphscited by 3
- 2020Efficient graph construction for image representationcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.