1 code implementation • 18 Oct 2019 • Yasaman Esfandiari, Aditya Balu, Keivan Ebrahimi, Umesh Vaidya, Nicola Elia, Soumik Sarkar
Under the assumptions that the cost function is convex and uncertainties enter concavely in the robust learning problem, we analytically show that our algorithm converges asymptotically to the robust optimal solution under a general adversarial budget constraints as induced by $\ell_p$ norm, for $1\leq p\leq \infty$.
1 code implementation • 30 Dec 2017 • Sambarta Dasgupta, Keivan Ebrahimi, Umesh Vaidya
In this work, we propose a novel method to cluster the data points using dynamical systems theory.