Estimating Dataset Dimension via Singular Metrics under the Manifold Hypothesis: Application to Inverse Problems
Not on the map. Why?
Abstract (arXiv)
High-dimensional datasets often exhibit low-dimensional geometric structures, as suggested by the manifold hypothesis, which implies that data lie on a smooth manifold embedded in a higher-dimensional ambient space. While this insight underpins many advances in machine learning and inverse problems, fully leveraging it requires to deal with three key tasks: estimating the intrinsic dimension (ID) of the manifold, constructing appropriate local coordinates, and learning mappings between ambient and manifold spaces. In this work, we propose a framework that addresses all these challenges using a Mixture of Variational Autoencoders (VAEs) and tools from Riemannian geometry. We specifically focus on estimating the ID of datasets by analyzing the numerical rank of the VAE decoder pullback metric. The estimated ID guides the construction of an atlas of local charts using a mixture of invertible VAEs, enabling accurate manifold parameterization and efficient inference. We how this approach enhances solutions to ill-posed inverse problems, particularly in biomedical imaging, by enforcing that reconstructions lie on the learned manifold. Lastly, we explore the impact of network pruning on manifold geometry and reconstruction quality, showing that the intrinsic dimension serves as an effective proxy for monitoring model capacity.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 29 of its 66 references that are in the map. First posted on arXiv 9 Jul 2025.
Builds on
29 of 66 references.
References · 29
- 2016Density estimation using Real NVPcited by 2,042
- 2017Compressed Sensing using Generative Modelscited by 339
- 2018Analyzing Inverse Problems with Invertible Neural Networkscited by 242
- 2016Variational Deep Embedding: An Unsupervised and Generative Approach to Clusteringcited by 220
- 2022Score-Based Generative Models Detect Manifoldscited by 122
- 2019LassoNet: A Neural Network with Feature Sparsitycited by 82
- 2022Identifiability of deep generative models without auxiliary informationcited by 70
- 2021Scikit-dimension: a Python package for intrinsic dimension estimationcited by 68
- 2023Manifold learning: what, how, and whycited by 68
- 2021Rectangular Flows for Manifold Learningcited by 50
- 2024A Geometric View of Data Complexity: Efficient Local Intrinsic Dimension Estimation with Diffusion Modelscited by 42
- 2020Variational Autoencoder with Learned Latent Structurecited by 41
17 more
- 2018Blind Image Deconvolution using Deep Generative Priorscited by 40
- 2022LIDL: Local Intrinsic Dimension Estimation Using Approximate Likelihoodcited by 30
- 2024Losing dimensions: Geometric memorization in generative diffusioncited by 29
- 2021Multi-Facet Clustering Variational Autoencoderscited by 28
- 2018Disconnected Manifold Learning for Generative Adversarial Networkscited by 27
- 2022PatchNR: Learning from Very Few Images by Patch Normalizing Flow Regularizationcited by 22
- 2023Manifold Learning by Mixture Models of VAEs for Inverse Problemscited by 17
- 2019Geometry-Aware Maximum Likelihood Estimation of Intrinsic Dimensioncited by 15
- 2023Canonical normalizing flows for manifold learningcited by 15
- 2021Manifold Learning Benefits GANscited by 14
- 2021Wasserstein Patch Prior for Image Superresolutioncited by 13
- 2023Autoencoders for discovering manifold dimension and coordinates in data from complex dynamical systemscited by 13
- 2019Intrinsic dimension estimation for locally undersampled datacited by 10
- 2021Manipulating Identical Filter Redundancy for Efficient Pruning on Deep and Complicated CNNcited by 9
- 2024Robust estimation of the intrinsic dimension of data sets with quantum cognition machine learningcited by 6
- 2018InfoCatVAE: Representation Learning with Categorical Variational Autoencoderscited by 5
- 2021Non-linear, Sparse Dimensionality Reduction via Path Lasso Penalized Autoencoderscited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.