Search Results for author:
Found 4 papers, 0 papers with code
Faster Spectral Density Estimation and Sparsification in the Nuclear Norm
We provide a randomized algorithm that, with $O(n\epsilon^{-2})$ queries to a degree and neighbor oracle and in $O(n\epsilon^{-3})$ time, estimates the spectrum up to $\epsilon$ accuracy in the Wasserstein-1 metric.
Moments, Random Walks, and Limits for Spectrum Approximation
We study lower bounds for the problem of approximating a one dimensional distribution given (noisy) measurements of its moments.
Regularized spectral methods for clustering signed networks
We study the problem of $k$-way clustering in signed graphs.
On Euclidean $k$-Means Clustering with $α$-Center Proximity
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.
