English

How Does Momentum Help Frank Wolfe?

Optimization and Control 2020-06-22 v1 Machine Learning Machine Learning

Abstract

We unveil the connections between Frank Wolfe (FW) type algorithms and the momentum in Accelerated Gradient Methods (AGM). On the negative side, these connections illustrate why momentum is unlikely to be effective for FW type algorithms. The encouraging message behind this link, on the other hand, is that momentum is useful for FW on a class of problems. In particular, we prove that a momentum variant of FW, that we term accelerated Frank Wolfe (AFW), converges with a faster rate O~(1k2)\tilde{\cal O}(\frac{1}{k^2}) on certain constraint sets despite the same O(1k){\cal O}(\frac{1}{k}) rate as FW on general cases. Given the possible acceleration of AFW at almost no extra cost, it is thus a competitive alternative to FW. Numerical experiments on benchmarked machine learning tasks further validate our theoretical findings.

Keywords

Cite

@article{arxiv.2006.11116,
  title  = {How Does Momentum Help Frank Wolfe?},
  author = {Bingcong Li and Mario Coutino and Georgios B. Giannakis and Geert Leus},
  journal= {arXiv preprint arXiv:2006.11116},
  year   = {2020}
}
R2 v1 2026-06-23T16:27:49.603Z