Principal Curvatures Estimation with Applications to Single Cell Data

• URL: http://arxiv.org/abs/2502.03750v1
• Date: Thu, 06 Feb 2025 03:23:31 GMT
• Title: Principal Curvatures Estimation with Applications to Single Cell Data
• Abstract summary: A common method in manifold learning consists in hypothesizing that datasets lie on a lower dimensional manifold.<n>In this work, we will present Adaptive Local PCA (AdaL-PCA), a data-driven method for accurately estimating various notions of intrinsic curvature.<n>The evaluation of AdaL-PCA on sampled surfaces shows state-of-the-art results.
• Score: 21.500812145370688
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The rapidly growing field of single-cell transcriptomic sequencing (scRNAseq) presents challenges for data analysis due to its massive datasets. A common method in manifold learning consists in hypothesizing that datasets lie on a lower dimensional manifold. This allows to study the geometry of point clouds by extracting meaningful descriptors like curvature. In this work, we will present Adaptive Local PCA (AdaL-PCA), a data-driven method for accurately estimating various notions of intrinsic curvature on data manifolds, in particular principal curvatures for surfaces. The model relies on local PCA to estimate the tangent spaces. The evaluation of AdaL-PCA on sampled surfaces shows state-of-the-art results. Combined with a PHATE embedding, the model applied to single-cell RNA sequencing data allows us to identify key variations in the cellular differentiation.

Related papers

• CuBAS: Information Geometric Curvature-Based Adaptive Sampling for Supervised Classification [52.452902154360565]
  CuBAS is an information-geometric framework for adaptive data selection in supervised classification.<n>A labeled dataset can be viewed as a statistical manifold, on which local curvature, estimated via the ratio of second to first-order observed Fisher information, faithfully encodes the geometric complexity of the data distribution.
  arXiv  Detail & Related papers  (2026-07-03T09:36:02Z)
• scShapeBench: Discovering geometry from high dimensional scRNAseq data [8.845081957844453]
  We introduce scShapeBench, a benchmark dataset for shape detection in single-cell datasets.<n>Synthetic datasets are sampled from ground-truth skeleton graphs with controlled variance.<n>Real single-cell datasets are curated from diverse sources and annotated by experts.
  arXiv  Detail & Related papers  (2026-05-12T19:10:38Z)
• Asymptotic Learning Curves for Diffusion Models with Random Features Score and Manifold Data [7.047721358838963]
  We study the theoretical behavior of denoising score matching.<n>We derive exact expressions for the test, train, and score errors in the high-dimensional limit.
  arXiv  Detail & Related papers  (2026-03-24T08:58:12Z)
• On Procrustes Contamination in Machine Learning Applications of Geometric Morphometrics [0.0]
  Geometric morphometrics (GMM) is widely used to quantify shape variation, more recently serving as input for machine learning (ML) analyses.<n>Standard practice aligns all specimens via Generalized Procrustes Analysis (GPA) prior to splitting data into training and test sets.<n>Here, the effects of GPA-induced contamination are formally characterised using controlled 2D and 3D simulations.
  arXiv  Detail & Related papers  (2026-01-26T12:56:23Z)
• Efficient Covariance Estimation for Sparsified Functional Data [51.69796254617083]
  proposed Random-knots (Random-knots-Spatial) and B-spline (Bspline-Spatial) estimators of the covariance function are computationally efficient.<n>Asymptotic pointwise of the covariance are obtained for sparsified individual trajectories under some regularity conditions.
  arXiv  Detail & Related papers  (2025-11-23T00:50:33Z)
• Multiscale Grassmann Manifolds for Single-Cell Data Analysis [3.073258665974412]
  We propose a multiscale framework that integrates machine learning with subspace geometry for single-cell data analysis.<n>A power-based scale sampling function is introduced to control the selection of scales and balance in- formation across resolutions.<n>Experiments on nine benchmark single-cell RNA-seq datasets demonstrate that the proposed approach effectively preserves meaningful structures.
  arXiv  Detail & Related papers  (2025-11-12T19:47:10Z)
• Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization [48.25304391127552]
  Estimating the tangent spaces of a data manifold is a fundamental problem in data analysis.<n>We propose a method, Laplacian Eigenvector Gradient Orthogonalization (LEGO), that utilizes the global structure of the data to guide local tangent space estimation.
  arXiv  Detail & Related papers  (2025-10-02T17:59:45Z)
• Enforcing Latent Euclidean Geometry in Single-Cell VAEs for Manifold Interpolation [79.27003481818413]
  We introduce FlatVI, a training framework that regularises the latent manifold of discrete-likelihood variational autoencoders towards Euclidean geometry.<n>By encouraging straight lines in the latent space to approximate geodesics on the decoded single-cell manifold, FlatVI enhances compatibility with downstream approaches.
  arXiv  Detail & Related papers  (2025-07-15T23:08:14Z)
• Learning a Single Index Model from Anisotropic Data with vanilla Stochastic Gradient Descent [7.8378818005171125]
  We investigate the problem of learning a Single Index Model (SIM) for studying the ability of neural networks to learn features. In this study, we analyze the learning dynamics of vanilla Gradient Descent (SGD) under the SIM with anisotropic input data. We derive upper and lower bounds on the sample complexity using a notion of effective dimension that is determined by the structure of the covariance matrix.
  arXiv  Detail & Related papers  (2025-03-31T01:07:30Z)
• Learning Coupled Subspaces for Multi-Condition Spike Data [8.114880112033644]
  In neuroscience, researchers typically conduct experiments under multiple conditions to acquire neural responses in the form of high-dimensional spike train datasets. We propose a non-parametric Bayesian approach to learn a smooth tuning function over the experiment condition space.
  arXiv  Detail & Related papers  (2024-10-24T20:44:28Z)
• Induced Covariance for Causal Discovery in Linear Sparse Structures [55.2480439325792]
  Causal models seek to unravel the cause-effect relationships among variables from observed data. This paper introduces a novel causal discovery algorithm designed for settings in which variables exhibit linearly sparse relationships.
  arXiv  Detail & Related papers  (2024-10-02T04:01:38Z)
• Diffusion posterior sampling for simulation-based inference in tall data settings [53.17563688225137]
  Simulation-based inference ( SBI) is capable of approximating the posterior distribution that relates input parameters to a given observation. In this work, we consider a tall data extension in which multiple observations are available to better infer the parameters of the model. We compare our method to recently proposed competing approaches on various numerical experiments and demonstrate its superiority in terms of numerical stability and computational cost.
  arXiv  Detail & Related papers  (2024-04-11T09:23:36Z)
• Minimally Supervised Learning using Topological Projections in Self-Organizing Maps [55.31182147885694]
  We introduce a semi-supervised learning approach based on topological projections in self-organizing maps (SOMs) Our proposed method first trains SOMs on unlabeled data and then a minimal number of available labeled data points are assigned to key best matching units (BMU) Our results indicate that the proposed minimally supervised model significantly outperforms traditional regression techniques.
  arXiv  Detail & Related papers  (2024-01-12T22:51:48Z)
• Gradient-Based Feature Learning under Structured Data [57.76552698981579]
  In the anisotropic setting, the commonly used spherical gradient dynamics may fail to recover the true direction. We show that appropriate weight normalization that is reminiscent of batch normalization can alleviate this issue. In particular, under the spiked model with a suitably large spike, the sample complexity of gradient-based training can be made independent of the information exponent.
  arXiv  Detail & Related papers  (2023-09-07T16:55:50Z)
• Intrinsic dimension estimation for discrete metrics [65.5438227932088]
  In this letter we introduce an algorithm to infer the intrinsic dimension (ID) of datasets embedded in discrete spaces. We demonstrate its accuracy on benchmark datasets, and we apply it to analyze a metagenomic dataset for species fingerprinting. This suggests that evolutive pressure acts on a low-dimensional manifold despite the high-dimensionality of sequences' space.
  arXiv  Detail & Related papers  (2022-07-20T06:38:36Z)
• The Manifold Hypothesis for Gradient-Based Explanations [55.01671263121624]
  gradient-based explanation algorithms provide perceptually-aligned explanations. We show that the more a feature attribution is aligned with the tangent space of the data, the more perceptually-aligned it tends to be. We suggest that explanation algorithms should actively strive to align their explanations with the data manifold.
  arXiv  Detail & Related papers  (2022-06-15T08:49:24Z)
• Diffusion Curvature for Estimating Local Curvature in High Dimensional Data [12.544934475081254]
  We introduce a new intrinsic measure of local curvature on point-cloud data called diffusion curvature. Our measure uses the framework of diffusion maps, including the data diffusion operator, to structure point cloud data and define local curvature based on the laziness of a random walk starting at a point or region of the data.
  arXiv  Detail & Related papers  (2022-06-08T15:53:05Z)
• Projected Statistical Methods for Distributional Data on the Real Line with the Wasserstein Metric [0.0]
  We present a novel class of projected methods, to perform statistical analysis on a data set of probability distributions on the real line. We focus in particular on Principal Component Analysis (PCA) and regression. Several theoretical properties of the models are investigated and consistency is proven.
  arXiv  Detail & Related papers  (2021-01-22T10:24:49Z)
• LOCA: LOcal Conformal Autoencoder for standardized data coordinates [6.608924227377152]
  We present a method for learning an embedding in $mathbbRd$ that is isometric to the latent variables of the manifold. Our embedding is obtained using a LOcal Conformal Autoencoder (LOCA), an algorithm that constructs an embedding to rectify deformations. We also apply LOCA to single-site Wi-Fi localization data, and to $3$-dimensional curved surface estimation.
  arXiv  Detail & Related papers  (2020-04-15T17:49:37Z)
• Improved guarantees and a multiple-descent curve for Column Subset Selection and the Nystr\"om method [76.73096213472897]
  We develop techniques which exploit spectral properties of the data matrix to obtain improved approximation guarantees. Our approach leads to significantly better bounds for datasets with known rates of singular value decay. We show that both our improved bounds and the multiple-descent curve can be observed on real datasets simply by varying the RBF parameter.
  arXiv  Detail & Related papers  (2020-02-21T00:43:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.