Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.10218 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916016900014080 |
|---|---|
| author | Mirhosseini, Nazanin |
| author_facet | Mirhosseini, Nazanin |
| contents | Standard random projection techniques typically operate as a black box, mapping high-dimensional structures directly to a lower-dimensional space where the target dimension must be specified a \textit{priori}. To address scenarios where the optimal ultimate dimension is unknown, this paper investigates the retention of information through a sequential, step-by-step dimension reduction process. We examine a fixed, bounded convex body as it undergoes successive random orthogonal projections, systematically reducing the ambient dimension by one at each step. By demonstrating that this sequence of observed bodies forms a Markov chain, we quantify the information preserved through these reductions using the conditional mutual information between successive projections given the original convex body. We derive a theoretical upper bound on this conditional mutual information, parameterized by the Haar measure of the projection spaces that yield the same observed body. Leveraging the established Markov property, we extend these results to an arbitrary number of iterations, proving that the initial two-step bound characterizes information retention across the entire sequence of projections. Furthermore, by analyzing the projection space under the symmetry group of the initial body, we demonstrate that geometric asymmetry serves as a beneficial asset, resulting in higher overall information retention. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_10218 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On Geometric Asymmetry and Information in Sequential Dimension Reduction Mirhosseini, Nazanin Signal Processing Standard random projection techniques typically operate as a black box, mapping high-dimensional structures directly to a lower-dimensional space where the target dimension must be specified a \textit{priori}. To address scenarios where the optimal ultimate dimension is unknown, this paper investigates the retention of information through a sequential, step-by-step dimension reduction process. We examine a fixed, bounded convex body as it undergoes successive random orthogonal projections, systematically reducing the ambient dimension by one at each step. By demonstrating that this sequence of observed bodies forms a Markov chain, we quantify the information preserved through these reductions using the conditional mutual information between successive projections given the original convex body. We derive a theoretical upper bound on this conditional mutual information, parameterized by the Haar measure of the projection spaces that yield the same observed body. Leveraging the established Markov property, we extend these results to an arbitrary number of iterations, proving that the initial two-step bound characterizes information retention across the entire sequence of projections. Furthermore, by analyzing the projection space under the symmetry group of the initial body, we demonstrate that geometric asymmetry serves as a beneficial asset, resulting in higher overall information retention. |
| title | On Geometric Asymmetry and Information in Sequential Dimension Reduction |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2508.10218 |