3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2020★ 3 cited
Robustly Learning Mixtures of Arbitrary Gaussians
Ainesh Bakshi, Ilias Diakonikolas, He Jia +3
We give a polynomial-time algorithm for the problem of robustly estimating a mixture of arbitrary Gaussians in , for any fixed , in the presence of a constant…
cs.LG2011
Submodular Functions Are Noise Stable
Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari +1
We show that all non-negative submodular functions have high {\em noise-stability}. As a consequence, we obtain a polynomial-time learning algorithm for this class with respect to…