Conformal dimensionality reduction / increase
Nicholas J. Daras

TL;DR
This paper introduces two low-complexity algorithms for conformal dimensionality reduction and increase that transform datasets into spaces of different dimensions while preserving angles and local shapes, applicable to any dataset.
Contribution
The paper presents novel conformal homeomorphism-based algorithms for dimension manipulation that work universally and preserve angles, enabling shape preservation in data transformations.
Findings
Algorithms applicable to any dataset regardless of intrinsic dimension
Transform datasets into higher or lower dimensions while preserving angles
Shape preservation locally despite size and shape distortions
Abstract
We give two low-complexity algorithms, one for dimensionality reduction and one for dimensionality increase, which are applicable to any dataset, regardless of whether the set has an intrinsic dimension or not. The corresponding methods introduce chains of compositions of conformal homeomorphisms that transform any data set in a Euclidean space into an isopleth dataset within a Euclidean space of arbitrarily smaller or of arbitrarily larger dimension and preserve all angles, in the sense that all angles formed between points in the original dataset are equal to the angles formed between the images of these points in the new dataset . Because they preserve angles, the two methods also preserve shapes locally, although, in general, the overall sizes and shapes are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Stochastic Gradient Optimization Techniques · Morphological variations and asymmetry
