{"id":"https://openalex.org/W4210710433","doi":"https://doi.org/10.1109/cdc45484.2021.9683142","title":"Structured Projection-free Online Convex Optimization with Multi-point Bandit Feedback","display_name":"Structured Projection-free Online Convex Optimization with Multi-point Bandit Feedback","publication_year":2021,"publication_date":"2021-12-14","ids":{"openalex":"https://openalex.org/W4210710433","doi":"https://doi.org/10.1109/cdc45484.2021.9683142"},"language":"en","primary_location":{"id":"doi:10.1109/cdc45484.2021.9683142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc45484.2021.9683142","pdf_url":null,"source":{"id":"https://openalex.org/S4363607724","display_name":"2021 60th IEEE Conference on Decision and Control (CDC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 60th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5102879163","display_name":"Yuhao Ding","orcid":"https://orcid.org/0000-0002-1521-7566"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuhao Ding","raw_affiliation_strings":["University of California,Department of Industrial Engineering and Operations Research,Berkeley,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Department of Industrial Engineering and Operations Research,Berkeley,USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042580848","display_name":"Javad Lavaei","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Javad Lavaei","raw_affiliation_strings":["University of California,Department of Industrial Engineering and Operations Research,Berkeley,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Department of Industrial Engineering and Operations Research,Berkeley,USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"954","last_page":"961"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983999729156494,"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.9980000257492065,"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.7871201038360596},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6520592570304871},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.6159982681274414},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6133184432983398},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.602651834487915},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.524814248085022},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5168188214302063},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5123211145401001},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49106860160827637},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4632042646408081},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4452704191207886},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44340717792510986},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4116027355194092},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23486050963401794},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14320874214172363}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7871201038360596},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6520592570304871},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.6159982681274414},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6133184432983398},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.602651834487915},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.524814248085022},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5168188214302063},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5123211145401001},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49106860160827637},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4632042646408081},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4452704191207886},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44340717792510986},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4116027355194092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23486050963401794},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14320874214172363},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc45484.2021.9683142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc45484.2021.9683142","pdf_url":null,"source":{"id":"https://openalex.org/S4363607724","display_name":"2021 60th IEEE Conference on Decision and Control (CDC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 60th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W905619","https://openalex.org/W153281708","https://openalex.org/W1574851760","https://openalex.org/W1773534465","https://openalex.org/W1877183374","https://openalex.org/W2004001705","https://openalex.org/W2013243898","https://openalex.org/W2054141820","https://openalex.org/W2109521352","https://openalex.org/W2109904757","https://openalex.org/W2129160848","https://openalex.org/W2136885855","https://openalex.org/W2148825261","https://openalex.org/W2149479912","https://openalex.org/W2151056989","https://openalex.org/W2165395308","https://openalex.org/W2169401877","https://openalex.org/W2171830216","https://openalex.org/W2226582656","https://openalex.org/W2284345772","https://openalex.org/W2567882221","https://openalex.org/W2949177896","https://openalex.org/W2949612112","https://openalex.org/W2950929549","https://openalex.org/W2963308146","https://openalex.org/W2963470657","https://openalex.org/W2964204731","https://openalex.org/W2979645311","https://openalex.org/W3093312446","https://openalex.org/W3093422766","https://openalex.org/W4205841652","https://openalex.org/W4210710433","https://openalex.org/W4287898889","https://openalex.org/W4292022450","https://openalex.org/W4300377403","https://openalex.org/W6600043445","https://openalex.org/W6606291809","https://openalex.org/W6634474516","https://openalex.org/W6638081211","https://openalex.org/W6638826736","https://openalex.org/W6651597697","https://openalex.org/W6676274004","https://openalex.org/W6681723013","https://openalex.org/W6682008797","https://openalex.org/W6683189548","https://openalex.org/W6684295950","https://openalex.org/W6684897661","https://openalex.org/W6689364223","https://openalex.org/W6695508789","https://openalex.org/W6697986547","https://openalex.org/W6751866512","https://openalex.org/W6769245630","https://openalex.org/W6773680879","https://openalex.org/W6783925558","https://openalex.org/W6784058521"],"related_works":["https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W2187449906","https://openalex.org/W4285101096","https://openalex.org/W4320477335","https://openalex.org/W2518949622","https://openalex.org/W4382725876","https://openalex.org/W2084892497","https://openalex.org/W2115614142","https://openalex.org/W2275184629"],"abstract_inverted_index":{"We":[0],"consider":[1],"structured":[2,93],"online":[3,161],"convex":[4,46],"optimization":[5],"(OCO)":[6],"with":[7],"bandit":[8],"feedback,":[9],"where":[10,72],"either":[11],"the":[12,18,28,63,69,73,76,97,125,131,143,147,151,156,160,169],"loss":[13],"function":[14,101],"is":[15,21,56],"smooth":[16],"or":[17],"constraint":[19],"set":[20],"strongly":[22],"convex.":[23],"Projection-free":[24],"methods":[25],"are":[26,78],"among":[27],"most":[29],"popular":[30],"and":[31,119,177],"computationally":[32],"efficient":[33,91],"algorithms":[34,88,118],"for":[35,52,68,92,150],"solving":[36],"this":[37,111],"problem,":[38],"mainly":[39],"due":[40],"to":[41,44,155],"their":[42,173],"ability":[43],"handle":[45],"constraints":[47],"appearing":[48],"in":[49,59,96],"machine":[50],"learning":[51],"which":[53],"computing":[54],"projections":[55],"often":[57],"impractical":[58],"high-dimensional":[60],"settings.":[61],"Despite":[62],"improved":[64,127],"regret":[65,128],"bound":[66],"results":[67],"full-information":[70,132],"setting":[71],"gradients":[74],"of":[75,146,153,168],"functions":[77],"readily":[79],"available,":[80],"it":[81],"remains":[82],"unclear":[83],"whether":[84],"simple":[85,116],"projection-free":[86,117],"zero-order":[87],"become":[89],"more":[90],"OCO":[94],"problems":[95],"case":[98,133],"when":[99],"multiple":[100],"values":[102],"can":[103],"be":[104],"sampled":[105],"at":[106],"each":[107],"time":[108],"instance.":[109],"In":[110],"paper,":[112],"we":[113],"develop":[114],"some":[115],"prove":[120],"that":[121,141],"they":[122,180],"indeed":[123],"achieve":[124],"same":[126],"bounds":[129],"as":[130,179],"under":[134],"various":[135],"additional":[136],"problem":[137,148],"structures.":[138],"This":[139],"implies":[140],"leveraging":[142],"structural":[144],"properties":[145],"compensates":[149],"lack":[152],"access":[154],"gradients.":[157],"Experiments":[158],"on":[159],"matrix":[162],"completion":[163],"reveal":[164],"several":[165],"attractive":[166],"advantages":[167],"proposed":[170],"algorithms,":[171],"including":[172],"simplicity,":[174],"easy":[175],"implementation,":[176],"effectiveness,":[178],"outperform":[181],"other":[182],"competing":[183],"algorithms.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}