Stable Bounds on the Duality Gap of Separable Nonconvex Optimization Problems.

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland show that this produces an a priori bound on the duality gap of separable nonconvex optimization problems involving finite sums. This bound is highly conservative and depends on unstable quantities; we relax it in several directions to show that nonconvexity can have a much milder impact on finite sum minimization problems, such as empirical risk minimization and multitask classification. As a byproduct, we show a new version of Maurey's classical approximate Carathéodory lemma where we sample a significant fraction of the coefficients, without replacement, as well as a result on sampling constraints using an approximate Helly theorem, both of independent interest. Funding: A. d'Aspremont acknowledges support from the French government under management of Agence Nationale de la Recherche as part of the "Investissements d'avenir" program [Grant ANR-19-P3IA-0001] (PRAIRIE 3IA Institute), the Machine Learning and Optimisation Joint Research Initiative with the Fonds AXA pour la Recherche and Kamet Ventures, as well as a Google focused award. [ABSTRACT FROM AUTHOR]