Finite-Step Bounds for Iterated Correlation Matrices
Ishrak AlhajjHassan (University of Ostrava)

TL;DR
This paper develops probabilistic bounds on the contraction ratios of iterated Pearson correlation matrices, capturing finite-step expansions that are overlooked by local linearization, and validates these bounds empirically.
Contribution
It introduces the first finite-step probabilistic bounds for Pearson correlation dynamics, using a novel framework validated on various dimensions and initializations.
Findings
Bounds hold with empirical coverage matching nominal levels.
Probability that contraction ratio exceeds 1 is very low under certain conditions.
Extreme upper tail discontinuity observed at dimension 69, indicating rare large deviations.
Abstract
We establish finite-step probabilistic upper bounds on the contraction ratios for iterated Pearson correlation dynamics. Let be the sequence generated by the Pearson update. Define , for , and . Although along convergent trajectories, the ratios may exceed unity in finitely many steps. This behavior is invisible to local linearization. Our main contribution is a probabilistic bounding framework that captures these finite-step expansions. We initialize with i.i.d. entries and let be the induced measure. For , we construct state-dependent bounds satisfying . The functions…
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.
