Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions
Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta
摘要
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 𝛾 𝑡 = 2/(𝑡 + 2), obtaining a O (1/𝑡) convergence rate for this class of functions in terms of primal gap and Frank-Wolfe gap, where 𝑡 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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper4
- Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance OrderingsJan MacDonald, Mathieu Besançon, Sebastian PokuttaICML 2022 · 被引用 13 次
- Frank-Wolfe-based Algorithms for Approximating Tyler's M-estimatorLior Danon, Dan GarberNeurIPS 2022 · 被引用 7 次
- Barrier Algorithms for Constrained Non-Convex OptimizationPavel E. Dvurechensky, Mathias StaudiglICML 2024 · 被引用 3 次
- Secant Line Search for Frank-Wolfe AlgorithmsDeborah Hendrych, Sebastian Pokutta, Mathieu Besançon, David Martínez-RubioICML 2025
它引用的顶会 Paper1
相关 Paper
- Beyond Short Steps in Frank-Wolfe AlgorithmsDavid Martínez-Rubio, Sebastian PokuttaICLR 2026 · 被引用 5 次
- Fast Frank-Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex FunctionsShota Takahashi, Sebastian Pokutta, Akiko TakedaICLR 2026 · 被引用 10 次
- Enhancing Parameter-Free Frank Wolfe with an Extra SubproblemBingcong Li, Lingda Wang, Georgios B. Giannakis, Zhizhen ZhaoAAAI 2021 · 被引用 2 次
- Revisiting Frank-Wolfe for Polytopes: Strict Complementarity and SparsityDan GarberNeurIPS 2020 · 被引用 25 次
- Toward a Unified Theory of Gradient Descent under Generalized SmoothnessAlexander TyurinICML 2025
