Learning with Gradient Descent and Weakly Convex Losses

Dominic Richards, Mike Rabbat

We study the learning performance of gradient descent when the empirical risk is weakly convex, namely, the smallest negative eigenvalue of the empirical risk's Hessian is bounded…