Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta
{"title":"通过简单步骤对广义自洽函数进行可扩展的弗兰克-沃尔夫计算","authors":"Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta","doi":"10.1137/23m1616789","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Optimization, Volume 34, Issue 3, Page 2231-2258, September 2024. <br/> 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 [math], obtaining an [math] convergence rate for this class of functions in terms of primal gap and Frank–Wolfe gap, where [math] 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.","PeriodicalId":49529,"journal":{"name":"SIAM Journal on Optimization","volume":null,"pages":null},"PeriodicalIF":2.6000,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scalable Frank–Wolfe on Generalized Self-Concordant Functions via Simple Steps\",\"authors\":\"Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta\",\"doi\":\"10.1137/23m1616789\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Optimization, Volume 34, Issue 3, Page 2231-2258, September 2024. <br/> 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 [math], obtaining an [math] convergence rate for this class of functions in terms of primal gap and Frank–Wolfe gap, where [math] 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.\",\"PeriodicalId\":49529,\"journal\":{\"name\":\"SIAM Journal on Optimization\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2024-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/23m1616789\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1616789","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Scalable Frank–Wolfe on Generalized Self-Concordant Functions via Simple Steps
SIAM Journal on Optimization, Volume 34, Issue 3, Page 2231-2258, September 2024. 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 [math], obtaining an [math] convergence rate for this class of functions in terms of primal gap and Frank–Wolfe gap, where [math] 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.
期刊介绍:
The SIAM Journal on Optimization contains research articles on the theory and practice of optimization. The areas addressed include linear and quadratic programming, convex programming, nonlinear programming, complementarity problems, stochastic optimization, combinatorial optimization, integer programming, and convex, nonsmooth and variational analysis. Contributions may emphasize optimization theory, algorithms, software, computational practice, applications, or the links between these subjects.