Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models

FOCS, pp. 184-195, 2020.

Cited by: 0|Bibtex|Views3|DOI:https://doi.org/10.1109/FOCS46700.2020.00026
EI
Other Links: arxiv.org|dblp.uni-trier.de

Abstract:

Let $V$ be any vector space of multivariate degree-$d$ homogeneous polynomials with co-dimension at most $k$, and $S$ be the set of points where all polynomials in $V$ {\em nearly} vanish. We establish a qualitatively optimal upper bound on the size of $\epsilon$-covers for $S$, in the $\ell_2$-norm. Roughly speaking, we show that there...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments