{"id":"https://openalex.org/W7162024807","doi":"https://doi.org/10.48550/arxiv.2605.21107","title":"Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction","display_name":"Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction","publication_year":2026,"publication_date":"2026-05-20","ids":{"openalex":"https://openalex.org/W7162024807","doi":"https://doi.org/10.48550/arxiv.2605.21107"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.21107","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.21107","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.21107","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124842669","display_name":"Dhruv Sarkar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sarkar, Dhruv","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136632946","display_name":"Abhishek Sinha","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sinha, Abhishek","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"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.9702000021934509,"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.9702000021934509,"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.013500000350177288,"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.0017999999690800905,"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.8057000041007996},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.6438000202178955},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5947999954223633},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5460000038146973},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.513700008392334},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.48890000581741333},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.48249998688697815},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.462799996137619},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.45080000162124634}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8057000041007996},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6913999915122986},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.6438000202178955},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5947999954223633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5461000204086304},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5460000038146973},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.513700008392334},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.48890000581741333},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.48249998688697815},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.462799996137619},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.45080000162124634},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.43639999628067017},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39410001039505005},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.37929999828338623},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.35510000586509705},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.3474000096321106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34630000591278076},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3393000066280365},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.3176000118255615},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.3133000135421753},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.3057999908924103},{"id":"https://openalex.org/C66690126","wikidata":"https://www.wikidata.org/wiki/Q2914302","display_name":"Concave function","level":3,"score":0.30379998683929443},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.2978000044822693},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.2903999984264374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2596000134944916},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.21107","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.21107","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":"doi:10.48550/arxiv.2605.21107","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.21107","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"score":0.4667109251022339,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"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],"consider":[1],"Constrained":[2],"Online":[3],"Convex":[4],"Optimization":[5],"(COCO)":[6],"with":[7],"adversarially":[8],"chosen":[9],"constraints.":[10],"At":[11],"each":[12],"round,":[13],"the":[14,21,38,108,111,117,123],"learner":[15],"chooses":[16],"an":[17,104],"action":[18],"before":[19],"observing":[20],"loss":[22],"and":[23,61,76,96],"constraint":[24,48],"function":[25],"for":[26,70,100,137],"that":[27,90],"round.":[28],"The":[29,66,127],"goal":[30],"is":[31,73,132],"to":[32,119,129],"achieve":[33,57],"small":[34],"static":[35],"regret":[36,60,75,95],"against":[37],"best":[39],"point":[40],"satisfying":[41],"all":[42],"constraints":[43],"while":[44,121],"also":[45],"controlling":[46],"cumulative":[47],"violation":[49],"($\\mathsf{CCV}$).":[50],"For":[51,110],"strongly":[52],"convex":[53,71,112],"losses,":[54,102,113],"state-of-the-art":[55],"algorithms":[56],"$O(\\log":[58,93,97],"T)$":[59,79,94,98],"$O(\\sqrt{T":[62],"\\log":[63,78],"T})$":[64],"$\\mathsf{CCV}.$":[65],"corresponding":[67],"best-known":[68],"bounds":[69],"losses":[72],"$O(\\sqrt{T})$":[74,120,125],"$O(\\sqrt{T}":[77],"$\\mathsf{CCV}$.":[80,109],"In":[81],"this":[82],"paper,":[83],"we":[84],"give":[85],"a":[86,133],"simple":[87],"projection-based":[88],"algorithm":[89,115],"simultaneously":[91],"achieves":[92],"$\\mathsf{CCV}$":[99,118],"strongly-convex":[101],"yielding":[103],"exponential":[105],"improvement":[106,131],"in":[107],"our":[114,130],"improves":[116],"maintaining":[122],"optimal":[124],"regret.":[126],"key":[128],"recent":[134],"geometric":[135],"result":[136],"self-contracted":[138],"curves,":[139],"which":[140],"may":[141],"be":[142],"of":[143],"independent":[144],"interest.":[145]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-22T00:00:00"}