{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T03:08:30Z","timestamp":1730344110524,"version":"3.28.0"},"reference-count":44,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.23919\/isita.2018.8664224","type":"proceedings-article","created":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T23:49:11Z","timestamp":1552348151000},"page":"40-44","source":"Crossref","is-referenced-by-count":0,"title":["Combinatorial Online Prediction"],"prefix":"10.23919","author":[{"given":"Kohei","family":"Hatano","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"773","article-title":"Path kernels and multiplicative updates","volume":"4","author":"takimoto","year":"2003","journal-title":"Journal of Machine Learning Research"},{"key":"ref38","first-page":"260","article-title":"Online Prediction under Submodular Constraints","author":"suehiro","year":"2012","journal-title":"Proceedings of 23th Annual Conference on Algorithmic Learning Theory (ALT 2012) volume 7568 of LNCS"},{"key":"ref33","first-page":"1","article-title":"Importance Weighting Without Importance Weights: An Efficient Algorithm for Combinatorial Semi-Bandits","volume":"17","author":"neu","year":"2016","journal-title":"Journal of Machine Learning Research"},{"key":"ref32","first-page":"1360","article-title":"First-order regret bounds for combinatorial semi-bandits","author":"neu","year":"2015","journal-title":"Proceedings of the 28th Conference on Learning Theory (COLT2015) volume 40 of PMLR"},{"journal-title":"General Algebraic Frameworks and Algorithms for Shortest Distance Problems","year":"1998","author":"mohri","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/157485.164890"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref36","first-page":"585","article-title":"Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams","author":"sakaue","year":"2018","journal-title":"Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics (AISTATS 2018) volume 84 of PMLR"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0917"},{"journal-title":"Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice","year":"2015","author":"orabona","key":"ref34"},{"key":"ref10","first-page":"345","article-title":"The Price of Bandit Information for Online Optimization","author":"dani","year":"2008","journal-title":"Advances in Neural Information Processing Systems 20 (NIPS2008)"},{"key":"ref40","first-page":"375","article-title":"Algorithms for Adversarial Bandit Problems with Multiple Plays","author":"uchiya","year":"2010","journal-title":"Proceedings of the 21st International Conference on Algorithmic Learning Theory (ALT2010) volume LNAI 6331"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2428253"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"ref13","first-page":"345","article-title":"Online Linear Optimization for Job Scheduling under Precedence Concstraints","author":"fujita","year":"2015","journal-title":"Proceedings of 26th International Conference on Algorithmic Learning Theory(ALT 2015) volume 6331 of LNCS"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40935-6_6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-75172-6_17"},{"key":"ref16","article-title":"Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem","author":"fujita","year":"2018","journal-title":"IEICE Transactions on Information and Systems"},{"key":"ref17","first-page":"627","article-title":"Efficient Online Linear Optimization with Approximation Algorithms","author":"garber","year":"2017","journal-title":"Advances in Neural Information Processing Systems 30 (NIPS2017)"},{"key":"ref18","first-page":"2369","article-title":"The On-Line Shortest Path Problem Under Partial Monitoring","volume":"8","author":"gy\u00f6rgy","year":"2007","journal-title":"Journal of Machine Learning Research"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"ref28","first-page":"109","article-title":"Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary","author":"mcmahan","year":"2004","journal-title":"Learning Theory volume 3120 of LNCS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675141"},{"key":"ref27","first-page":"2168","article-title":"Beyond the Birkhoff Polytope: Convex Relaxations for Vector Permutation Problems","author":"lim","year":"2014","journal-title":"Adv Neural Inf Process Syst 27 (NIPS 2014)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.07.033"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.1993.289589"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007367"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.01.001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref2","first-page":"29","article-title":"Improved bounds for online learning over the permutahedron and other ranking polytopes","author":"ailon","year":"2014","journal-title":"Proc 17th Int Conf Artif Intell Statist"},{"key":"ref9","first-page":"2116","article-title":"Combinatorial Bandits Revisited","author":"combes","year":"2015","journal-title":"Advances in Neural Information Processing Systems 28 (NIPS 2015)"},{"key":"ref1","first-page":"807","article-title":"Online Linear Optimization via Smoothing","author":"abernethy","year":"2014","journal-title":"Proceedings of the 27th Conference on Learning Theory (COLT’14) volume 35 of JMLR W&CP"},{"key":"ref20","first-page":"1705","article-title":"Learning Permutations with Exponential Weights","volume":"10","author":"helmbold","year":"2009","journal-title":"Journal of Machine Learning Research"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/070701704"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008738"},{"key":"ref42","first-page":"2287","article-title":"Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension","volume":"9","author":"warmuth","year":"2008","journal-title":"Journal of Machine Learning Research"},{"key":"ref24","first-page":"1054","article-title":"Non-Stochastic Bandit Slate Problems","volume":"23","author":"kale","year":"2010","journal-title":"Advances in neural information processing systems"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.021"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"ref44","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proceedings of the Twentieth International Conference on Machine Learning (ICML 2003)"},{"key":"ref26","first-page":"93","article-title":"Hedging Structured Concepts","author":"koolen","year":"2010","journal-title":"Proc 23rd Annual Conf Learning Theory (COLT 2010)"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25591-5_55"},{"key":"ref25","first-page":"1155","article-title":"Second-order Quantile Methods for Experts and Combinatorial Games","author":"koolen","year":"2015","journal-title":"Proceedings of the 28th Conference on Learning Theory (COLT2015) volume 40 of PMLR"}],"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\/08664224.pdf?arnumber=8664224","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T06:23:06Z","timestamp":1643264586000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8664224\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":44,"URL":"https:\/\/doi.org\/10.23919\/isita.2018.8664224","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}