arXiv (All)
open access
Algorithmic threshold for high-dimensional projection pursuit I: general theory
We study a null model of high-dimensional projection pursuit: we are given $M$ points sampled i.i.d. from a standard gaussian in $N$ dimensions, where $M,N\to\infty$ with $M/N\toα\in(0,\infty)$. Our goal is to characterize the possible empirical distributions of these points' projections along a dat
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Algorithmic threshold for high-dimensional projection pursuit I: general theory#790187
- The Exact Online Threshold for the Asymmetric Binary Perceptron#822524
- Optimal Discrimination of Gaussian States by Gaussian Measurements#1076832
- Stable and Online Algorithms for Random Matrix Discrepancy#1156862
- Gaussian Convolution, Internal Energies, and the Kneser--Poulsen Conjecture#1083213
Record · ID 794206
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive