Polynomial bounds for large Bernoulli sections of 1N

Abstract

We prove a quantitative version of the bound on the smallest singular value of a Bernoulli covariance matrix (due to Bai and Yin). Then we use this bound, together with several recent developments, to show that the distance from a random (1-delta) n - dimensional section of ell1n, realised as an image of a sign matrix, to an Euclidean ball is polynomial in 1/delta (and independent of n), with high probability.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…