New Challenges in Machine Learning – Robustness and Nonconvexity

June 23, 2017
STOC 2017, Montreal, Canada

Submission deadline: May 27, 2017

Machine learning has gone through a major transformation in the last decade. Traditional methods based on convex optimization have been replaced by highly non-convex approaches including deep learning. In the worst-case, the underlying optimization problems are NP-hard. Therefore to understand their success, we need new tools to characterize properties of natural inputs, and design algorithms that work provably in beyond-worst-case settings. In particular, robustness and nonconvexity are two of the major challenges.