A unified optimization view on generalized matching pursuit and Frank-Wolfe

Authors

Francesco Locatello, Rajiv Khanna, Michael Tschannen, and Martin Jaggi

Reference

Proc. of International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 860-868, Feb. 2017.

[BibTeX, LaTeX, and HTML Reference]

Abstract

Two of the most fundamental prototypes of greedy optimization are the matching pursuit and Frank-Wolfe algorithms. In this paper, we take a unified view on both classes of methods, leading to the first explicit convergence rates of matching pursuit methods in an optimization sense, for general sets of atoms. We derive sublinear (1/t) convergence for both classes on general smooth objectives, and linear convergence on strongly convex objectives, as well as a clear correspondence of algorithm variants. Our presented algorithms and rates are affine invariant, and do not need any incoherence or sparsity assumptions.


Download this document:

 

Copyright Notice: © 2017 F. Locatello, R. Khanna, M. Tschannen, and M. Jaggi.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.