Ayush Sekhari

activity

20172026

most citedRemember What You Want to Forget: Algorithms for Machine Unlearning

67 citations · 145 across the 35 of their papers we have counts for

collaborators

Showing 2019Show all

1 paper · 1 filter

cs.LG2019★ 16 cited

The Complexity of Making the Gradient Small in Stochastic Convex Optimization

Dylan J. Foster, Ayush Sekhari, Ohad Shamir +3

We give nearly matching upper and lower bounds on the oracle complexity of finding $ε$ -stationary points ( $∥\nabla F (x) ∥ \leq ε$ ) in stochastic convex optimization. We jointly a…