Dvoretzky type theorems for subgaussian coordinate projections
Shahar Mendelson

TL;DR
This paper extends Dvoretzky's theorem to subgaussian function classes, demonstrating that typical coordinate projections of such classes exhibit nearly Euclidean structure, generalizing linear random projections in geometric analysis.
Contribution
It introduces a Dvoretzky type theorem for subgaussian classes of functions, broadening the scope of geometric analysis to nonlinear function classes.
Findings
Typical coordinate projections of subgaussian classes are nearly Euclidean.
The results generalize linear random projection properties in geometric analysis.
Provides a framework for understanding the structure of function class projections.
Abstract
Given a class of functions on a probability space , we study the structure of a typical coordinate projection of the class, defined by , where are independent, selected according to . This notion of projection generalizes the standard linear random projection used in Asymptotic Geometric Analysis. We show that when is a subgaussian class of functions, a typical coordinate projection satisfies a Dvoretzky type theorem.
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
TopicsPoint processes and geometric inequalities · Advanced Numerical Analysis Techniques · Digital Image Processing Techniques
