CA-PCA: Manifold Dimension Estimation, Adapted for Curvature

• URL: http://arxiv.org/abs/2309.13478v2
• Date: Sun, 8 Sep 2024 11:48:51 GMT
• Title: CA-PCA: Manifold Dimension Estimation, Adapted for Curvature
• Abstract summary: It is often useful to determine or estimate the dimension of this manifold before performing dimension reduction. Existing methods for dimension estimation are calibrated using a flat unit ball. We develop CA-PCA, a version of local PCA based instead on a calibration of a quadratic embedding.
• Score: 4.220336689294244
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The success of algorithms in the analysis of high-dimensional data is often attributed to the manifold hypothesis, which supposes that this data lie on or near a manifold of much lower dimension. It is often useful to determine or estimate the dimension of this manifold before performing dimension reduction, for instance. Existing methods for dimension estimation are calibrated using a flat unit ball. In this paper, we develop CA-PCA, a version of local PCA based instead on a calibration of a quadratic embedding, acknowledging the curvature of the underlying manifold. Numerous careful experiments show that this adaptation improves the estimator in a wide range of settings.

Related papers

• Geometry-Aware Bayesian Parameter-Efficient Fine-Tuning on the Stiefel Manifold via Stein Variational Gradient Descent [16.900185930373315]
  We build on the singular value decomposition factorization adapters to develop a framework based on Stein variational gradient descent (SVGD)<n>Our method delivers strong model calibration and attains higher prediction accuracy than SVGD and related uncertainty estimation methods that are formulated in Euclidean space.
  arXiv  Detail & Related papers  (2026-09-08T07:24:54Z)
• An efficient adaptive dimension selection algorithm for multidimensional probit graded response models [5.226600335299251]
  Multidimensional graded response models (MGRMs) are widely used for analyzing ordinal questionnaire data in psychological and educational assessments.<n>A central challenge in applying these models is determining the number of latent dimensions.<n>We develop an adaptive Bayesian dimension selection framework for probit MGRMs.
  arXiv  Detail & Related papers  (2026-07-20T08:06:47Z)
• 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)
• Beyond PCA: Manifold Dimension Estimation via Local Graph Structure [0.0]
  We propose a general framework for manifold dimension estimation by integrating PCA with regression-based techniques.<n>Within this framework, we introduce two representative estimators: quadratic embedding (QE) and total least squares (TLS)<n>Experiments on both synthetic and real-world datasets demonstrate that these methods perform competitively with, and often outperform, state-of-the-art alternatives.
  arXiv  Detail & Related papers  (2025-10-16T20:59:46Z)
• A Survey of Dimension Estimation Methods [0.0]
  It is important to understand the real dimension of the data, hence the complexity of the dataset at hand.<n>This survey reviews a wide range of dimension estimation methods, categorising them by the geometric information they exploit.<n>The paper evaluates the performance of these methods, as well as investigating varying responses to curvature and noise.
  arXiv  Detail & Related papers  (2025-07-18T13:05:42Z)
• Estimating Dataset Dimension via Singular Metrics under the Manifold Hypothesis: Application to Inverse Problems [0.6138671548064356]
  We propose a framework to deal with three key tasks: estimating the intrinsic dimension of the manifold, constructing appropriate local coordinates, and learning mappings between ambient and manifold spaces.<n>We focus on estimating the ID of datasets by analyzing the numerical rank of the VAE decoder pullback metric.<n>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.
  arXiv  Detail & Related papers  (2025-07-09T21:22:59Z)
• CP$^2$: Leveraging Geometry for Conformal Prediction via Canonicalization [51.716834831684004]
  We study the problem of conformal prediction (CP) under geometric data shifts.<n>We propose integrating geometric information--such as geometric pose--into the conformal procedure to reinstate its guarantees.
  arXiv  Detail & Related papers  (2025-06-19T10:12:02Z)
• Projection Pursuit Density Ratio Estimation [44.71752951218575]
  Density ratio estimation (DRE) is a paramount task in machine learning, for its broad applications across multiple domains.<n>Parametric methods for estimating the density ratio possibly lead to biased results if models are misspecified.<n>Conventional non-parametric methods suffer from the curse of dimensionality when the dimension of data is large.<n>We propose a novel approach for DRE based on the projection pursuit approximation.
  arXiv  Detail & Related papers  (2025-06-01T07:15:07Z)
