{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:33:55Z","timestamp":1725680035584},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.23919\/isita.2018.8664212","type":"proceedings-article","created":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T19:49:11Z","timestamp":1552333751000},"page":"36-39","source":"Crossref","is-referenced-by-count":2,"title":["Introduction to Bandit Convex Optimization Algorithms"],"prefix":"10.23919","author":[{"given":"Wataru","family":"Kumagai","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref4","first-page":"3","article-title":"On the complexity of bandit and derivative-free stochastic convex optimization","author":"shamir","year":"2013","journal-title":"COLT"},{"key":"ref3","first-page":"784","article-title":"Bandit convex optimization: Towards tight bounds","author":"hazan","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref10","first-page":"1","article-title":"Parallel distributed block coordinate descent methods based on pairwise comparison oracle","author":"matsui","year":"2016","journal-title":"Journal of Global Optimization"},{"key":"ref6","first-page":"2672","article-title":"Query complexity of derivative-free optimization","author":"jamieson","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553527"},{"key":"ref8","first-page":"525","article-title":"Follow-the-regularized-leader and mirror descent: Equivalence theorems and l1 regularization","author":"mcmahan","year":"2011","journal-title":"Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics"},{"key":"ref7","article-title":"Reducing dueling bandits to cardinal bandits","author":"ailon","year":"2014","journal-title":"arXiv preprint arXiv 1405 3396"},{"key":"ref2","article-title":"The entropic barrier: a simple and optimal universal self-concordant barrier","author":"bubeck","year":"2014","journal-title":"arXiv preprint arXiv 1412 1587"},{"key":"ref9","first-page":"1488","article-title":"Regret analysis for continuous dueling bandit","author":"kumagai","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref1","first-page":"385","article-title":"Online convex optimization in the bandit setting: gradient descent without a gradient","author":"flaxman","year":"2005","journal-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms"}],"event":{"name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","start":{"date-parts":[[2018,10,28]]},"location":"Singapore","end":{"date-parts":[[2018,10,31]]}},"container-title":["2018 International Symposium on Information Theory and Its Applications (ISITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8660385\/8664205\/08664212.pdf?arnumber=8664212","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T01:19:18Z","timestamp":1552353558000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8664212\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":10,"URL":"https:\/\/doi.org\/10.23919\/isita.2018.8664212","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}