Papers
Topics
Authors
Recent
Search
2000 character limit reached

Scalable Frank-Wolfe on Generalized Self-concordant Functions via Simple Steps

Published 28 May 2021 in math.OC, cs.LG, and stat.ML | (2105.13913v8)

Abstract: Generalized self-concordance is a key property present in the objective function of many important learning problems. We establish the convergence rate of a simple Frank-Wolfe variant that uses the open-loop step size strategy γt=2/(t+2)\gamma_t = 2/(t+2), obtaining a O(1/t)\mathcal{O}(1/t) convergence rate for this class of functions in terms of primal gap and Frank-Wolfe gap, where tt is the iteration count. This avoids the use of second-order information or the need to estimate local smoothness parameters of previous work. We also show improved convergence rates for various common cases, e.g., when the feasible region under consideration is uniformly convex or polyhedral.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (31)
  1. Bach, F. Self-concordant analysis for logistic regression. Electronic Journal of Statistics, 4:384–414, 2010.
  2. FrankWolfe.jl: a high-performance and flexible toolbox for Frank-Wolfe algorithms and conditional gradients. INFORMS Journal on Computing, 34(5):2611–2620, 2022.
  3. Conditional gradient methods. arXiv preprint arXiv:2211.14103, 2022.
  4. Frank-wolfe for generalized self-concordant functions - code repository. https://github.com/ZIB-IOL/fw-generalized-selfconcordant.
  5. Frank-Wolfe for Generalized Self-Concordant Functions - Problem Instances, May 2021. URL https://doi.org/10.5281/zenodo.4836009.
  6. Locally accelerated conditional gradients. In Proceedings of the 23th International Conference on Artificial Intelligence and Statistics, pp.  1737–1747. PMLR, 2020.
  7. Self-concordant analysis of Frank-Wolfe algorithms. In Proceedings of the 37th International Conference on Machine Learning, pp.  2814–2824. PMLR, 2020.
  8. Generalized self-concordant analysis of Frank–Wolfe algorithms. Mathematical Programming, pp.  1–69, 2022.
  9. An algorithm for quadratic programming. Naval research logistics quarterly, 3(1-2):95–110, 1956.
  10. A linearly convergent variant of the conditional gradient algorithm under strong convexity, with applications to online and stochastic optimization. SIAM Journal on Optimization, 26(3):1493–1528, 2016.
  11. Some comments on Wolfe’s ‘away step’. Mathematical Programming, 35(1):110–119, 1986.
  12. Jaggi, M. Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In Proceedings of the 30th International Conference on Machine Learning, pp.  427–435. PMLR, 2013.
  13. Restarting Frank-Wolfe. In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, pp.  1275–1283. PMLR, 2019.
  14. Projection-free optimization on uniformly convex sets. In Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, pp.  19–27. PMLR, 2021.
  15. Barrier Frank-Wolfe for Marginal Inference. In Proceedings of the 28th Conference in Neural Information Processing Systems. PMLR, 2015.
  16. On the global linear convergence of Frank-Wolfe optimization variants. In Proceedings of the 29th Conference on Neural Information Processing Systems, pp.  566–575. PMLR, 2015.
  17. Constrained minimization methods. USSR Computational Mathematics and Mathematical Physics, 6(5):1–50, 1966.
  18. A newton frank–wolfe method for constrained self-concordant minimization. Journal of Global Optimization, pp.  1–27, 2020.
  19. Beyond least-squares: Fast rates for regularized empirical risk minimization through self-concordance. In Proceedings of the 32nd Conference on Learning Theory, pp. 2294–2340. PMLR, 2019.
  20. Nesterov, Y. Gradient methods for minimizing composite functions. Mathematical Programming, 140(1):125–161, 2013.
  21. Interior-point polynomial algorithms in convex programming. SIAM, 1994.
  22. Frank-wolfe works for non-lipschitz continuous gradient objectives: scalable poisson phase retrieval. In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.  6230–6234. Ieee, 2016.
  23. Finite-sample analysis of M-estimators using self-concordance. Electronic Journal of Statistics, 15(1):326–391, 2021.
  24. Linearly convergent Frank–Wolfe with backtracking line-search. In Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics. PMLR, 2020.
  25. Rothvoß, T. The matching polytope has exponential extension complexity. Journal of the ACM (JACM), 64(6):1–19, 2017.
  26. Generalized self-concordant functions: a recipe for Newton-type methods. Mathematical Programming, 178(1):145–213, 2019.
  27. Temlyakov, V. Greedy approximation in convex optimization. Constructive Approximation, 41(2):269–296, 2015.
  28. Composite convex minimization involving self-concordant-like cost functions. In Modelling, Computation and Optimization in Information Systems and Management Sciences, pp.  155–168. Springer, 2015.
  29. Pairwise conditional gradients without swap steps and sparser kernel herding. In International Conference on Machine Learning, pp. 21864–21883. PMLR, 2022.
  30. Wolfe, P. Convergence theory in nonlinear programming. In Integer and Nonlinear Programming, pp.  1–36. North-Holland, Amsterdam, 1970.
  31. Analysis of the Frank–Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier. Mathematical Programming, 199(1-2):123–163, 2023.
Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.