{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T12:10:03Z","timestamp":1750939803166,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819615278"},{"type":"electronic","value":"9789819615285"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-1528-5_9","type":"book-chapter","created":{"date-parts":[[2025,2,14]],"date-time":"2025-02-14T17:23:37Z","timestamp":1739553817000},"page":"118-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hybridization of\u00a0One- and\u00a0Two-Point Bandits Convex Optimization in\u00a0Non-stationary Environments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3804-1731","authenticated-orcid":false,"given":"Gailun","family":"Zeng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0994-3297","authenticated-orcid":false,"given":"Jianxiong","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,15]]},"reference":[{"key":"9_CR1","unstructured":"Agarwal, A., Dekel, O., Xiao, L.: Optimal algorithms for online convex optimization with multi-point bandit feedback. In: Colt. pp. 28\u201340. Citeseer (2010)"},{"key":"9_CR2","unstructured":"Auer, P., et al.: Achieving optimal dynamic regret for non-stationary bandits without prior information. In: Conference on Learning Theory, pp. 159\u2013163. PMLR (2019)"},{"key":"9_CR3","unstructured":"Besbes, O., Gur, Y., Zeevi, A.: Stochastic multi-armed-bandit problem with non-stationary rewards. Adv. Neural Inf. Process. Syst. 27 (2014)"},{"key":"9_CR4","unstructured":"Bubeck, S., Dekel, O., Koren, T., Peres, Y.: Bandit convex optimization: $$\\backslash $$sqrtt regret in one dimension. In: Conference on Learning Theory, pp. 266\u2013278. PMLR (2015)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bubeck, S., Lee, Y.T., Eldan, R.: Kernel-based methods for bandit convex optimization. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 72\u201385 (2017)","DOI":"10.1145\/3055399.3055403"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511546921"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1109\/JIOT.2018.2839563","volume":"6","author":"T Chen","year":"2018","unstructured":"Chen, T., Giannakis, G.B.: Bandit convex optimization for scalable and dynamic IoT management. IEEE Internet Things J. 6(1), 1276\u20131286 (2018)","journal-title":"IEEE Internet Things J."},{"key":"9_CR8","unstructured":"Dekel, O., Eldan, R., Koren, T.: Bandit smooth convex optimization: improving the bias-variance tradeoff. Adv. Neural Inf. Process. Syst. 28 (2015)"},{"key":"9_CR9","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 Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 385\u2013394 (2005)"},{"key":"9_CR10","unstructured":"Hazan, E., Levy, K.: Bandit convex optimization: towards tight bounds. Adv. Neural Inf. Process. Syst. 27 (2014)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Hazan, E., et\u00a0al.: Introduction to online convex optimization. Found. Trends\u00ae Optimiz. 2(3\u20134), 157\u2013325 (2016)","DOI":"10.1561\/2400000013"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Hill, D.N., Nassif, H., Liu, Y., Iyer, A., Vishwanathan, S.: An efficient bandit algorithm for realtime multivariate optimization. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1813\u20131821 (2017)","DOI":"10.1145\/3097983.3098184"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.4171\/msl\/17","volume":"2","author":"T Lattimore","year":"2020","unstructured":"Lattimore, T.: Improved regret for zeroth-order adversarial bandit convex optimisation. Math. Statist. Learn. 2(3), 311\u2013334 (2020)","journal-title":"Math. Statist. Learn."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Liu, W., Li, S., Zhang, S.: Contextual dependent click bandit algorithm for web recommendation. In: International Computing and Combinatorics Conference, pp. 39\u201350. Springer (2018)","DOI":"10.1007\/978-3-319-94776-1_4"},{"key":"9_CR15","unstructured":"Luo, H., Wei, C.Y., Agarwal, A., Langford, J.: Efficient contextual bandits in non-stationary worlds. In: Conference on Learning Theory, pp. 1739\u20131776. PMLR (2018)"},{"key":"9_CR16","unstructured":"Saha, A., Tewari, A.: Improved regret guarantees for online smooth convex optimization with bandit feedback. In: Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, pp. 636\u2013642. JMLR Workshop and Conference Proceedings (2011)"},{"key":"9_CR17","unstructured":"Wei, C.Y., Hong, Y.T., Lu, C.J.: Tracking the best expert in non-stationary stochastic environments. Adv. Neural Inf. Process. Syst. 29 (2016)"},{"key":"9_CR18","unstructured":"Yang, T., Zhang, L., Jin, R., Yi, J.: Tracking slowly moving clairvoyant: optimal dynamic regret of online learning with true and noisy gradient. In: International Conference on Machine Learning, pp. 449\u2013457. PMLR (2016)"},{"key":"9_CR19","unstructured":"Zhang, Y.J., Zhao, P., Zhou, Z.H.: A simple online algorithm for competing with dynamic comparators. In: Conference on Uncertainty in Artificial Intelligence, pp. 390\u2013399. PMLR (2020)"},{"key":"9_CR20","unstructured":"Zhao, P.: Online Ensemble Theories and Methods for Robust Online Learning. Ph.D. thesis, PhD thesis, Nanjing University, Nanjing (2021). Advisor: Zhi-Hua Zhou"},{"issue":"125","key":"9_CR21","first-page":"1","volume":"22","author":"P Zhao","year":"2021","unstructured":"Zhao, P., Wang, G., Zhang, L., Zhou, Z.H.: Bandit convex optimization in non-stationary environments. J. Mach. Learn. Res. 22(125), 1\u201345 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR22","first-page":"12510","volume":"33","author":"P Zhao","year":"2020","unstructured":"Zhao, P., Zhang, Y.J., Zhang, L., Zhou, Z.H.: Dynamic regret of convex and smooth functions. Adv. Neural. Inf. Process. Syst. 33, 12510\u201312520 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"9_CR23","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the 20th International Conference on Machine Learning (ICML), pp. 928\u2013936 (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1528-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T11:29:34Z","timestamp":1750937374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1528-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819615278","9789819615285"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1528-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"15 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"30 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ica3pp2024.scimeeting.cn\/en\/web\/index\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}