( en | de | ru )

 

Disambiguation of "Kane, Daniel M."

Author of the publication

copydeleteadd this publication to your clipboard
Robustly Learning Mixtures of k Arbitrary Gaussians.

, , , , , and . CoRR, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ladji Kane

Gavin Kane

Mamadou Kane

Gerald Kane

Andrew Kane

 

Other publications of authors with the same name

Properly Learning Poisson Binomial Distributions in Almost Polynomial Time., , and . CoRR, (2015)Testing Identity of Multidimensional Histograms., , and . COLT, volume 99 of Proceedings of Machine Learning Research, page 1107-1131. PMLR, (2019)Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures, , and . (2016)cite arxiv:1611.03473Comment: Changes from v1: Revised presentation. Added more applications of the technique (SQ lower bounds for robust sparse mean estimation and robust covariance estimation in spectral norm). Sharpened testing lower bound to linear in the dimension (compared to nearly-linear in first version).Learning Multivariate Log-concave Distributions, , and . (2016)cite arxiv:1605.08188Comment: To appear in COLT 2017.Online Robust Mean Estimation., , , and . CoRR, (2023)Labeling the complete bipartite graph with no zero cycles., , and . Electron. Colloquium Comput. Complex., (2017)Robust Learning of Mixtures of Gaussians.. SODA, page 1246-1258. SIAM, (2021)Robust High-Dimensional Statistics., and . Beyond the Worst-Case Analysis of Algorithms, Cambridge University Press, (2020)Gaussian Mean Testing Made Simple., , and . SOSA, page 348-352. SIAM, (2023)Tight Bounds for Testing k-Linearity., and . APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, page 435-446. Springer, (2012)