{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T17:15:47Z","timestamp":1757610947616,"version":"3.44.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031703614"},{"type":"electronic","value":"9783031703621"}],"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-3-031-70362-1_19","type":"book-chapter","created":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T03:03:03Z","timestamp":1724900583000},"page":"319-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online $$\\textrm{L}^{\\natural }$$-Convex Minimization"],"prefix":"10.1007","author":[{"given":"Ken","family":"Yokoyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinji","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsuya","family":"Matsuoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kei","family":"Kimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Yokoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,22]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/b93837","volume-title":"Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity","author":"E Altman","year":"2003","unstructured":"Altman, E.: Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/b93837"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1287\/moor.25.2.324.12230","volume":"25","author":"E Altman","year":"2000","unstructured":"Altman, E., Gaujal, B., Hordijk, A.: Multimodularity, convexity, and optimization properties. Math. Oper. Res. 25(2), 324\u2013347 (2000)","journal-title":"Math. Oper. Res."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Bach, F.: Learning with submodular functions: a convex optimization perspective. Found. Trends\u00ae Mach. Learn. 6(2-3), 145\u2013373 (2013)","DOI":"10.1561\/2200000039"},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3453721","volume":"68","author":"S Bubeck","year":"2021","unstructured":"Bubeck, S., Eldan, R., Lee, Y.T.: Kernel-based methods for bandit convex optimization. J. ACM 68(4), 1\u201335 (2021)","journal-title":"J. ACM"},{"key":"19_CR5","unstructured":"Chen, L., Hassani, H., Karbasi, A.: Online continuous submodular maximization. In: International Conference on Artificial Intelligence and Statistics, pp. 1896\u20131905. PMLR (2018)"},{"key":"19_CR6","unstructured":"Chen, W., Hu, W., Li, F., Li, J., Liu, Y., Lu, P.: Combinatorial multi-armed bandit with general reward functions. Adv. Neural Inf. Process. Syst. 29 (2016)"},{"issue":"50","key":"19_CR7","first-page":"1","volume":"17","author":"W Chen","year":"2016","unstructured":"Chen, W., Wang, Y., Yuan, Y., Wang, Q.: Combinatorial multi-armed bandit and its extension to probabilistically triggered arms. J. Mach. Learn. Res. 17(50), 1\u201333 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.15302\/J-FEM-2017057","volume":"4","author":"X Chen","year":"2017","unstructured":"Chen, X.: $$\\rm L ^{\\natural }$$-convexity and its applications in operations. Front. Eng. Manage. 4(3), 283\u2013294 (2017)","journal-title":"Front. Eng. Manage."},{"issue":"6","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1904","DOI":"10.1111\/poms.13234","volume":"30","author":"X Chen","year":"2021","unstructured":"Chen, X., Li, M.: Discrete convex analysis and its applications in operations: a survey. Prod. Oper. Manag. 30(6), 1904\u20131926 (2021)","journal-title":"Prod. Oper. Manag."},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-319-59250-3_16","volume-title":"Integer Programming and Combinatorial Optimization","author":"D Freund","year":"2017","unstructured":"Freund, D., Henderson, S.G., Shmoys, D.B.: Minimizing multimodular functions and\u00a0allocating capacity in bike-sharing systems. In: Eisenbrand, F., Koenemann, J. (eds.) IPCO 2017. LNCS, vol. 10328, pp. 186\u2013198. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_16"},{"key":"19_CR11","unstructured":"Fujishige, S.: Submodular Functions and Optimization. Elsevier, Amsterdam (2005)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/PL00011371","volume":"88","author":"S Fujishige","year":"2000","unstructured":"Fujishige, S., Murota, K.: Notes on L-\/M-convex functions and the separation theorems. Math. Program. 88, 129\u2013146 (2000)","journal-title":"Math. Program."},{"issue":"10","key":"19_CR13","first-page":"2903","volume":"13","author":"E Hazan","year":"2012","unstructured":"Hazan, E., Kale, S.: Online submodular minimization. J. Mach. Learn. Res. 13(10), 2903\u20132922 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"19_CR14","volume":"11","author":"S Ikeda","year":"2023","unstructured":"Ikeda, S., Nishimura, N., Sukegawa, N., Takano, Y.: Prescriptive price optimization using optimal regression trees. Oper. Res. Perspect. 11, 100290 (2023)","journal-title":"Oper. Res. Perspect."},{"key":"19_CR15","unstructured":"Ito, S., Fujimaki, R.: Large-scale price optimization via network flow. Adv. Neural Inf. Process. Syst. 29 (2016)"},{"issue":"11","key":"19_CR16","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1080\/07408170304398","volume":"35","author":"G Koole","year":"2003","unstructured":"Koole, G., van der Sluis, E.: Optimal shift scheduling with a global service level constraint. IIE Trans. 35(11), 1049\u20131055 (2003)","journal-title":"IIE Trans."},{"key":"19_CR17","unstructured":"Li, S.: The art of clustering bandits. Ph.D. thesis, Universit\u00e0 degli Studi dell\u2019Insubria (2016)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Mahadik, K., Wu, Q., Li, S., Sabne, A.: Fast distributed bandits for online recommendation systems. In: Proceedings of the 34th ACM International Conference on Supercomputing, pp. 1\u201313 (2020)","DOI":"10.1145\/3392717.3392748"},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0121018","volume":"21","author":"BL Miller","year":"1971","unstructured":"Miller, B.L.: On minimizing nonseparable functions defined on the integers with an inventory application. SIAM J. Appl. Math. 21(1), 166\u2013185 (1971)","journal-title":"SIAM J. Appl. Math."},{"issue":"5","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1104","DOI":"10.1093\/ietfec\/e88-a.5.1104","volume":"88","author":"S Moriguchi","year":"2005","unstructured":"Moriguchi, S., Murota, K.: Discrete Hessian matrix for L-convex functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88(5), 1104\u20131108 (2005)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF02680565","volume":"83","author":"K Murota","year":"1998","unstructured":"Murota, K.: Discrete convex analysis. Math. Program. 83, 313\u2013371 (1998)","journal-title":"Math. Program."},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Murota, K.: Discrete Convex Analysis. SIAM (2003)","DOI":"10.1137\/1.9780898718508"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Murota, K.: Discrete convex analysis: a tool for economics and game theory. arXiv preprint arXiv:2212.03598 (2022). (Preliminary version: Murota, K.: Discrete convex analysis: A tool for economics and game theory. The Journal of Mechanism and Institution Design 1(1), 151\u2013273 (2016))","DOI":"10.22574\/jmid.2016.12.005"},{"key":"19_CR24","unstructured":"Oki, T., Sakaue, S.: No-regret $${\\rm M}^{\\natural }$$-concave function maximization: stochastic bandit algorithms and NP-hardness of adversarial full-information setting. arXiv preprint arXiv:2405.12439 (2024)"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Qin, L., Chen, S., Zhu, X.: Contextual combinatorial bandit and its application on diversified online recommendation. In: Proceedings of the 2014 SIAM International Conference on Data Mining, pp. 461\u2013469. SIAM (2014)","DOI":"10.1137\/1.9781611973440.53"},{"key":"19_CR26","unstructured":"Sakaue, S., Oki, T.: Rethinking warm-starts with predictions: learning predictions close to sets of optimal solutions for faster L-\/L$$^{\\natural }$$-convex function minimization. In: International Conference on Machine Learning, pp. 29760\u201329776. PMLR (2023)"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S.: Online learning and online convex optimization. Found. Trends\u00ae Mach. Learn. 4(2), 107\u2013194 (2012)","DOI":"10.1561\/2200000018"},{"issue":"3","key":"19_CR28","first-page":"216","volume":"60","author":"A Shioura","year":"2017","unstructured":"Shioura, A.: Algorithms for L-convex function minimization: connection between discrete convex analysis and other research fields. J. Oper. Res. Soc. Jpn. 60(3), 216\u2013243 (2017)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"19_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/b139000","volume-title":"The Theory and Practice of Revenue Management","author":"KT Talluri","year":"2006","unstructured":"Talluri, K.T., Van Ryzin, G.J.: The Theory and Practice of Revenue Management, vol. 68. Springer, New York (2006). https:\/\/doi.org\/10.1007\/b139000"},{"key":"19_CR30","unstructured":"Tsuchiya, T., Ito, S., Honda, J.: Further adaptive best-of-both-worlds algorithm for combinatorial semi-bandits. In: Proceedings of The 26th International Conference on Artificial Intelligence and Statistics, pp. 8117\u20138144. PMLR (2023)"},{"key":"19_CR31","first-page":"13004","volume":"34","author":"H Zhang","year":"2021","unstructured":"Zhang, H., Zheng, Z., Lavaei, J.: Stochastic $$\\rm L ^{\\natural }$$-convex function minimization. Adv. Neural. Inf. Process. Syst. 34, 13004\u201313018 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases. Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70362-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T17:49:23Z","timestamp":1756921763000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70362-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031703614","9783031703621"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70362-1_19","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":"22 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vilnius","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lithuania","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":"8 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 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":"ecml2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}