{"id":"https://openalex.org/W7128392026","doi":"https://doi.org/10.48550/arxiv.2602.06545","title":"Operationalizing Stein's Method for Online Linear Optimization: CLT-Based Optimal Tradeoffs","display_name":"Operationalizing Stein's Method for Online Linear Optimization: CLT-Based Optimal Tradeoffs","publication_year":2026,"publication_date":"2026-02-06","ids":{"openalex":"https://openalex.org/W7128392026","doi":"https://doi.org/10.48550/arxiv.2602.06545"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.06545","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125407444","display_name":"Zhiyu Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Zhiyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5032389695","display_name":"Aaditya Ramdas","orcid":"https://orcid.org/0000-0003-0497-311X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ramdas, Aaditya","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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16300672,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.43869999051094055,"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.43869999051094055,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.3862999975681305,"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"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.08429999649524689,"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/regret","display_name":"Regret","score":0.578000009059906},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5665000081062317},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5105999708175659},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5029000043869019},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.4932999908924103},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.45019999146461487},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.41659998893737793},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.39579999446868896}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6169999837875366},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.578000009059906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.567300021648407},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5665000081062317},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5105999708175659},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5029000043869019},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.4932999908924103},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.45019999146461487},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.41659998893737793},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.39579999446868896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37940001487731934},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.375900000333786},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35089999437332153},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.3375000059604645},{"id":"https://openalex.org/C48406656","wikidata":"https://www.wikidata.org/wiki/Q534112","display_name":"Martingale (probability theory)","level":2,"score":0.33250001072883606},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.30230000615119934},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2669000029563904}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.06545","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.06545","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.06545","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":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.06545","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.43002352118492126,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Adversarial":[0],"online":[1,168,204],"linear":[2],"optimization":[3],"(OLO)":[4],"is":[5,60,122],"essentially":[6],"about":[7],"making":[8],"performance":[9,221],"tradeoffs":[10,40,187],"with":[11,152,225],"respect":[12],"to":[13,138,211],"the":[14,18,21,77,106,125,153,157,162,189,193,209],"unknown":[15],"difficulty":[16],"of":[17,23,79,129,167,184],"adversary.":[19],"In":[20],"setting":[22],"one-dimensional":[24],"fixed-time":[25],"OLO":[26,89,224],"on":[27,213],"a":[28,73,130,182],"bounded":[29],"domain,":[30],"it":[31],"has":[32],"been":[33],"observed":[34],"since":[35],"Cover":[36],"(1966)":[37],"that":[38,70,103],"achievable":[39],"are":[41,99],"governed":[42],"by":[43,68,115,124,207],"probabilistic":[44,80],"inequalities,":[45],"and":[46,94,110,172,192],"these":[47],"descriptive":[48],"results":[49],"can":[50,83,144,180],"be":[51,84,145],"converted":[52],"into":[53],"algorithms":[54],"via":[55],"dynamic":[56],"programming,":[57],"which,":[58],"however,":[59],"not":[61],"computationally":[62,87],"efficient.":[63],"We":[64],"address":[65],"this":[66,148],"limitation":[67],"showing":[69],"Stein's":[71],"method,":[72],"classical":[74],"framework":[75],"underlying":[76],"proofs":[78],"limit":[81,134],"theorems,":[82],"operationalized":[85],"as":[86],"efficient":[88],"algorithms.":[90],"The":[91],"associated":[92],"regret":[93,195],"total":[95,163,190],"loss":[96,164,191],"upper":[97,165],"bounds":[98,114,166],"\"additively":[100],"sharp\",":[101],"meaning":[102],"they":[104],"surpass":[105],"conventional":[107],"big-O":[108],"optimality":[109],"match":[111],"normal-approximation-based":[112],"lower":[113,117],"additive":[116],"order":[118],"terms.":[119],"Our":[120],"construction":[121],"inspired":[123],"remarkably":[126],"clean":[127],"proof":[128],"Wasserstein":[131],"martingale":[132],"central":[133],"theorem":[135],"(CLT)":[136],"due":[137],"R\u00f6llin":[139],"(2018).":[140],"Several":[141],"concrete":[142],"benefits":[143],"obtained":[146],"from":[147],"general":[149],"technique.":[150],"First,":[151],"same":[154],"computational":[155],"complexity,":[156],"proposed":[158],"algorithm":[159,179],"improves":[160],"upon":[161,199],"gradient":[169],"descent":[170],"(OGD)":[171],"multiplicative":[173],"weight":[174],"update":[175],"(MWU).":[176],"Second,":[177],"our":[178],"realize":[181],"continuum":[183],"optimal":[185],"two-point":[186],"between":[188],"maximum":[194],"over":[196],"comparators,":[197],"improving":[198],"prior":[200],"works":[201],"in":[202],"parameter-free":[203],"learning.":[205],"Third,":[206],"allowing":[208],"adversary":[210],"randomize":[212],"an":[214],"unbounded":[215],"support,":[216],"we":[217],"achieve":[218],"sharp":[219],"in-expectation":[220],"guarantees":[222],"for":[223],"noisy":[226],"feedback.":[227]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-02-10T00:00:00"}