Search Results for author:
Found 3 papers, 0 papers with code
Clustering Mixture Models in Almost-Linear Time via List-Decodable Mean Estimation
We leverage this result, together with additional techniques, to obtain the first almost-linear time algorithms for clustering mixtures of $k$ separated well-behaved distributions, nearly-matching the statistical guarantees of spectral methods.
List-Decodable Mean Estimation in Nearly-PCA Time
Our algorithm runs in time $\widetilde{O}(ndk)$ for all $k = O(\sqrt{d}) \cup \Omega(d)$, where $n$ is the size of the dataset.
List-Decodable Mean Estimation via Iterative Multi-Filtering
We study the problem of {\em list-decodable mean estimation} for bounded covariance distributions.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