• Truncating Trajectories in Monte Carlo Policy Evaluation: an Adaptive Approach [51.76826149868971]
  Policy evaluation via Monte Carlo simulation is at the core of many MC Reinforcement Learning (RL) algorithms. We propose as a quality index a surrogate of the mean squared error of a return estimator that uses trajectories of different lengths. We present an adaptive algorithm called Robust and Iterative Data collection strategy Optimization (RIDO)
  arXiv  Detail & Related papers  (2024-10-17T11:47:56Z)
• Quasi-Bayes meets Vines [2.3124143670964448]
  We propose a different way to extend Quasi-Bayesian prediction to high dimensions through the use of Sklar's theorem. We show that our proposed Quasi-Bayesian Vine (QB-Vine) is a fully non-parametric density estimator with emphan analytical form.
  arXiv  Detail & Related papers  (2024-06-18T16:31:02Z)
• Differentially Private Optimization with Sparse Gradients [60.853074897282625]
  We study differentially private (DP) optimization problems under sparsity of individual gradients. Building on this, we obtain pure- and approximate-DP algorithms with almost optimal rates for convex optimization with sparse gradients.
  arXiv  Detail & Related papers  (2024-04-16T20:01:10Z)
• Scaling Riemannian Diffusion Models [68.52820280448991]
  We show that our method enables us to scale to high dimensional tasks on nontrivial manifold. We model QCD densities on $SU(n)$ lattices and contrastively learned embeddings on high dimensional hyperspheres.
  arXiv  Detail & Related papers  (2023-10-30T21:27:53Z)
• Implicit Manifold Gaussian Process Regression [49.0787777751317]
  Gaussian process regression is widely used to provide well-calibrated uncertainty estimates. It struggles with high-dimensional data because of the implicit low-dimensional manifold upon which the data actually lies. In this paper we propose a technique capable of inferring implicit structure directly from data (labeled and unlabeled) in a fully differentiable way.
  arXiv  Detail & Related papers  (2023-10-30T09:52:48Z)
• Your diffusion model secretly knows the dimension of the data manifold [0.0]
  A diffusion model approximates the gradient of the log density of a noise-corrupted version of the target distribution for varying levels of corruption. We prove that, if the data concentrates around a manifold embedded in the high-dimensional ambient space, then as the level of corruption decreases, the score function points towards the manifold.
  arXiv  Detail & Related papers  (2022-12-23T23:15:14Z)
• LIDL: Local Intrinsic Dimension Estimation Using Approximate Likelihood [10.35315334180936]
  We propose a novel approach to the problem: Local Intrinsic Dimension estimation using approximate Likelihood (LIDL) Our method relies on an arbitrary density estimation method as its subroutine and hence tries to sidestep the dimensionality challenge. We show that LIDL yields competitive results on the standard benchmarks for this problem and that it scales to thousands of dimensions.
  arXiv  Detail & Related papers  (2022-06-29T19:47:46Z)
• Deep Bayesian ICP Covariance Estimation [3.5136071950790737]
  Iterative Closest Point (ICP) point cloud registration algorithm is essential for state estimation and sensor fusion purposes. We argue that a major source of error for ICP is in the input data itself, from the sensor noise to the scene geometry. Benefiting from recent developments in deep learning for point clouds, we propose a data-driven approach to learn an error model for ICP.
  arXiv  Detail & Related papers  (2022-02-23T16:42:04Z)
• Supervised Linear Dimension-Reduction Methods: Review, Extensions, and Comparisons [6.71092092685492]
  Principal component analysis (PCA) is a well-known linear dimension-reduction method that has been widely used in data analysis and modeling. This paper reviews selected techniques, extends some of them, and compares their performance through simulations. Two of these techniques, partial least squares (PLS) and least-squares PCA (LSPCA), consistently outperform the others in this study.
  arXiv  Detail & Related papers  (2021-09-09T17:57:25Z)
• Manifold Hypothesis in Data Analysis: Double Geometrically-Probabilistic Approach to Manifold Dimension Estimation [92.81218653234669]
  We present new approach to manifold hypothesis checking and underlying manifold dimension estimation. Our geometrical method is a modification for sparse data of a well-known box-counting algorithm for Minkowski dimension calculation. Experiments on real datasets show that the suggested approach based on two methods combination is powerful and effective.
  arXiv  Detail & Related papers  (2021-07-08T15:35:54Z)
• On the minmax regret for statistical manifolds: the role of curvature [68.8204255655161]
  Two-part codes and the minimum description length have been successful in delivering procedures to single out the best models. We derive a sharper expression than the standard one given by the complexity, where the scalar curvature of the Fisher information metric plays a dominant role.
  arXiv  Detail & Related papers  (2020-07-06T17:28:19Z)

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.