Stochastic In-Face Frank-Wolfe Methods for Non-Convex Optimization and Sparse Neural Network Training

arXiv1906.03580MaRDI QIDQ6320193FDOQ6320193

Paul Grigas, Alfonso Lobos, Nathan Vermeersch

Publication date: 9 June 2019

Abstract: The Frank-Wolfe method and its extensions are well-suited for delivering solutions with desirable structural properties, such as sparsity or low-rank structure. We introduce a new variant of the Frank-Wolfe method that combines Frank-Wolfe steps and steepest descent steps, as well as a novel modification of the "Frank-Wolfe gap" to measure convergence in the non-convex case. We further extend this method to incorporate in-face directions for preserving structured solutions as well as block coordinate steps, and we demonstrate computational guarantees in terms of the modified Frank-Wolfe gap for all of these variants. We are particularly motivated by the application of this methodology to the training of neural networks with sparse properties, and we apply our block coordinate method to the problem of $el{l}_1$ regularized neural network training. We present the results of several numerical experiments on both artificial and real datasets demonstrating significant improvements of our method in training sparse neural networks.

Has companion code repository: https://github.com/AlfLobos/Stochastic-In-Face-Frank-Wolfe-v1.0

This page was built for publication: Stochastic In-Face Frank-Wolfe Methods for Non-Convex Optimization and Sparse Neural Network Training

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6320193)