{"id":"https://openalex.org/W7105004742","doi":"https://doi.org/10.48550/arxiv.2511.06597","title":"Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality","display_name":"Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality","publication_year":2025,"publication_date":"2025-11-10","ids":{"openalex":"https://openalex.org/W7105004742","doi":"https://doi.org/10.48550/arxiv.2511.06597"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2511.06597","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.06597","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2511.06597","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yan, Yu-Hu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yan, Yu-Hu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Zhao, Peng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Peng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Zhou, Zhi-Hua","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou, Zhi-Hua","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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.8352000117301941,"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.8352000117301941,"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.1160999983549118,"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.006599999964237213,"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/smoothness","display_name":"Smoothness","score":0.5881999731063843},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5602999925613403},{"id":"https://openalex.org/keywords/universality","display_name":"Universality (dynamical systems)","score":0.5370000004768372},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4772999882698059},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4253999888896942},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.38850000500679016},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.33500000834465027},{"id":"https://openalex.org/keywords/offline-learning","display_name":"Offline learning","score":0.32829999923706055}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6355000138282776},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.5881999731063843},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5626000165939331},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5602999925613403},{"id":"https://openalex.org/C183992945","wikidata":"https://www.wikidata.org/wiki/Q2495574","display_name":"Universality (dynamical systems)","level":2,"score":0.5370000004768372},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4772999882698059},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4253999888896942},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.38850000500679016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3824999928474426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37139999866485596},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3580999970436096},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.33500000834465027},{"id":"https://openalex.org/C2780490138","wikidata":"https://www.wikidata.org/wiki/Q7079636","display_name":"Offline learning","level":3,"score":0.32829999923706055},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.31769999861717224},{"id":"https://openalex.org/C80316690","wikidata":"https://www.wikidata.org/wiki/Q755669","display_name":"Dissimilation","level":2,"score":0.3172000050544739},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3059000074863434},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.2883000075817108},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.2603999972343445}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2511.06597","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.06597","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":"doi:10.48550/arxiv.2511.06597","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.06597","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":false,"raw_source_name":null,"raw_type":"article"},"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":{"In":[0,60],"this":[1,41,61,66],"work,":[2,62],"we":[3,63,95,142,206],"study":[4],"offline":[5],"convex":[6,129,151],"optimization":[7],"with":[8,109,219],"smooth":[9,153,178],"objectives,":[10,130,154],"where":[11],"the":[12,20,43,52,79,84,90,97,103,118,144,156,160,186,208],"classical":[13],"Nesterov's":[14],"Accelerated":[15],"Gradient":[16],"(NAG)":[17],"method":[18],"achieves":[19,117],"optimal":[21,91,119,145],"accelerated":[22,120,146],"convergence.":[23],"Extensive":[24],"research":[25],"has":[26],"aimed":[27],"to":[28,65,127,172,176],"understand":[29],"NAG":[30],"from":[31,42],"various":[32],"perspectives,":[33],"and":[34,48,131,138,152,179,190],"a":[35,216],"recent":[36],"line":[37],"of":[38,45,54,99,162,185,210],"work":[39],"approaches":[40],"viewpoint":[44],"online":[46,56,85,111,140],"learning":[47],"online-to-batch":[49,72,136,163,213],"conversion,":[50],"emphasizing":[51],"role":[53],"optimistic":[55,71,115,135,139,167,212],"algorithms":[57],"for":[58,149,155],"acceleration.":[59],"contribute":[64],"perspective":[67],"by":[68,132,196,215],"proposing":[69],"novel":[70],"conversions":[73,101,214],"that":[74],"incorporate":[75],"optimism":[76],"theoretically":[77],"into":[78],"analysis,":[80],"thereby":[81],"significantly":[82],"simplifying":[83],"algorithm":[86],"design":[87],"while":[88],"preserving":[89],"convergence":[92,147],"rates.":[93],"Specifically,":[94],"demonstrate":[96],"effectiveness":[98,209],"our":[100,114,123,166,211],"through":[102,159],"following":[104],"results:":[105],"(i)":[106],"when":[107],"combined":[108],"simple":[110],"gradient":[112,200],"descent,":[113],"conversion":[116,124,137,168],"convergence;":[121],"(ii)":[122],"also":[125],"applies":[126],"strongly":[128,150],"leveraging":[133],"both":[134,177],"algorithms,":[141],"achieve":[143,170],"rate":[148],"first":[157],"time":[158],"lens":[161],"conversion;":[164],"(iii)":[165],"can":[169],"universality":[171],"smoothness":[173,187],"--":[174,189],"applicable":[175],"non-smooth":[180],"objectives":[181],"without":[182],"requiring":[183],"knowledge":[184],"coefficient":[188],"remains":[191],"efficient":[192],"as":[193],"non-universal":[194],"methods":[195],"using":[197],"only":[198],"one":[199],"query":[201],"in":[202],"each":[203],"iteration.":[204],"Finally,":[205],"highlight":[207],"precise":[217],"correspondence":[218],"NAG.":[220]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-12T00:00:00"}