{"id":"https://openalex.org/W7160321266","doi":"https://doi.org/10.48550/arxiv.2605.02127","title":"A Parameter-Free First-Order Algorithm for Non-Convex Optimization with $\\tilde{\\mkern1mu O}(\u03b5^{-5/3})$ Global Rate","display_name":"A Parameter-Free First-Order Algorithm for Non-Convex Optimization with $\\tilde{\\mkern1mu O}(\u03b5^{-5/3})$ Global Rate","publication_year":2026,"publication_date":"2026-05-04","ids":{"openalex":"https://openalex.org/W7160321266","doi":"https://doi.org/10.48550/arxiv.2605.02127"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.02127","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.02127","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.02127","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101283117","display_name":"Sichao Xiong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiong, Sichao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135349302","display_name":"Sadok Jerad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jerad, Sadok","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5064170535","display_name":"Coralia Cartis","orcid":"https://orcid.org/0000-0002-0963-5550"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cartis, Coralia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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.9754999876022339,"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.9754999876022339,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.007799999788403511,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.0071000000461936,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/smoothness","display_name":"Smoothness","score":0.6111999750137329},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5236999988555908},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.4790000021457672},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.4747999906539917},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42809998989105225},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.4262000024318695},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4156000018119812},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.36059999465942383},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.3587999939918518}],"concepts":[{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.6111999750137329},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5963000059127808},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5892999768257141},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5236999988555908},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49950000643730164},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.4790000021457672},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.4747999906539917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4487000107765198},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42809998989105225},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.4262000024318695},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4156000018119812},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.36059999465942383},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3587999939918518},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3359000086784363},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.32749998569488525},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.3269999921321869},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.32170000672340393},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.310699999332428},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.2994999885559082},{"id":"https://openalex.org/C2776003309","wikidata":"https://www.wikidata.org/wiki/Q1988072","display_name":"Adaptive algorithm","level":2,"score":0.29820001125335693},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2946000099182129},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2728999853134155},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.2651999890804291},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.25859999656677246},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.2547999918460846}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.02127","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.02127","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.02127","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.02127","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5545915961265564,"id":"https://metadata.un.org/sdg/16"}],"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],"introduce":[1],"PF-AGD,":[2],"the":[3,24,76],"first":[4],"parameter-free,":[5],"deterministic,":[6],"accelerated":[7],"first-order":[8,28],"method":[9],"to":[10,59,96],"achieve":[11],"$O(\u03b5^{-5/3}\\log(1/\u03b5))$":[12],"oracle":[13],"complexity":[14],"bound":[15,26],"when":[16],"minimizing":[17],"sufficiently":[18],"smooth,":[19],"non-convex":[20,32],"functions;":[21],"this":[22,38],"is":[23,92],"best-known":[25,70],"for":[27],"methods":[29,36],"on":[30],"smooth":[31],"objectives.":[33],"Unlike":[34],"existing":[35],"possessing":[37],"rate":[39],"that":[40,68],"require":[41],"a":[42,55,65,93],"priori":[43],"knowledge":[44],"of":[45,79],"smoothness":[46],"constants,":[47],"we":[48],"use":[49],"an":[50],"adaptive":[51],"backtracking":[52],"scheme":[53],"and":[54,91],"gradient-based":[56],"restart":[57],"mechanism":[58],"estimate":[60],"local":[61],"curvature.":[62],"This":[63],"yields":[64],"practical":[66,77],"algorithm":[67],"matches":[69],"theoretical":[71],"rates.":[72],"Empirically,":[73],"PF-AGD":[74],"outperforms":[75],"variant":[78],"AGD-Until-Guilty":[80],"(Carmon":[81],"et":[82],"al.,":[83],"2017),":[84],"as":[85,87],"well":[86],"other":[88],"parameter-free":[89],"variants,":[90],"viable":[94],"alternative":[95],"nonlinear":[97],"conjugate":[98],"gradient":[99],"methods.":[100]},"counts_by_year":[],"updated_date":"2026-07-01T08:55:40.977307","created_date":"2026-05-06T00:00:00"}