{"id":"https://openalex.org/W4416176683","doi":"https://doi.org/10.48550/arxiv.2508.06743","title":"Analysis of Schedule-Free Nonconvex Optimization","display_name":"Analysis of Schedule-Free Nonconvex Optimization","publication_year":2025,"publication_date":"2025-08-08","ids":{"openalex":"https://openalex.org/W4416176683","doi":"https://doi.org/10.48550/arxiv.2508.06743"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2508.06743","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.06743","pdf_url":"https://arxiv.org/pdf/2508.06743","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.06743","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Brown, Connor","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Brown, Connor","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"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.9527000188827515,"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.9527000188827515,"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.021700000390410423,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.006800000090152025,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5741999745368958},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5637000203132629},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5099999904632568},{"id":"https://openalex.org/keywords/hyperparameter","display_name":"Hyperparameter","score":0.4564000070095062},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4320000112056732},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41620001196861267},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.3856000006198883},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.383899986743927}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6567999720573425},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6215999722480774},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5741999745368958},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5637000203132629},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5099999904632568},{"id":"https://openalex.org/C8642999","wikidata":"https://www.wikidata.org/wiki/Q4171168","display_name":"Hyperparameter","level":2,"score":0.4564000070095062},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4503999948501587},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4320000112056732},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41620001196861267},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3856000006198883},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.383899986743927},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3741999864578247},{"id":"https://openalex.org/C60640748","wikidata":"https://www.wikidata.org/wiki/Q2337858","display_name":"Lyapunov function","level":3,"score":0.36809998750686646},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3537999987602234},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.3467000126838684},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.34279999136924744},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27639999985694885},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2508.06743","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.06743","pdf_url":"https://arxiv.org/pdf/2508.06743","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.06743","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2508.06743","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2508.06743","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.06743","pdf_url":"https://arxiv.org/pdf/2508.06743","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":{"First-order":[0],"methods":[1],"underpin":[2],"most":[3],"large-scale":[4],"learning":[5],"algorithms,":[6],"yet":[7],"their":[8],"classical":[9],"convergence":[10],"guarantees":[11,154],"hinge":[12],"on":[13,19,61,139],"carefully":[14],"scheduled":[15],"step-sizes":[16],"that":[17,39,127,134],"depend":[18],"the":[20,90,140],"total":[21],"horizon":[22],"$T$,":[23],"which":[24],"is":[25],"rarely":[26],"known":[27],"in":[28,89],"advance.":[29],"The":[30],"Schedule-Free":[31],"(SF)":[32],"method":[33],"promises":[34],"optimal":[35,164],"performance":[36],"with":[37,121],"hyperparameters":[38],"are":[40],"independent":[41],"of":[42,54,111],"$T$":[43],"by":[44],"interpolating":[45],"between":[46],"Polyak--Ruppert":[47],"averaging":[48],"and":[49,75,108,132,159],"momentum,":[50],"but":[51],"nonconvex":[52,91,142,157,165],"analysis":[53,79],"SF":[55,78,143],"has":[56],"been":[57],"limited":[58],"or":[59],"reliant":[60],"strong":[62],"global":[63],"assumptions.":[64],"We":[65,117],"introduce":[66],"a":[67,81,104,109],"robust":[68],"Lyapunov":[69],"framework":[70],"that,":[71],"under":[72],"only":[73],"$L$-smoothness":[74],"lower-boundedness,":[76],"reduces":[77],"to":[80,147,155],"single-step":[82],"descent":[83],"inequality.":[84],"This":[85],"yields":[86],"horizon-agnostic":[87],"bounds":[88],"setting:":[92],"$O(1/\\log":[93,136],"T)$":[94,137],"for":[95,103,114,163],"constant":[96],"step":[97],"+":[98],"PR":[99],"averaging,":[100],"$O(\\log":[101],"T/T)$":[102],"linearly":[105],"growing":[106],"step-size,":[107],"continuum":[110],"$O(T^{-(1-\u03b1)})$":[112],"rates":[113,131],"polynomial":[115],"averaging.":[116],"complement":[118],"these":[119],"proofs":[120],"Performance":[122],"Estimation":[123],"Problem":[124],"(PEP)":[125],"experiments":[126],"numerically":[128],"validate":[129],"our":[130,135],"suggest":[133],"bound":[138],"original":[141],"algorithm":[144],"may":[145],"tighten":[146],"$O(1/T)$.":[148],"Our":[149],"work":[150],"extends":[151],"SF's":[152],"horizon-free":[153],"smooth":[156],"optimization":[158],"charts":[160],"future":[161],"directions":[162],"rates.":[166]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}