Sign-rank vs Margin
summary
Two strong negative answers: small sign-rank does not force small margin because an explicit inner‑product construction (rows/columns are integer vectors) achieves sign-rank 3 with gamma2_infty = poly(N); the lower bound uses careful Fourier‑analysis to pick a distribution that balances every rectangle. The other direction also fails: low margin need not imply low sign‑rank — a continuous sphere/partial‑matrix version has full dimension by a Borsuk–Ulam obstruction, showing the Johnson–Lindenstrauss log factor is necessary. A related separation uses a modular‑prime randomized protocol to keep approximate gamma2 small while exact gamma2 is large.
AI-written summary · about
chapters (5)
related talks
36mThe Rank of Sparse Random Matrices
45mTractability And Overparametrization In Some Simple Models
35mSmoothed Analysis of Low Rank Solutions to Semidefinite Programs via Burer Monteiro Factorization
01h 23mGeneralization II
01h 23mImplicit Regularization II
23mHow Large is the Norm of a Random Matrix?
23mLow-Rank Matrix Recovery Through Rank-One Projections
01h 10mOptimization II
