{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T15:55:45Z","timestamp":1783439745473,"version":"3.54.6"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T00:00:00Z","timestamp":1639440000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T00:00:00Z","timestamp":1639440000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,14]]},"DOI":"10.1109\/cdc45484.2021.9683142","type":"proceedings-article","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T20:50:18Z","timestamp":1643748618000},"page":"954-961","source":"Crossref","is-referenced-by-count":5,"title":["Structured Projection-free Online Convex Optimization with Multi-point Bandit Feedback"],"prefix":"10.1109","author":[{"given":"Yuhao","family":"Ding","sequence":"first","affiliation":[{"name":"University of California,Department of Industrial Engineering and Operations Research,Berkeley,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Javad","family":"Lavaei","sequence":"additional","affiliation":[{"name":"University of California,Department of Industrial Engineering and Operations Research,Berkeley,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","first-page":"720","article-title":"Weighted low-rank approximations","author":"srebro","year":"2003","journal-title":"ICML"},{"key":"ref32","first-page":"1703","article-title":"An optimal algorithm for bandit and zero-order convex optimization with two-point feedback","volume":"18","author":"shamir","year":"2017","journal-title":"The Journal of Machine Learning Research"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref30","first-page":"636","article-title":"Improved regret guarantees for online smooth convex optimization with bandit feedback","author":"saha","year":"2011","journal-title":"AISTATS"},{"key":"ref35","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"ICML"},{"key":"ref34","article-title":"Projection-free online learning over strongly convex sets","author":"wan","year":"2020"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref11","first-page":"541","article-title":"Faster rates for the Frank-Wolfe method over strongly-convex sets","author":"garber","year":"2015","journal-title":"ICML"},{"key":"ref12","first-page":"2196","article-title":"Improved regret bounds for projection-free bandit convex optimization","author":"garber","year":"2020","journal-title":"AISTATS"},{"key":"ref13","article-title":"Revisiting projection-free online learning: the strongly convex case","author":"garber","year":"2020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248078"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref18","first-page":"1843","article-title":"Projection-free online learning","author":"hazan","year":"2012","journal-title":"ICML"},{"key":"ref19","first-page":"784","article-title":"Bandit convex optimization: Towards tight bounds","author":"hazan","year":"2014","journal-title":"NeurIPS"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(66)90114-5"},{"key":"ref4","first-page":"266","article-title":"Bandit convex optimization: $\\sqrt T $ regret in one dimension","author":"bubeck","year":"2015","journal-title":"COLT"},{"key":"ref27","first-page":"1083","article-title":"A hybrid algorithm for convex semidefinite optimization","author":"laue","year":"2012","journal-title":"ICML"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9683142"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref5","first-page":"2047","article-title":"Projection-free bandit convex optimization","author":"chen","year":"2019","journal-title":"AISTATS"},{"key":"ref8","first-page":"327","article-title":"Lifted coordinate descent for learning with trace-norm regularization","author":"dudik","year":"2012","journal-title":"AISTATS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409256"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/110850827"},{"key":"ref9","first-page":"385","article-title":"Online convex optimization in the bandit setting: gradient descent without a gradient","author":"flaxman","year":"2005","journal-title":"SODA"},{"key":"ref1","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","author":"agarwal","year":"2010","journal-title":"COLT"},{"key":"ref20","article-title":"An optimal algorithm for bandit convex optimization","author":"hazan","year":"2016"},{"key":"ref22","first-page":"427","article-title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","author":"jaggi","year":"2013","journal-title":"ICML"},{"key":"ref21","first-page":"1877","article-title":"Faster projection-free online learning","author":"hazan","year":"2020","journal-title":"COLT"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"ref23","first-page":"471","article-title":"A simple algorithm for nuclear norm regularized problems","author":"jaggi","year":"2010","journal-title":"ICML"},{"key":"ref26","first-page":"53","article-title":"Block-coordinate Frank-Wolfe optimization for structural svms","author":"lacoste-julien","year":"2013","journal-title":"ICML"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"}],"event":{"name":"2021 60th IEEE Conference on Decision and Control (CDC)","location":"Austin, TX, USA","start":{"date-parts":[[2021,12,14]]},"end":{"date-parts":[[2021,12,17]]}},"container-title":["2021 60th IEEE Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9682670\/9682776\/09683142.pdf?arnumber=9683142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T20:25:24Z","timestamp":1654547124000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9683142\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,14]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/cdc45484.2021.9683142","relation":{},"subject":[],"published":{"date-parts":[[2021,12,14]]}}}