Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization
arXiv:2510. 02308v2 Announce Type: replace Abstract: Estimating the tangent spaces of a data manifold is a fundamental problem in geometric data analysis.
arXiv:2510. 15141v5 Announce Type: replace-cross Abstract: Most existing manifold dimension estimators rely on the assumption that the underlying manifold is locally flat within the neighborhoods under consideration.
arXiv:2510. 02308v2 Announce Type: replace Abstract: Estimating the tangent spaces of a data manifold is a fundamental problem in geometric data analysis.
arXiv:2608. 15313v1 Announce Type: cross Abstract: In this paper, we propose SHOPCA (Shape Operator-based Principal Component Analysis), a novel method for unsupervised metric learning and dimensionality reduction that incorporates differential geometric information into the covariance structure of classical PCA.
arXiv:2606. 06233v1 Announce Type: cross Abstract: Principal component analysis (PCA) is one of the most widely used unsupervised dimension reduction techniques.
arXiv:2601. 19179v2 Announce Type: replace Abstract: Autoencoders have long been considered a nonlinear extension of Principal Component Analysis (PCA).
arXiv:2607. 07034v1 Announce Type: cross Abstract: We introduce Intrinsic Green's Learning (IGL), a framework that models a target function on a manifold as the solution to a linear PDE whose source term is learned from data.
arXiv:2607. 25295v2 Announce Type: replace Abstract: Tensorial multi-view clustering (TMC) has achieved strong performance due to its ability to capture high-order correlations across multiple views.
arXiv:2601. 10199v2 Announce Type: replace Abstract: Multivariate data often exhibit complex dependencies that violate the assumption of isotropic residual noise.
arXiv:2607. 21039v1 Announce Type: new Abstract: Spectral methods are among the most widely used techniques for community detection, clustering, and graph learning.
arXiv:2606. 14334v1 Announce Type: new Abstract: High-dimensional datasets often concentrate near low-dimensional structures, but estimating their geometry from samples typically relies on graphs and kernels that scale poorly with dataset size and dimension.
arXiv:2606. 08799v1 Announce Type: cross Abstract: We study the generalization of ridge-regularized nonlinear least-squares models via on-average algorithmic stability, deriving error bounds for local minimizers in terms of a data-dependent effective dimension that reflects the geometry of the gradient model at the trained parameters, through the empirical Jacobian Gram matrix and a residual--curvature term.
arXiv:2509. 25228v3 Announce Type: replace Abstract: Accurate density estimation is crucial for understanding complex high-dimensional data, but it becomes challenging when the data lies on or near low-dimensional manifolds.
arXiv:2607. 11938v1 Announce Type: cross Abstract: This book is about the mathematical foundations of data science.