paper-with-me

Papers

Estimating Dataset Dimension via Singular Metrics under the Manifold Hypothesis: Application to Inverse Problems

2025-07-09 · Paola Causin, Alessio Marta 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.

📄 PDF Abstract BibTeX arXiv:2507.07291

Code (0)

등록된 구현이 없습니다.

Tasks

Network Pruning

Similar Papers 제목 키워드 기반

Data-Driven Estimation of Structured Singular Values

2025-03-17 · Margarita A. Guerrero, Braghadeesh Lakshminarayanan, Cristian R. Rojas

Estimating the size of the modeling error is crucial for robust control. Over the years, numerous metrics have been developed to quantify the model error in a control relevant manner. One of the most important such metri…

Near-optimal Rank Adaptive Inference of High Dimensional Matrices

2025-10-09 · Frédéric Zheng, Yassir Jedra, Alexandre Proutiere arxiv

We address the problem of estimating a high-dimensional matrix from linear measurements, with a focus on designing optimal rank-adaptive algorithms. These algorithms infer the matrix by estimating its singular values and…

Spectrum Estimation from a Few Entries

2017-03-18 · Ashish Khetan, Sewoong Oh

Singular values of a data in a matrix form provide insights on the structure of the data, the effective dimensionality, and the choice of hyper-parameters on higher-level data analysis tools. However, in many practical a…

Collaborative FilteringMatrix Completion

Stacked SVD or SVD stacked? A Random Matrix Theory perspective on data integration

2025-07-29 · Tavor Z. Baharav, Phillip B. Nicol, Rafael A. Irizarry, Rong Ma arxiv

Modern data analysis increasingly requires identifying shared latent structure across multiple high-dimensional datasets. A commonly used model assumes that the data matrices are noisy observations of low-rank matrices w…

A likelihood approach to nonparametric estimation of a singular distribution using deep generative models

2021-05-09 · Minwoo Chae, Dongha Kim, Yongdai Kim, Lizhen Lin

We investigate statistical properties of a likelihood approach to nonparametric estimation of a singular distribution using deep generative models. More specifically, a deep generative model is used to model high-dimensi…