{"id":"https://openalex.org/W7164041865","doi":"https://doi.org/10.48550/arxiv.2606.08028","title":"Noise-Adaptive High-Probability Regret Bounds for Online Convex Optimization","display_name":"Noise-Adaptive High-Probability Regret Bounds for Online Convex Optimization","publication_year":2026,"publication_date":"2026-06-06","ids":{"openalex":"https://openalex.org/W7164041865","doi":"https://doi.org/10.48550/arxiv.2606.08028"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.08028","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.08028","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2606.08028","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138246848","display_name":"Wentao Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Wentao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125564153","display_name":"Yutong Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Yutong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5121318592","display_name":"Wentao Mo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mo, Wentao","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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9147999882698059,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9147999882698059,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.05950000137090683,"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.007899999618530273,"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.8396999835968018},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5892000198364258},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5250999927520752},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4578000009059906},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.44359999895095825},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.3808000087738037},{"id":"https://openalex.org/keywords/martingale","display_name":"Martingale (probability theory)","score":0.3806000053882599},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.3736000061035156},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.3734999895095825}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8396999835968018},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.670199990272522},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5892000198364258},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5292999744415283},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5250999927520752},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4578000009059906},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.44359999895095825},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3808000087738037},{"id":"https://openalex.org/C48406656","wikidata":"https://www.wikidata.org/wiki/Q534112","display_name":"Martingale (probability theory)","level":2,"score":0.3806000053882599},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.3736000061035156},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.3734999895095825},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.36480000615119934},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.3522999882698059},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3515999913215637},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.3513999879360199},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.33149999380111694},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.31850001215934753},{"id":"https://openalex.org/C106195933","wikidata":"https://www.wikidata.org/wiki/Q7847935","display_name":"Truncation (statistics)","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.3059000074863434},{"id":"https://openalex.org/C18015164","wikidata":"https://www.wikidata.org/wiki/Q6935000","display_name":"Multiplicative noise","level":5,"score":0.30140000581741333},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.2903999984264374},{"id":"https://openalex.org/C75432250","wikidata":"https://www.wikidata.org/wiki/Q29654355","display_name":"Real line","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C115483411","wikidata":"https://www.wikidata.org/wiki/Q3075186","display_name":"Convex conjugate","level":5,"score":0.2831000089645386},{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.273499995470047},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.26669999957084656},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.2646999955177307},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.25850000977516174}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.08028","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.08028","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2606.08028","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.08028","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.47518864274024963}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"high-probability":[2,45,112,157],"regret":[3,46,113,162,169],"bounds":[4],"for":[5,159],"online":[6],"convex":[7,12,139],"optimization":[8],"(OCO)":[9],"with":[10,37,55,147],"strongly":[11,138],"losses":[13],"and":[14,30,163,170],"establish":[15],"three":[16],"results":[17],"that":[18,84],"resolve":[19],"open":[20],"questions":[21],"at":[22],"the":[23,34,50,56,62,73,86,111,121,134],"intersection":[24],"of":[25,70,89,95,137],"noise":[26,57,98],"adaptivity,":[27],"feedback":[28,142],"structure,":[29],"constraint":[31,165],"satisfaction.":[32],"For":[33,102],"full-information":[35],"setting":[36],"sub-Gaussian":[38,97],"stochastic":[39,148],"gradients,":[40],"we":[41,105,154],"prove":[42,106],"a":[43,67,107,130,151],"noise-adaptive":[44],"bound":[47,64],"in":[48,116,118,133],"which":[49],"martingale":[51],"deviation":[52],"term":[53],"scales":[54,114],"level":[58],"$\u03c3$":[59],"rather":[60],"than":[61],"gradient":[63],"$G$,":[65],"yielding":[66],"multiplicative":[68],"improvement":[69],"$G/\u03c3$":[71],"over":[72],"classical":[74],"Azuma-Hoeffding":[75],"baseline.":[76],"Our":[77],"analysis":[78],"introduces":[79],"an":[80],"exponential":[81],"supermartingale":[82],"argument":[83],"bypasses":[85],"bounded-difference":[87],"requirement":[88],"Freedman's":[90],"inequality,":[91],"enabling":[92],"direct":[93],"treatment":[94],"unbounded":[96],"without":[99],"truncation":[100],"artifacts.":[101],"bandit":[103],"feedback,":[104],"minimax":[108],"lower":[109],"bound:":[110],"linearly":[115],"$\\log(1/\u03b4)$,":[117],"contrast":[119],"to":[120],"$\\sqrt{\\log(1/\u03b4)}$":[122],"confidence":[123,135],"cost":[124,136],"under":[125],"full":[126],"information.":[127],"This":[128],"constitutes":[129],"formal":[131],"separation":[132],"OCO":[140,146],"across":[141],"models.":[143],"Regarding":[144],"constrained":[145],"constraints":[149],"satisfying":[150],"Slater":[152],"condition,":[153],"provide":[155],"simultaneous":[156],"guarantees":[158],"both":[160],"cumulative":[161],"long-run":[164],"violation,":[166],"achieving":[167],"$\\mathcal{O}(\\sqrt{T\\log(m/\u03b4)})$":[168],"$\\mathcal{O}(\\sqrt{T}/(\u03b6\u03b4)":[171],"+":[172],"m\\sqrt{T\\log(m/\u03b4)})$":[173],"violation.":[174],"Synthetic":[175],"experiments":[176],"corroborate":[177],"all":[178],"theoretical":[179],"predictions.":[180]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-10T00:00:00"}