{"id":"https://openalex.org/W4416177826","doi":"https://doi.org/10.48550/arxiv.2508.06884","title":"Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and $(L_0, L_1)$-Smoothness","display_name":"Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and $(L_0, L_1)$-Smoothness","publication_year":2025,"publication_date":"2025-08-09","ids":{"openalex":"https://openalex.org/W4416177826","doi":"https://doi.org/10.48550/arxiv.2508.06884"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2508.06884","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.06884","pdf_url":"https://arxiv.org/pdf/2508.06884","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2508.06884","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070820740","display_name":"Alexander Tyurin","orcid":"https://orcid.org/0000-0003-4963-8227"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tyurin, Alexander","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070820740"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9624000191688538,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9624000191688538,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.023900000378489494,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.003800000064074993,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5537999868392944},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5401999950408936},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5252000093460083},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.506600022315979},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.47859999537467957},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4771000146865845},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.4417000114917755},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.41620001196861267},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.40959998965263367}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6358000040054321},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5537999868392944},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5401999950408936},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5252000093460083},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5206999778747559},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.506600022315979},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4916999936103821},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.47859999537467957},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4771000146865845},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.4417000114917755},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.41620001196861267},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.40959998965263367},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.40130001306533813},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3903999924659729},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.38769999146461487},{"id":"https://openalex.org/C60640748","wikidata":"https://www.wikidata.org/wiki/Q2337858","display_name":"Lyapunov function","level":3,"score":0.3781000077724457},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.34709998965263367},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.3319999873638153},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.32659998536109924},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.3230000138282776},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3190000057220459},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.2946999967098236},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26570001244544983},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2572000026702881}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2508.06884","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.06884","pdf_url":"https://arxiv.org/pdf/2508.06884","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2508.06884","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2508.06884","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2508.06884","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.06884","pdf_url":"https://arxiv.org/pdf/2508.06884","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,105],"study":[1],"first-order":[2],"methods":[3],"for":[4,98,127,135],"convex":[5],"optimization":[6],"problems":[7],"with":[8],"functions":[9],"$f$":[10],"satisfying":[11],"the":[12,23,36,54,72,102,147],"recently":[13],"proposed":[14],"$\\ell$-smoothness":[15,66],"condition":[16],"$||\\nabla^{2}f(x)||":[17],"\\le":[18],"\\ell\\left(||\\nabla":[19],"f(x)||\\right),$":[20],"which":[21],"generalizes":[22],"$L$-smoothness":[24],"and":[25,51,59,115,129,150],"$(L_{0},L_{1})$-smoothness.":[26],"While":[27],"accelerated":[28,159],"gradient":[29],"descent":[30],"AGD":[31],"is":[32,47,53,96,143],"known":[33],"to":[34,65],"reach":[35],"optimal":[37,61,145],"complexity":[38,126],"$O(\\sqrt{L}":[39],"R":[40,92,122,140],"/":[41,93,123,141],"\\sqrt{\\varepsilon})$":[42,94,124,142],"under":[43],"$L$-smoothness,":[44],"where":[45],"$\\varepsilon$":[46],"an":[48,60,89],"error":[49],"tolerance":[50],"$R$":[52],"distance":[55],"between":[56],"a":[57,111],"starting":[58],"point,":[62],"existing":[63],"extensions":[64],"either":[67],"incur":[68],"extra":[69],"dependence":[70],"on":[71],"initial":[73],"gradient,":[74],"suffer":[75],"exponential":[76],"factors":[77,155],"in":[78,101,146,157],"$L_{1}":[79],"R$,":[80],"or":[81],"require":[82],"costly":[83],"auxiliary":[84],"sub-routines,":[85],"leaving":[86],"open":[87,108],"whether":[88],"AGD-type":[90],"$O(\\sqrt{\\ell(0)}":[91,121],"rate":[95],"possible":[97],"small-$\\varepsilon$,":[99],"even":[100],"$(L_{0},L_{1})$-smoothness":[103],"case.":[104],"resolve":[106],"this":[107],"question.":[109],"Leveraging":[110],"new":[112,117],"Lyapunov":[113],"function":[114],"designing":[116],"algorithms,":[118],"we":[119],"achieve":[120],"oracle":[125],"small-$\\varepsilon$":[128,148],"virtually":[130],"any":[131],"$\\ell$.":[132],"For":[133],"instance,":[134],"$(L_{0},L_{1})$-smoothness,":[136],"our":[137],"bound":[138],"$O(\\sqrt{L_0}":[139],"provably":[144],"regime":[149],"removes":[151],"all":[152],"non-constant":[153],"multiplicative":[154],"present":[156],"prior":[158],"algorithms.":[160]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}