{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:08:51Z","timestamp":1742958531808,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":36,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819722617"},{"type":"electronic","value":"9789819722594"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-2259-4_9","type":"book-chapter","created":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T09:02:31Z","timestamp":1713949351000},"page":"118-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Projection-Free Bandit Convex Optimization over\u00a0Strongly Convex Sets"],"prefix":"10.1007","author":[{"given":"Chenxu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yibo","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Yuanyu","family":"Wan","sequence":"additional","affiliation":[]},{"given":"Mingli","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,25]]},"reference":[{"key":"9_CR1","unstructured":"Abernethy, J., Hazan, E., Rakhlin, A.: Competing in the dark: an efficient algorithm for bandit linear optimization. In: Proceedings of the 21st Conference on Learning Theory, pp. 263\u2013274 (2008)"},{"key":"9_CR2","unstructured":"Agarwal, A., Dekel, O., Xiao, L.: Optimal algorithms for online convex optimization with multi-point bandit feedback. In: Proceedings of the 23rd Conference on Learning Theory, pp. 28\u201340 (2010)"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jcss.2007.04.016","volume":"74","author":"B Awerbuch","year":"2008","unstructured":"Awerbuch, B., Kleinberg, R.: Online linear optimization and adaptive routing. J. Comput. Syst. Sci. 74(1), 97\u2013114 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR4","unstructured":"Bubeck, S., Cesa-Bianchi, N., Kakade, S.M.: Towards minimax policies for online linear optimization with bandit feedback. In: Proceedings of the 25th Conference on Learning Theory, pp. 41.1\u201341.14 (2012)"},{"key":"9_CR5","unstructured":"Bubeck, S., Dekel, O., Koren, T., Peres, Y.: Bandit convex optimization: $$\\sqrt{t}$$ regret in one dimension. In: Proceedings of the 28th Conference on Learning Theory, pp. 266\u2013278 (2015)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bubeck, S., Eldan, R., Lee, Y.T.: Kernel-based methods for bandit convex optimization. In: Proceedings of the 49th Annual ACM Symposium on Theory of Computing, pp. 72\u201385 (2019)","DOI":"10.1145\/3055399.3055403"},{"issue":"27","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: Libsvm: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2(27), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"9_CR8","unstructured":"Chen, L., Harshaw, C., Hassani, H., Karbasi, A.: Projection-free online optimization with stochastic gradient: from convexity to submodularity. In: Proceedings of the 35th International Conference on Machine Learning, pp. 814\u2013823 (2018)"},{"key":"9_CR9","unstructured":"Chen, L., Zhang, M., Karbasi, A.: Projection-free bandit convex optimization. In: Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, pp. 2047\u20132056 (2019)"},{"key":"9_CR10","unstructured":"Dekel, O., Eldan, R., Koren, T.: Bandit smooth convex optimization: Improving the bias-variance tradeoff. In: Advances in Neural Information Processing Systems 28, pp. 2926\u20132934 (2015)"},{"key":"9_CR11","unstructured":"Flaxman, A.D., Kalai, A.T., McMahan, H.B.: Online convex optimization in the bandit setting: gradient descent without a gradient. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 385\u2013394 (2005)"},{"issue":"1\u20132","key":"9_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logistics Quart. 3(1\u20132), 95\u2013110 (1956)","journal-title":"Naval Res. Logistics Quart."},{"key":"9_CR13","unstructured":"Garber, D., Hazan, E.: Faster rates for the frank-wolfe method over strongly-convex sets. In: Proceedings of the 32nd International Conference on Machine Learning, pp. 541\u2013549 (2015)"},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/140985366","volume":"26","author":"D Garber","year":"2016","unstructured":"Garber, D., Hazan, E.: A linearly convergent conditional gradient algorithm with applications to online and stochastic optimization. SIAM J. Optim. 26(3), 1493\u20131528 (2016)","journal-title":"SIAM J. Optim."},{"key":"9_CR15","unstructured":"Garber, D., Kretzu, B.: Improved regret bounds for projection-free bandit convex optimization. In: Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, pp. 2196\u20132206 (2020)"},{"key":"9_CR16","unstructured":"Garber, D., Kretzu, B.: New projection-free algorithms for online convex optimization with adaptive regret guarantees. In: Proceedings of the 35th Conference on Learning Theory, pp. 2326\u20132359 (2022)"},{"key":"9_CR17","unstructured":"Garber, D., Kretzu, B.: Projection-free online exp-concave optimization. In: Proceedings of the 36th Conference on Learning Theory (2023)"},{"issue":"3\u20134","key":"9_CR18","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1561\/2400000013","volume":"2","author":"E Hazan","year":"2016","unstructured":"Hazan, E.: Introduction to online convex optimization. Found. Trends Optim. 2(3\u20134), 157\u2013325 (2016)","journal-title":"Found. Trends Optim."},{"key":"9_CR19","unstructured":"Hazan, E., Kale, S.: Projection-free online learning. In: Proceedings of the 29th International Conference on Machine Learning, pp. 1843\u20131850 (2012)"},{"key":"9_CR20","unstructured":"Hazan, E., Levy, K.Y.: Bandit convex optimization: towards tight bounds. In: Advances in Neural Information Processing Systems 27, pp. 784\u2013792 (2014)"},{"key":"9_CR21","unstructured":"Hazan, E., Minasyan, E.: Faster projection-free online learning. In: Proceedings of the 33rd Conference on Learning Theory, pp. 1877\u20131893 (2020)"},{"key":"9_CR22","unstructured":"Ito, S.: An optimal algorithm for bandit convex optimization with strongly-convex and smooth loss. In: Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, pp. 2229\u20132239 (2020)"},{"key":"9_CR23","unstructured":"Jaggi, M.: Revisiting Frank-Wolfe: projection-free sparse convex optimization. In: Proceedings of the 30th International Conference on Machine Learning, pp. 427\u2013435 (2013)"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1109\/TSP.2021.3051871","volume":"69","author":"DS Kalhan","year":"2021","unstructured":"Kalhan, D.S., et al.: Dynamic online learning via frank-wolfe algorithm. IEEE Trans. Signal Process. 69, 932\u2013947 (2021)","journal-title":"IEEE Trans. Signal Process."},{"key":"9_CR25","unstructured":"Kretzu, B., Garber, D.: Revisiting projection-free online learning: the strongly convex case. In: Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, pp. 3592\u20133600 (2021)"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"McMahan, H.B., et al.: Ad click prediction: a view from the trenches. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1222\u20131230 (2013)","DOI":"10.1145\/2487575.2488200"},{"key":"9_CR27","unstructured":"Saha, A., Tewari, A.: Improved regret guarantees for online smooth convex optimization with bandit feedback. In: Proceedings of the 14th International Conference on Artificial Intelligence and Statistics, pp. 636\u2013642 (2011)"},{"issue":"2\u20133","key":"9_CR28","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10994-007-5014-x","volume":"69","author":"S Shalev-Shwartz","year":"2007","unstructured":"Shalev-Shwartz, S., Singer, Y.: A primal-dual perspective of online learning algorithm. Mach. Learn. 69(2\u20133), 115\u2013142 (2007)","journal-title":"Mach. Learn."},{"key":"9_CR29","unstructured":"Wan, Y., Tu, W.W., Zhang, L.: Projection-free distributed online convex optimization with $$\\cal{O}(\\sqrt{T})$$ communication complexity. In: Proceedings of the 37th International Conference on Machine Learning, pp. 9818\u20139828 (2020)"},{"issue":"172","key":"9_CR30","first-page":"1","volume":"23","author":"Y Wan","year":"2022","unstructured":"Wan, Y., Wang, G., Tu, W.W., Zhang, L.: Projection-free distributed online learning with sublinear communication complexity. J. Mach. Learn. Res. 23(172), 1\u201353 (2022)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Wan, Y., Xue, B., Zhang, L.: Projection-free online learning in dynamic environments. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence Advances, pp. 10067\u201310075 (2021)","DOI":"10.1609\/aaai.v35i11.17208"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Wan, Y., Zhang, L.: Projection-free online learning over strongly convex set. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence Advances, pp. 10076\u201310084 (2021)","DOI":"10.1609\/aaai.v35i11.17209"},{"key":"9_CR33","unstructured":"Wan, Y., Zhang, L., Song, M.: Improved dynamic regret for online frank-wolfe. In: Proceedings of the 36th Conference on Learning Theory (2023)"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wan, Y., Zhang, S., Zhang, L.: Distributed projection-free online learning for smooth and convex losses. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence, pp. 10226\u201310234 (2023)","DOI":"10.1609\/aaai.v37i8.26218"},{"key":"9_CR35","unstructured":"Wang, Y., et al.: Non-stationary projection-free online learning with dynamic and adaptive regret guarantees. ArXiv e-prints arXiv:2305.11726 (2023)"},{"key":"9_CR36","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the 20th International Conference on Machine Learning, pp. 928\u2013936 (2003)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2259-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T23:03:26Z","timestamp":1731798206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2259-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819722617","9789819722594"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2259-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}