Search Results for author: Apoorv Vikram Singh

Found 3 papers, 0 papers with code

Moments, Random Walks, and Limits for Spectrum Approximation

no code implementations2 Jul 2023 Yujia Jin, Christopher Musco, Aaron Sidford, Apoorv Vikram Singh

We study lower bounds for the problem of approximating a one dimensional distribution given (noisy) measurements of its moments.

On Euclidean $k$-Means Clustering with $α$-Center Proximity

no code implementations28 Apr 2018 Amit Deshpande, Anand Louis, Apoorv Vikram Singh

On the hardness side we show that for any $\alpha' > 1$, there exists an $\alpha \leq \alpha'$, $(\alpha >1)$, and an $\varepsilon_0 > 0$ such that minimizing the $k$-means objective over clusterings that satisfy $\alpha$-center proximity is NP-hard to approximate within a multiplicative $(1+\varepsilon_0)$ factor.

Clustering

Cannot find the paper you are looking for? You can Submit a new open access paper.