17 citations · 18 across the 5 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2019★ 17 cited
On Robustness to Adversarial Examples and Polynomial Optimization
Pranjal Awasthi, Abhratanu Dutta, Aravindan Vijayaraghavan
We study the design of computationally efficient algorithms with provable guarantees, that are robust to adversarial (test time) perturbations. While there has been an proliferatio…
cs.LG2017
Clustering Stable Instances of Euclidean k-means
Abhratanu Dutta, Aravindan Vijayaraghavan, Alex Wang
The Euclidean k-means problem is arguably the most widely-studied clustering problem in machine learning. While the k-means objective is NP-hard in the worst-case, practitioners ha…