{"id":"https://openalex.org/W2911036793","doi":"https://doi.org/10.1145/3305218.3305234","title":"Smoothed Online Convex Optimization via Online Balanced Descent","display_name":"Smoothed Online Convex Optimization via Online Balanced Descent","publication_year":2019,"publication_date":"2019-01-17","ids":{"openalex":"https://openalex.org/W2911036793","doi":"https://doi.org/10.1145/3305218.3305234","mag":"2911036793"},"language":"en","primary_location":{"id":"doi:10.1145/3305218.3305234","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3305218.3305234","pdf_url":null,"source":{"id":"https://openalex.org/S4210187660","display_name":"ACM SIGMETRICS Performance Evaluation Review","issn_l":"0163-5999","issn":["0163-5999","1557-9484"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGMETRICS Performance Evaluation Review","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033873472","display_name":"Gautam Goel","orcid":"https://orcid.org/0000-0002-7054-7218"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gautam Goel","raw_affiliation_strings":[""],"affiliations":[{"raw_affiliation_string":"","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033873472"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01323607,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"46","issue":"2","first_page":"42","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998000264167786,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.995199978351593,"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":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.8162471055984497},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.7689403295516968},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7248031497001648},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6606425046920776},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6089626550674438},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5651318430900574},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5584283471107483},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.5507878661155701},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.550056517124176},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5448082685470581},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4804106056690216},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.46661701798439026},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41919001936912537},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.4131568670272827},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3878350257873535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35565993189811707},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12464094161987305},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08556956052780151}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8162471055984497},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7689403295516968},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7248031497001648},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6606425046920776},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6089626550674438},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5651318430900574},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5584283471107483},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.5507878661155701},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.550056517124176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5448082685470581},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4804106056690216},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.46661701798439026},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41919001936912537},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.4131568670272827},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3878350257873535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35565993189811707},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12464094161987305},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08556956052780151},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3305218.3305234","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3305218.3305234","pdf_url":null,"source":{"id":"https://openalex.org/S4210187660","display_name":"ACM SIGMETRICS Performance Evaluation Review","issn_l":"0163-5999","issn":["0163-5999","1557-9484"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGMETRICS Performance Evaluation Review","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W80618698","https://openalex.org/W1552828154","https://openalex.org/W1966160207","https://openalex.org/W1969353386","https://openalex.org/W2008193080","https://openalex.org/W2019492625","https://openalex.org/W2020196954","https://openalex.org/W2023954497","https://openalex.org/W2046227974","https://openalex.org/W2114538202","https://openalex.org/W2119840952","https://openalex.org/W2120067677","https://openalex.org/W2128085284","https://openalex.org/W2132038503","https://openalex.org/W2135798231","https://openalex.org/W2143316703","https://openalex.org/W2261313794","https://openalex.org/W2292935145","https://openalex.org/W2345314460","https://openalex.org/W2415016509","https://openalex.org/W2612690371","https://openalex.org/W2783741611","https://openalex.org/W2784425826","https://openalex.org/W2795236957","https://openalex.org/W2887376719","https://openalex.org/W2950696909","https://openalex.org/W2951159619","https://openalex.org/W4301005547"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"We":[0,56,98,155],"study":[1],"smoothed":[2],"online":[3,9,35],"convex":[4,10],"optimization,":[5],"a":[6,16,25,58,78,136],"version":[7],"of":[8,33,42,83,102,112,152,163],"optimization":[11],"where":[12,37,147],"the":[13,30,40,43,74,84,92,100,103,131,150,153,160,166,171],"learner":[14],"incurs":[15],"penalty":[17],"for":[18,62,121,143],"changing":[19],"her":[20],"actions":[21],"between":[22],"rounds.":[23],"Given":[24],"\u03a9(pd)":[26],"lower":[27],"bound":[28,52],"on":[29,159],"competitive":[31,123,138],"ratio":[32,124],"any":[34],"algorithm,":[36],"d":[38],"is":[39,130,168],"dimension":[41],"action":[44],"space,":[45],"we":[46],"ask":[47],"under":[48],"what":[49],"conditions":[50],"this":[51,63],"can":[53,115],"be":[54],"beaten.":[55],"introduce":[57],"novel":[59],"algorithmic":[60],"framework":[61,105],"problem,":[64],"Online":[65],"Balanced":[66],"Descent":[67],"(OBD),":[68],"which":[69],"works":[70],"by":[71,106],"iteratively":[72],"projecting":[73],"previous":[75],"point":[76],"onto":[77],"carefully":[79],"chosen":[80],"level":[81],"set":[82],"current":[85],"cost":[86],"function":[87],"so":[88],"as":[89],"to":[90,134],"balance":[91,167],"switching":[93],"costs":[94],"and":[95,125,177],"hitting":[96],"costs.":[97,154],"demonstrate":[99],"generality":[101],"OBD":[104,114,129,164,180],"showing":[107],"how,":[108],"with":[109],"different":[110],"choices":[111],"\"balance,\"":[113],"improve":[116],"upon":[117],"state-of-theart":[118],"performance":[119],"guarantees":[120],"both":[122],"regret;":[126],"in":[127,170],"particular,":[128],"first":[132],"algorithm":[133],"achieve":[135],"dimension-free":[137,176],"ratio,":[139],"3":[140],"+":[141],"O(1/\u03b1),":[142],"locally":[144],"polyhedral":[145],"costs,":[146],"-":[148],"measures":[149],"\"steepness\"":[151],"also":[156],"prove":[157],"bounds":[158],"dynamic":[161],"regret":[162],"when":[165],"performed":[169],"dual":[172],"space":[173],"that":[174,179],"are":[175],"imply":[178],"has":[181],"sublinear":[182],"static":[183],"regret.":[184]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}