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

@article{Diakonikolas2020SmallCF,
title={Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models},
author={Ilias Diakonikolas and D. Kane},
journal={2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)},
year={2020},
pages={184-195}
}
• Published 2020
• Computer Science, Mathematics
• 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
• Let <tex>$V$</tex> be any vector space of multivariate degree-<tex>$d$</tex> homogeneous polynomials with co-dimension at most <tex>$k$</tex>, and <tex>$S$</tex> be the set of points where all polynomials in <tex>$V$</tex> nearly vanish. We establish a qualitatively optimal upper bound on the size of <tex>$\epsilon$</tex>-covers for <tex>$S$</tex>, in the <tex>$\ell_{2}$</tex>-norm. Roughly speaking, we show that there exists an <tex>$\epsilon$</tex>-cover for <tex>$S$</tex> of cardinality <tex… CONTINUE READING

#### References

SHOWING 1-10 OF 61 REFERENCES
Sample-Optimal Density Estimation in Nearly-Linear Time
• Computer Science, Mathematics
• SODA
• 2017
• 72
• PDF
Reliably Learning the ReLU in Polynomial Time
• Computer Science, Mathematics
• COLT
• 2017
• 78
• PDF
Sparse Solutions to Nonnegative Linear Systems and Applications
• Mathematics, Computer Science
• AISTATS
• 2015
• 9
• PDF
Learning One-hidden-layer Neural Networks with Landscape Design
• Computer Science, Mathematics
• ICLR
• 2018
• 154
• PDF
Learning Mixtures of Linear Regressions with Nearly Optimal Complexity
• Computer Science, Mathematics
• COLT
• 2018
• 28
• Highly Influential
• PDF