Systems | Information | Learning | Optimization
 

Optimization over nonconvex constraints & Gradient Coding via Sparse Random Graphs

Many problems in modern statistics can be formulated as an optimization problem with structured constraints, where the constraints often exhibit nonconvexity such as sparsity or low rank. However, working with nonconvex constraints presents challenges from both a theoretical and practical point of view. In this talk, we discuss a convergence …