English

Convexity-Driven Projection for Point Cloud Dimensionality Reduction

Machine Learning 2025-09-29 v1 Machine Learning

Abstract

We propose Convexity-Driven Projection (CDP), a boundary-free linear method for dimensionality reduction of point clouds that targets preserving detour-induced local non-convexity. CDP builds a kk-NN graph, identifies admissible pairs whose Euclidean-to-shortest-path ratios are below a threshold, and aggregates their normalized directions to form a positive semidefinite non-convexity structure matrix. The projection uses the top-kk eigenvectors of the structure matrix. We give two verifiable guarantees. A pairwise a-posteriori certificate that bounds the post-projection distortion for each admissible pair, and an average-case spectral bound that links expected captured direction energy to the spectrum of the structure matrix, yielding quantile statements for typical distortion. Our evaluation protocol reports fixed- and reselected-pairs detour errors and certificate quantiles, enabling practitioners to check guarantees on their data.

Keywords

Cite

@article{arxiv.2509.22043,
  title  = {Convexity-Driven Projection for Point Cloud Dimensionality Reduction},
  author = {Suman Sanyal},
  journal= {arXiv preprint arXiv:2509.22043},
  year   = {2025}
}
R2 v1 2026-07-01T05:58:13.298Z