{"id":"https://openalex.org/W7127999764","doi":"https://doi.org/10.48550/arxiv.2602.04761","title":"Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations","display_name":"Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations","publication_year":2026,"publication_date":"2026-02-04","ids":{"openalex":"https://openalex.org/W7127999764","doi":"https://doi.org/10.48550/arxiv.2602.04761"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.04761","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":"preprint","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/A5125146128","display_name":"Hang Yu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu, Hang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125200123","display_name":"Yu-Hu Yan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yan, Yu-Hu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5125159776","display_name":"Peng Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Peng","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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.8389000296592712,"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.8389000296592712,"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.13609999418258667,"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.00430000014603138,"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.6836000084877014},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6819999814033508},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.6240000128746033},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5634999871253967},{"id":"https://openalex.org/keywords/variation","display_name":"Variation (astronomy)","score":0.5450999736785889},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5293999910354614},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.47540000081062317},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.46540001034736633},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.44929999113082886}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.6836000084877014},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6819999814033508},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.6240000128746033},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5788000226020813},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5634999871253967},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5608000159263611},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.5450999736785889},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5293999910354614},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.47540000081062317},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.46540001034736633},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.44929999113082886},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.44350001215934753},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.43389999866485596},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4138999879360199},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4050999879837036},{"id":"https://openalex.org/C79248915","wikidata":"https://www.wikidata.org/wiki/Q17086776","display_name":"Proximal gradient methods for learning","level":5,"score":0.3874000012874603},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.3736000061035156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34450000524520874},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3199000060558319},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.31299999356269836},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.30649998784065247},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3003999888896942},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.299699991941452},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.2973000109195709},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28220000863075256},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.27000001072883606},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2612000107765198}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.04761","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.04761","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.04761","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":"pmh:doi:10.48550/arxiv.2602.04761","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Gradient-variation":[0],"online":[1],"learning":[2],"has":[3,18],"drawn":[4],"increasing":[5],"attention":[6],"due":[7],"to":[8,12],"its":[9],"deep":[10],"connections":[11],"game":[13],"theory,":[14],"optimization,":[15],"etc.":[16],"It":[17],"been":[19],"studied":[20],"extensively":[21],"in":[22,40,61,141,169],"the":[23,54,68,80,92,109,114,121,136,154],"full-information":[24],"setting,":[25],"but":[26],"is":[27],"underexplored":[28],"with":[29,45,64,79],"bandit":[30,127,151,170],"feedback.":[31,47],"In":[32],"this":[33],"work,":[34],"we":[35,66,112,134],"focus":[36],"on":[37,53],"gradient":[38,56,62,94],"variation":[39,63,95],"Bandit":[41],"Convex":[42],"Optimization":[43],"(BCO)":[44],"two-point":[46,110,163],"By":[48],"proposing":[49],"a":[50,58],"refined":[51],"analysis":[52,90],"non-consecutive":[55,93],"variation,":[57],"fundamental":[59],"quantity":[60],"bandits,":[65],"improve":[67],"dimension":[69],"dependence":[70],"for":[71,91,125,162],"both":[72],"convex":[73,76],"and":[74,105,150,158,165],"strongly":[75],"functions":[77],"compared":[78],"best":[81],"known":[82],"results":[83,140],"(Chiang":[84],"et":[85],"al.,":[86],"2013).":[87],"Our":[88],"improved":[89],"also":[96],"implies":[97],"other":[98],"favorable":[99],"problem-dependent":[100],"guarantees,":[101],"such":[102,145],"as":[103,146],"gradient-variance":[104],"small-loss":[106],"regrets.":[107],"Beyond":[108],"setup,":[111],"demonstrate":[113],"versatility":[115],"of":[116,138],"our":[117,139],"technique":[118],"by":[119],"achieving":[120],"first":[122,155],"gradient-variation":[123,156],"bound":[124],"one-point":[126],"linear":[128],"optimization":[129],"over":[130],"hyper-rectangular":[131],"domains.":[132],"Finally,":[133],"validate":[135],"effectiveness":[137],"more":[142],"challenging":[143],"tasks":[144],"dynamic/universal":[147],"regret":[148,160],"minimization":[149],"games,":[152],"establishing":[153],"dynamic":[157],"universal":[159],"bounds":[161],"BCO":[164],"fast":[166],"convergence":[167],"rates":[168],"games.":[171]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-07T00:00:00"}