142 citations · 752 across the 110 of their papers we have counts for
41 papers · 1 filter
A Spectral Algorithm for List-Decodable Covariance Estimation in Relative Frobenius Norm
Ilias Diakonikolas, Daniel M. Kane, Jasper C. H. Lee +2
We study the problem of list-decodable Gaussian covariance estimation. Given a multiset of points in such that an unknown fraction of points in ar…
A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning
Ilias Diakonikolas, Christos Tzamos, Daniel M. Kane
The Forster transform is a method of regularizing a dataset by placing it in {\em radial isotropic position} while maintaining some of its essential properties. Forster transforms…
Outlier-Robust Sparse Mean Estimation for Heavy-Tailed Distributions
Ilias Diakonikolas, Daniel M. Kane, Jasper C. H. Lee +1
We study the fundamental task of outlier-robust mean estimation for heavy-tailed distributions in the presence of sparsity. Specifically, given a small number of corrupted samples…
Near-Optimal Bounds for Testing Histogram Distributions
Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane +1
We investigate the problem of testing whether a discrete probability distribution over an ordered domain is a histogram on a specified number of bins. One of the most common tools…
Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models
Ilias Diakonikolas, Daniel M. Kane, Yuxin Sun
We establish optimal Statistical Query (SQ) lower bounds for robustly learning certain families of discrete high-dimensional distributions. In particular, we show that no efficient…
List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering
Ilias Diakonikolas, Daniel M. Kane, Sushrut Karmalkar +2
We study the problem of list-decodable sparse mean estimation. Specifically, for a parameter , we are given points in , of whi…