{"id":"https://openalex.org/W7225810574","doi":"https://doi.org/10.5281/zenodo.24115413","title":"Adversarial bandit convex optimisation with regret d^(3/2) sqrt(n) up to logarithms","display_name":"Adversarial bandit convex optimisation with regret d^(3/2) sqrt(n) up to logarithms","publication_year":2026,"publication_date":"2026-11-11","ids":{"openalex":"https://openalex.org/W7225810574","doi":"https://doi.org/10.5281/zenodo.24115413"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.24115413","doi":"https://doi.org/10.5281/zenodo.24115413","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24115413","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.24115413","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5157206886","display_name":"mt0-svg","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"mt0-svg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5157206886"],"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":1.0,"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":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.0,"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"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.6327999830245972},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.626800000667572},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5885000228881836},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.5755000114440918},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5544000267982483},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.476500004529953},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4490000009536743},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4212999939918518},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.41040000319480896},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.41029998660087585},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.36820000410079956},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.3203999996185303},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.3165999948978424},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2904999852180481},{"id":"https://openalex.org/C126875415","wikidata":"https://www.wikidata.org/wiki/Q203425","display_name":"Unit circle","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2603999972343445}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.5281/zenodo.24115413","doi":"https://doi.org/10.5281/zenodo.24115413","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24115413","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"},{"id":"doi:10.5281/zenodo.24115414","doi":"https://doi.org/10.5281/zenodo.24115414","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24115414","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"},{"id":"doi:10.5281/zenodo.24147205","doi":"https://doi.org/10.5281/zenodo.24147205","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24147205","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.5281/zenodo.24115413","doi":"https://doi.org/10.5281/zenodo.24115413","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24115413","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2473549844","https://openalex.org/W3029005804"],"related_works":[],"abstract_inverted_index":{"This":[0],"is":[1,178,262],"AI-generated":[2],"research:":[3],"the":[4,19,98,133,136,228,231,235,240,248,252,260,270,279],"results,":[5],"proofs":[6,253,277],"and":[7,11,54,67,84,115,184,201,207,213,242,278],"code":[8],"were":[9],"found":[10],"written":[12,225],"by":[13],"AI.":[14],"Credit":[15],"goes":[16],"to":[17,82],"all":[18],"humans":[20],"whose":[21,60],"work":[22],"it":[23],"builds":[24],"on.":[25],"In":[26,89],"adversarial":[27],"bandit":[28,189],"convex":[29,38,44,190],"optimisation":[30],"a":[31,37,105,118,126,165,244,263],"learner":[32,59,119,144,170],"plays":[33],"$n$":[34],"rounds":[35,61],"in":[36,46,65,218],"body":[39],"of":[40,161,181,230,247,259,265],"$\\mathbb":[41],"R^d$":[42],"against":[43,92,153],"losses":[45,158],"$[0,1]$,":[47],"seeing":[48],"only":[49,234],"its":[50],"loss.":[51],"Bubeck,":[52,182],"Eldan":[53,183],"Lee":[55],"conjectured":[56],"that":[57,85],"some":[58,154],"take":[62],"time":[63],"polynomial":[64],"$d$":[66],"$\\ln":[68],"n$":[69,80],"on":[70,100,104,135,159],"polytopes":[71],"with":[72,108,221,233],"polynomially":[73],"many":[74],"rational":[75],"constraints":[76],"has":[77,120,145,171],"regret":[78,123,147,173],"$d^{3/2}\\sqrt":[79,129],"up":[81],"logarithms,":[83],"none":[86],"does":[87],"better.":[88],"their":[90,101],"game,":[91],"an":[93,168],"adaptive":[94],"adversary,":[95],"we":[96],"prove":[97,132],"first":[99],"polytopes,":[102],"timed":[103],"real":[106],"RAM":[107],"square":[109],"root,":[110],"exponential,":[111],"logarithm,":[112],"Gaussian":[113],"draws":[114],"spectral":[116],"functions:":[117],"upper":[121],"expected":[122,146,172],"at":[124,148],"most":[125],"constant":[127],"times":[128],"n\\,\\ln^5(2dn)$.":[130],"We":[131],"second":[134,245],"unit":[137,166],"ball:":[138],"for":[139,188],"$d\\ge4\\cdot10^6$,":[140],"$n\\ge":[141],"d^{10}$":[142],"every":[143],"least":[149],"$7\\cdot10^{-9}d^{3/2}\\sqrt":[150],"n/\\ln":[151],"d$":[152],"adversary.":[155],"For":[156],"fixed":[157],"bodies":[160],"diameter":[162],"$D$":[163],"containing":[164],"ball,":[167],"explicit":[169],"$O(d^{3/2}\\sqrt":[174],"n\\,\\ln^{3/2}(nD))$.":[175],"The":[176],"conjecture":[177],"Conjecture":[179],"1":[180],"Lee,":[185],"Kernel-based":[186],"methods":[187],"optimization,":[191],"J.":[192],"ACM":[193],"68":[194],"(2021);":[195],"arXiv:1607.03084.":[196],"Theorems":[197],"1.1,":[198],"1.3,":[199],"1.4":[200],"1.5,":[202],"Remark":[203],"1.2,":[204],"Corollaries":[205],"8.6":[206],"1.6,":[208],"Proposition":[209],"2.2,":[210],"Theorem":[211],"3.1":[212],"Lemma":[214],"7.13":[215],"are":[216],"proved":[217],"Lean":[219,249,276],"4":[220],"Mathlib,":[222],"from":[223,227],"statements":[224],"out":[226],"definitions":[229],"paper,":[232],"standard":[236],"axioms;":[237],"Comparator":[238],"checks":[239,251],"statements,":[241],"nanoda,":[243],"implementation":[246],"kernel,":[250],"again.":[254],"Every":[255],"other":[256],"numbered":[257],"statement":[258],"paper":[261],"step":[264],"these":[266],"proofs,":[267],"stated":[268],"as":[269],"formal":[271],"proof":[272],"proves":[273],"it.":[274],"Code,":[275],"TeX":[280],"source:":[281],"github.com/mt0-svg/adversarial-bco":[282]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2026-11-12T00:00:00"}