Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Stochastic Frank-Wolfe for Constrained Finite-Sum Minimization (2002.11860v6)

Published 27 Feb 2020 in math.OC and cs.LG

Abstract: We propose a novel Stochastic Frank-Wolfe (a.k.a. conditional gradient) algorithm for constrained smooth finite-sum minimization with a generalized linear prediction/structure. This class of problems includes empirical risk minimization with sparse, low-rank, or other structured constraints. The proposed method is simple to implement, does not require step-size tuning, and has a constant per-iteration cost that is independent of the dataset size. Furthermore, as a byproduct of the method we obtain a stochastic estimator of the Frank-Wolfe gap that can be used as a stopping criterion. Depending on the setting, the proposed method matches or improves on the best computational guarantees for Stochastic Frank-Wolfe algorithms. Benchmarks on several datasets highlight different regimes in which the proposed method exhibits a faster empirical convergence than related methods. Finally, we provide an implementation of all considered methods in an open-source package.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (7)
  1. Geoffrey Négiar (4 papers)
  2. Gideon Dresdner (9 papers)
  3. Alicia Tsai (1 paper)
  4. Laurent El Ghaoui (33 papers)
  5. Francesco Locatello (92 papers)
  6. Robert M. Freund (18 papers)
  7. Fabian Pedregosa (48 papers)
Citations (22)

Summary

We haven't generated a summary for this paper yet.