{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:27:05Z","timestamp":1743042425043,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031434204"},{"type":"electronic","value":"9783031434211"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43421-1_31","type":"book-chapter","created":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T20:37:24Z","timestamp":1694983044000},"page":"524-539","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Invariant Lipschitz Bandits: A Side Observation Approach"],"prefix":"10.1007","author":[{"given":"Nam Phuong","family":"Tran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Tran-Thanh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,18]]},"reference":[{"key":"31_CR1","unstructured":"Abbasi-Yadkori, Y., P\u00e1l, D., Szepesv\u00e1ri, C.: Improved algorithms for linear stochastic bandits (2011)"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"1926","DOI":"10.1137\/S0363012992237273","volume":"33","author":"R Agrawal","year":"1995","unstructured":"Agrawal, R.: The continuum-armed bandit problem. SIAM J. Control. Optim. 33, 1926\u20131951 (1995)","journal-title":"SIAM J. Control. Optim."},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"1785","DOI":"10.1137\/140989455","volume":"46","author":"N Alon","year":"2017","unstructured":"Alon, N., Cesa-Bianchi, N., Gentile, C., Mannor, S., Mansour, Y., Shamir, O.: Nonstochastic multi-armed bandits with graph-structured feedback. SIAM J. Comput. 46, 1785\u20131826 (2017)","journal-title":"SIAM J. Comput."},{"key":"31_CR4","unstructured":"Alon, N., Cesa-Bianchi, N., Gentile, C., Mansour, Y.: From bandits to experts: a tale of domination and independence (2013)"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47, 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-540-72927-3_33","volume-title":"Learning Theory","author":"P Auer","year":"2007","unstructured":"Auer, P., Ortner, R., Szepesv\u00e1ri, C.: Improved rates for the stochastic continuum-armed bandit problem. In: Bshouty, N.H., Gentile, C. (eds.) COLT 2007. LNCS (LNAI), vol. 4539, pp. 454\u2013468. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72927-3_33"},{"key":"31_CR7","unstructured":"Behboodi, A., Cesa, G., Cohen, T.: A PAC-bayesian generalization bound for equivariant networks. In: Advances in Neural Information Processing Systems (2022)"},{"key":"31_CR8","doi-asserted-by":"publisher","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of reasoning with global constraints. Constraints 12 (2007). https:\/\/doi.org\/10.1007\/s10601-006-9007-3","DOI":"10.1007\/s10601-006-9007-3"},{"key":"31_CR9","first-page":"1655","volume":"12","author":"S Bubeck","year":"2011","unstructured":"Bubeck, S., Munos, R., Stoltz, G., Szepesv\u00e1ri, C.: X-armed bandits. J. Mach. Learn. Res. 12, 1655\u20131695 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"31_CR10","unstructured":"Caron, S., Kveton, B., Lelarge, M., Bhagat, S.: Leveraging side observations in stochastic bandits (2012)"},{"key":"31_CR11","unstructured":"Cohen, A., Hazan, T., Koren, T.: Online learning with feedback graphs without the graphs (2016)"},{"key":"31_CR12","unstructured":"Elesedy, B., Zaidi, S.: Provably strict generalisation benefit for equivariant models (2021)"},{"key":"31_CR13","doi-asserted-by":"publisher","unstructured":"Herbert, R.: Some aspects of the sequential design of experiments. Bull. Am. Math. Soc. 58 (1952). https:\/\/doi.org\/10.1090\/S0002-9904-1952-09620-8","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"31_CR14","unstructured":"Kawale, J., Bui, H., Kveton, B., Thanh, L.T., Chawla, S.: Efficient thompson sampling for online matrix-factorization recommendation, vol. 2015-January (2015)"},{"key":"31_CR15","unstructured":"Kleinberg, R.: Nearly tight bounds for the continuum-armed bandit problem (2005)"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3299873","volume":"66","author":"R Kleinberg","year":"2019","unstructured":"Kleinberg, R., Slivkins, A., Upfal, E.: Bandits and experts in metric spaces. J. ACM 66, 1\u201377 (2019)","journal-title":"J. ACM"},{"key":"31_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401","volume-title":"Bandit Algorithms","author":"T Lattimore","year":"2020","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit Algorithms. Cambridge University Press, Cambridge (2020)"},{"key":"31_CR18","doi-asserted-by":"publisher","unstructured":"Li, X., et al.: Symmetry, saddle points, and global optimization landscape of nonconvex matrix factorization. IEEE Trans. Inf. Theory 65 (2019). https:\/\/doi.org\/10.1109\/TIT.2019.2898663","DOI":"10.1109\/TIT.2019.2898663"},{"key":"31_CR19","unstructured":"Lykouris, T., Tardos, E., Wali, D.: Feedback graph regret bounds for Thompson sampling and UCB (2019)"},{"key":"31_CR20","first-page":"10148","volume":"21","author":"H Lyu","year":"2020","unstructured":"Lyu, H., Needell, D., Balzano, L.: Online matrix factorization for Markovian data and applications to network dictionary learning. J. Mach. Learn. Res. 21, 10148\u201310196 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"31_CR21","first-page":"19","volume":"11","author":"J Mairal","year":"2010","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online learning for matrix factorization and sparse coding. J. Mach. Learn. Res. 11, 19\u201360 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"31_CR22","unstructured":"Mannor, S., Shamir, O.: From bandits to experts: on the value of side-observations (2011)"},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-540-68279-0_17","volume-title":"50 Years of Integer Programming 1958-2008","author":"F Margot","year":"2010","unstructured":"Margot, F.: Symmetry in integer linear programming. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958-2008, pp. 647\u2013686. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_17"},{"key":"31_CR24","doi-asserted-by":"publisher","unstructured":"Margot, F.: Pruning by isomorphism in branch-and-cut. Math. Program. Seri. B 94 (2002). https:\/\/doi.org\/10.1007\/s10107-002-0358-2","DOI":"10.1007\/s10107-002-0358-2"},{"key":"31_CR25","doi-asserted-by":"publisher","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Math. Program. 126 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0273-x","DOI":"10.1007\/s10107-009-0273-x"},{"key":"31_CR26","doi-asserted-by":"publisher","unstructured":"Ratcliffe, J.G.: Foundations of Hyperbolic Manifolds (2007). https:\/\/doi.org\/10.1007\/978-0-387-47322-2","DOI":"10.1007\/978-0-387-47322-2"},{"key":"31_CR27","unstructured":"Sannai, A., Imaizumi, M., Kawano, M.: Improved generalization bounds of group invariant\/equivariant deep networks via quotient feature spaces (2019)"},{"key":"31_CR28","unstructured":"Shamir, O.: On the complexity of bandit and derivative-free stochastic convex optimization, vol. 30 (2013)"},{"key":"31_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000068","volume":"12","author":"A Slivkins","year":"2019","unstructured":"Slivkins, A.: Introduction to multi-armed bandits. Found. Trends Mach. Learn. 12, 1\u2013286 (2019)","journal-title":"Found. Trends Mach. Learn."},{"key":"31_CR30","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/biomet\/25.3-4.285","volume":"25","author":"WR Thompson","year":"1933","unstructured":"Thompson, W.R.: On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25, 285\u2013294 (1933)","journal-title":"Biometrika"},{"key":"31_CR31","unstructured":"Tran, N.P., Tran-Thanh, L.: Invariant lipschitz bandits: a side observation approach (2022). https:\/\/arxiv.org\/abs\/2212.07524v2"},{"key":"31_CR32","doi-asserted-by":"publisher","unstructured":"Walsh, T.: Symmetry breaking constraints: recent results, vol. 3 (2012). https:\/\/doi.org\/10.1609\/aaai.v26i1.8437","DOI":"10.1609\/aaai.v26i1.8437"},{"key":"31_CR33","doi-asserted-by":"publisher","unstructured":"Wang, H., Wu, Q., Wang, H.: Factorization bandits for interactive recommendation (2017). https:\/\/doi.org\/10.1609\/aaai.v31i1.10936","DOI":"10.1609\/aaai.v31i1.10936"},{"key":"31_CR34","doi-asserted-by":"publisher","unstructured":"Wang, Q., et al.: Online interactive collaborative filtering using multi-armed bandit with dependent arms. IEEE Trans. Knowl. Data Eng. 31 (2019). https:\/\/doi.org\/10.1109\/TKDE.2018.2866041","DOI":"10.1109\/TKDE.2018.2866041"},{"key":"31_CR35","unstructured":"Wu, Y.: Lecture 14: Packing, covering, and consequences on minimax risk (2016). http:\/\/www.stat.yale.edu\/yw562\/teaching\/598\/lec14.pdf"}],"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-43421-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T20:46:28Z","timestamp":1694983588000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43421-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031434204","9783031434211"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43421-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 September 2023","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":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"829","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"196","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.63","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Applied Data Science Track: 239 submissions, 58 accepted papers; Demo Track: 31 submissions, 16 accepted papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}