{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T02:06:04Z","timestamp":1776909964099,"version":"3.51.2"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031703645","type":"print"},{"value":"9783031703652","type":"electronic"}],"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-70365-2_26","type":"book-chapter","created":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T04:01:55Z","timestamp":1725163315000},"page":"441-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Linear Contextual Bandits with\u00a0Hybrid Payoff: Revisited"],"prefix":"10.1007","author":[{"given":"Nirjhar","family":"Das","sequence":"first","affiliation":[]},{"given":"Gaurav","family":"Sinha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,22]]},"reference":[{"key":"26_CR1","unstructured":"Abbasi-Yadkori, Y., P\u00e1l, D., Szepesv\u00e1ri, C.: Improved algorithms for linear stochastic bandits. In: Advances in Neural Information Processing Systems, vol. 24 (2011)"},{"key":"26_CR2","unstructured":"Abeille, M., Lazaric, A.: Linear thompson sampling revisited. In: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, vol.\u00a054, pp. 176\u2013184. PMLR (2017)"},{"key":"26_CR3","unstructured":"Agrawal, S., Goyal, N.: Thompson sampling for contextual bandits with linear payoffs. In: Proceedings of the 30th International Conference on International Conference on Machine Learning - Volume 28, ICML 2013, pp. III-1220\u2013III-1228. JMLR.org (2013)"},{"key":"26_CR4","unstructured":"Auer, P.: Using confidence bounds for exploitation-exploration trade-offs. J. Mach. Learn. Res. 3, 397-422 (2003). ISSN 1532-4435"},{"key":"26_CR5","unstructured":"Chatterji, N., Muthukumar, V., Bartlett, P.: OSOM: a simultaneously optimal algorithm for multi-armed and linear contextual bandits. In: Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, vol. 108, pp. 1844\u20131854, PMLR (2020). https:\/\/proceedings.mlr.press\/v108\/chatterji20b.html"},{"key":"26_CR6","unstructured":"Chu, W., Li, L., Reyzin, L., Schapire, R.: Contextual bandits with linear payoff functions. In: Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, pp. 208\u2013214. JMLR Workshop and Conference Proceedings (2011)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Chu, W., et al.: A case study of behavior-driven conjoint analysis on yahoo!: front page today module. In: Knowledge Discovery and Data Mining (2009). https:\/\/api.semanticscholar.org\/CorpusID:18101293","DOI":"10.1145\/1557019.1557138"},{"key":"26_CR8","unstructured":"Dani, V., Hayes, T.P., Kakade, S.M.: Stochastic linear optimization under bandit feedback. In: Annual Conference Computational Learning Theory (2008). https:\/\/api.semanticscholar.org\/CorpusID:9134969"},{"key":"26_CR9","unstructured":"Gentile, C., Li, S., Kar, P., Karatzoglou, A., Zappella, G., Etrue, E.: On context-dependent clustering of bandits. In: International Conference on Machine Learning, pp. 1253\u20131262. PMLR (2017)"},{"key":"26_CR10","unstructured":"Ghosh, A., Sankararaman, A., Kannan, R.: Problem-complexity adaptive model selection for stochastic linear bandits. In: International Conference on Artificial Intelligence and Statistics, pp. 1396\u20131404. PMLR (2021)"},{"key":"26_CR11","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, KDD 2017, pp. 1813\u20131821. Association for Computing Machinery, New York (2017). ISBN 9781450348874. https:\/\/doi.org\/10.1145\/3097983.3098184","DOI":"10.1145\/3097983.3098184"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (2012)","DOI":"10.1017\/CBO9781139020411"},{"key":"26_CR13","unstructured":"Kim, W., Paik, M.C., Oh, M.H.: Squeeze all: novel estimator and self-normalized bound for linear contextual bandits. In: International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, vol. 206, pp. 3098\u20133124. PMLR (2023). https:\/\/proceedings.mlr.press\/v206\/kim23d.html"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1), 4\u201322 (1985). ISSN 0196-8858","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit Algorithms. Cambridge University Press, Cambridge (2020)","DOI":"10.1017\/9781108571401"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Li, L., Chu, W., Langford, J., Schapire, R.E.: A contextual-bandit approach to personalized news article recommendation. In: Proceedings of the 19th International Conference on World Wide Web, pp. 661\u2013670 (2010)","DOI":"10.1145\/1772690.1772758"},{"key":"26_CR17","unstructured":"Li, L., Lu, Y., Zhou, D.: Provably optimal algorithms for generalized linear contextual bandits. In: Proceedings of the 34th International Conference on Machine Learning - Volume 70, ICML 2017, pp. 2071\u20132080. JMLR.org (2017)"},{"key":"26_CR18","unstructured":"Li, Y., Wang, Y., Zhou, Y.: Nearly minimax-optimal regret for linearly parameterized bandits. In: Conference on Learning Theory, pp. 2173\u20132174. PMLR (2019)"},{"key":"26_CR19","unstructured":"Papini, M., Tirinzoni, A., Restelli, M., Lazaric, A., Pirotta, M.: Leveraging good representations in linear contextual bandits. In: Proceedings of the 38th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol. 139, pp. 8371\u20138380. PMLR (2021). https:\/\/proceedings.mlr.press\/v139\/papini21a.html"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Rusmevichientong, P., Tsitsiklis, J.N.: Linearly parameterized bandits. Math. Oper. Res. 35, 395\u2013411 (2008). https:\/\/api.semanticscholar.org\/CorpusID:3204347","DOI":"10.1287\/moor.1100.0446"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Stanimirovi\u0107, P.S., Katsikis, V.N., Kolundzija, D.: Inversion and pseudoinversion of block arrowhead matrices. Appl. Math. Comput. 341, 379\u2013401 (2019). https:\/\/api.semanticscholar.org\/CorpusID:52988431","DOI":"10.1016\/j.amc.2018.09.006"},{"key":"26_CR22","doi-asserted-by":"publisher","unstructured":"Thompson, W.R.: On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3-4), 285\u2013294 (1933). https:\/\/doi.org\/10.1093\/biomet\/25.3-4.285. ISSN 0006-3444","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-011-9099-z","volume":"12","author":"JA Tropp","year":"2012","unstructured":"Tropp, J.A.: User-friendly tail bounds for sums of random matrices. Found. Comput. Math. 12, 389\u2013434 (2012)","journal-title":"Found. Comput. Math."},{"key":"26_CR24","doi-asserted-by":"publisher","unstructured":"Tropp, J.A.: An introduction to matrix concentration inequalities. Found. Trends Mach. Learn. 8(1-2), 1\u2013230 (2015). https:\/\/doi.org\/10.1561\/2200000048. ISSN 1935-8237","DOI":"10.1561\/2200000048"},{"key":"26_CR25","unstructured":"Yahoo! Webscope: Yahoo! Front Page Today Module User Click Log Dataset, version 1.0 (2010). http:\/\/research.yahoo.com\/Academic_Relationsa. Accessed 22 Jan 2024"}],"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-70365-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T16:36:47Z","timestamp":1732725407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70365-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031703645","9783031703652"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70365-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}