{"id":"https://openalex.org/W7138067861","doi":"https://doi.org/10.48550/arxiv.2603.14319","title":"Structure-Dependent Regret and Constraint Violation Bounds for Online Convex Optimization with Time-Varying Constraints","display_name":"Structure-Dependent Regret and Constraint Violation Bounds for Online Convex Optimization with Time-Varying Constraints","publication_year":2026,"publication_date":"2026-03-15","ids":{"openalex":"https://openalex.org/W7138067861","doi":"https://doi.org/10.48550/arxiv.2603.14319"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.14319","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.14319","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":"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.2603.14319","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5121055489","display_name":"Xiufeng Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Xiufeng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129715177","display_name":"Qian Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Qian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129742973","display_name":"Zhijin Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Zhijin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072389245","display_name":"Ruyu Liu","orcid":"https://orcid.org/0000-0003-2130-9122"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Ruyu","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.47589999437332153,"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.47589999437332153,"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.07479999959468842,"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/T13553","display_name":"Age of Information Optimization","score":0.06390000134706497,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5687999725341797},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5342000126838684},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.5325999855995178},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.45680001378059387},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.421099990606308},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.39100000262260437},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3831999897956848},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3528999984264374}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6463000178337097},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5687999725341797},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5342000126838684},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.5325999855995178},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5307000279426575},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.45680001378059387},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.421099990606308},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.39100000262260437},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3831999897956848},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3528999984264374},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.33809998631477356},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.33500000834465027},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.32179999351501465},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3075999915599823},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.30169999599456787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28760001063346863},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.2797999978065491},{"id":"https://openalex.org/C66322947","wikidata":"https://www.wikidata.org/wiki/Q11658","display_name":"Transformer","level":3,"score":0.26820001006126404},{"id":"https://openalex.org/C2986087404","wikidata":"https://www.wikidata.org/wiki/Q15946010","display_name":"Online learning","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.26249998807907104},{"id":"https://openalex.org/C2781045450","wikidata":"https://www.wikidata.org/wiki/Q254569","display_name":"Backdoor","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.2587999999523163},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.14319","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.14319","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":"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.2603.14319","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.14319","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":"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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Online":[0],"convex":[1],"optimization":[2],"(OCO)":[3],"with":[4],"time-varying":[5],"constraints":[6],"is":[7],"a":[8,41,65,184],"critical":[9],"framework":[10],"for":[11,56,187,195],"sequential":[12],"decision-making":[13],"in":[14,46,191],"dynamic":[15],"networked":[16],"systems,":[17],"where":[18],"learners":[19],"must":[20],"minimize":[21],"cumulative":[22,165],"loss":[23],"while":[24,176],"satisfying":[25],"regions":[26],"of":[27,68],"feasibility":[28],"that":[29,52,104,162],"shift":[30],"across":[31],"rounds.":[32],"Existing":[33],"theoretical":[34],"analyses":[35],"typically":[36],"treat":[37],"constraint":[38,69,112,130,166],"variation":[39,70],"as":[40,88,183],"monolithic":[42],"adversarial":[43,108],"process,":[44],"resulting":[45],"joint":[47,102],"regret":[48],"and":[49,76,95,137,148,156],"violation":[50,167],"bounds":[51,103],"are":[53],"overly":[54],"conservative":[55],"real-world":[57,149],"network":[58,85,197],"dynamics.":[59],"In":[60],"this":[61],"paper,":[62],"we":[63,120],"introduce":[64],"structured":[66],"characterization":[67],"-":[71,79,151,160],"smooth":[72],"drift,":[73],"periodic":[74],"cycles,":[75],"sparse":[77],"switching":[78],"mapping":[80],"these":[81,118],"classes":[82],"to":[83,132,170,173],"common":[84],"phenomena":[86],"such":[87],"slow":[89],"channel":[90],"fading,":[91],"diurnal":[92],"traffic":[93],"patterns,":[94],"discrete":[96],"maintenance":[97],"windows.":[98],"We":[99],"derive":[100],"structure-dependent":[101],"strictly":[105],"improve":[106],"upon":[107],"rates":[109],"when":[110],"the":[111,122],"process":[113],"exhibits":[114],"regularity.":[115],"To":[116],"realize":[117],"gains,":[119],"propose":[121],"Structure-Adaptive":[123],"Primal-Dual":[124],"(SA-PD)":[125],"algorithm,":[126],"which":[127],"utilizes":[128],"observable":[129],"signals":[131],"detect":[133],"environmental":[134],"structure":[135],"online":[136,153,193],"adapt":[138],"dual":[139],"update":[140],"strategies":[141],"accordingly.":[142],"Extensive":[143],"experiments":[144],"on":[145],"synthetic":[146],"benchmarks":[147],"datasets":[150],"including":[152],"electricity":[154],"scheduling":[155],"transformer":[157],"load":[158],"management":[159],"demonstrate":[161],"SA-PD":[163],"reduces":[164],"by":[168],"up":[169],"53%":[171],"relative":[172],"structure-agnostic":[174],"baselines":[175],"maintaining":[177],"competitive":[178],"utility.":[179],"This":[180],"work":[181],"serves":[182],"comprehensive":[185],"guide":[186],"exploiting":[188],"temporal":[189],"regularity":[190],"constrained":[192],"learning":[194],"robust":[196],"engineering.":[198]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-18T00:00:00"}