{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:05:07Z","timestamp":1757617507950,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"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-1090-7_27","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:33:15Z","timestamp":1741105995000},"page":"326-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robust Matroid Bandit Optimization Against Adversarial Contamination"],"prefix":"10.1007","author":[{"given":"Youming","family":"Tao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuzhen","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Falko","family":"Dressler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1287\/moor.2013.0598","volume":"39","author":"JY Audibert","year":"2014","unstructured":"Audibert, J.Y., Bubeck, S., Lugosi, G.: Regret in online combinatorial optimization. Math. Oper. Res. 39(1), 31\u201345 (2014)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"27_CR2","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(2), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"27_CR3","unstructured":"Basu, D., Dimitrakakis, C., Tossou, A.: Privacy in multi-armed bandits: Fundamental definitions and lower bounds. arXiv preprint arXiv:1905.12298 (2019)"},{"key":"27_CR4","unstructured":"Basu, D., Maillard, O.A., Mathieu, T.: Bandits corrupted by nature: Lower bounds on regret and robust optimistic algorithm. arXiv preprint arXiv:2203.03186 (2022)"},{"key":"27_CR5","unstructured":"Chandak, K., Hu, B., Hegde, N.: Differentially private algorithms for efficient online matroid optimization. In: Conference on Lifelong Learning Agents. pp. 66\u201388. PMLR (2023)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Steinhardt, J., Valiant, G.: Learning from untrusted data. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. pp. 47\u201360 (2017)","DOI":"10.1145\/3055399.3055491"},{"key":"27_CR7","unstructured":"Chen, L., Gupta, A., Li, J.: Pure exploration of multi-armed bandit under matroid constraints. In: Proceedings of the 29th Conference on Learning Theory (COLT). pp. 647\u2013669 (2016)"},{"issue":"5","key":"27_CR8","doi-asserted-by":"publisher","first-page":"1932","DOI":"10.1214\/17-AOS1607","volume":"46","author":"M Chen","year":"2018","unstructured":"Chen, M., Gao, C., Ren, Z.: Robust covariance and scatter matrix estimation under huber\u2019s contamination model. Ann. Stat. 46(5), 1932\u20131960 (2018)","journal-title":"Ann. Stat."},{"key":"27_CR9","unstructured":"Chen, X., Zheng, K., Zhou, Z., Yang, Y., Chen, W., Wang, L.: (locally) differentially private combinatorial semi-bandits. In: Proceedings of the 37th International Conference on Machine Learning (ICML). pp. 1757\u20131767 (2020)"},{"issue":"1","key":"27_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TCOM.1977.1093711","volume":"25","author":"R Gallager","year":"1977","unstructured":"Gallager, R.: A minimum delay routing algorithm using distributed computation. IEEE Trans. Commun. 25(1), 73\u201385 (1977)","journal-title":"IEEE Trans. Commun."},{"key":"27_CR11","unstructured":"Huang, Z., Xu, Y., Hu, B., Wang, Q., Pan, J.: Thompson sampling for combinatorial semi-bandits with sleeping arms and long-term fairness constraints. arXiv preprint arXiv:2005.06725 (2020)"},{"key":"27_CR12","unstructured":"Huber, P.J.: Robust statistics, vol.\u00a0523. John Wiley & Sons (2004)"},{"issue":"4","key":"27_CR13","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s10994-018-5758-5","volume":"108","author":"S Kapoor","year":"2019","unstructured":"Kapoor, S., Patel, K.K., Kar, P.: Corruption-tolerant bandit learning. Mach. Learn. 108(4), 687\u2013715 (2019)","journal-title":"Mach. Learn."},{"key":"27_CR14","unstructured":"Kveton, B., Wen, Z., Ashkan, A., Eydgahi, H., Eriksson, B.: Matroid bandits: Fast combinatorial optimization with learning. In: Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence (UAI) (2014)"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Lai, K.A., Rao, A.B., Vempala, S.: Agnostic estimation of mean and covariance. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). pp. 665\u2013674. IEEE (2016)","DOI":"10.1109\/FOCS.2016.76"},{"key":"27_CR16","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: An information-theoretic approach to minimax regret in partial monitoring. In: Proceedings of the 32nd Conference on Learning Theory (COLT). pp. 2111\u20132139 (2019)"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit algorithms. Cambridge University Press (2020)","DOI":"10.1017\/9781108571401"},{"key":"27_CR18","unstructured":"Liu, L., Li, T., Caramanis, C.: High dimensional robust estimation of sparse models via trimmed hard thresholding. arXiv preprint arXiv:1901.08237 (2019)"},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1214\/20-AOS1961","volume":"49","author":"G Lugosi","year":"2021","unstructured":"Lugosi, G., Mendelson, S.: Robust multivariate mean estimation: The optimality of trimmed mean. Ann. Stat. 49(1), 393\u2013410 (2021)","journal-title":"Ann. Stat."},{"issue":"1","key":"27_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000038","volume":"7","author":"R Munos","year":"2014","unstructured":"Munos, R.: The optimistic principle applied to games, optimization and planning: Towards foundations of monte-carlo tree search. Foundations and Trends in Machine Learning 7(1), 1\u2013130 (2014)","journal-title":"Foundations and Trends in Machine Learning"},{"key":"27_CR21","unstructured":"Niss, L., Tewari, A.: What you see may not be what you get: Ucb bandit algorithms robust to $$varepsilon$$-contamination. In: Conference on Uncertainty in Artificial Intelligence. pp. 450\u2013459. PMLR (2020)"},{"key":"27_CR22","unstructured":"Oxley, J.G.: Matroid theory, vol. 3. Oxford University Press, USA (2006)"},{"key":"27_CR23","unstructured":"Perrault, P., Perchet, V., Valko, M.: Exploiting structure of uncertainty for efficient matroid semi-bandits. In: Proceedings of the 36th International Conference on Machine Learning (ICML). pp. 5123\u20135132 (2019)"},{"key":"27_CR24","unstructured":"Prasad, A., Balakrishnan, S., Ravikumar, P.: A robust univariate mean estimator is all you need. In: International Conference on Artificial Intelligence and Statistics. pp. 4034\u20134044. PMLR (2020)"},{"key":"27_CR25","unstructured":"Schrijver, A., et\u00a0al.: Combinatorial optimization: polyhedra and efficiency, vol.\u00a024. Springer (2003)"},{"key":"27_CR26","unstructured":"Talebi, M.S., Proutiere, A.: An optimal algorithm for stochastic matroid bandit optimization. In: Proceedings of the 16th International Conference on Autonomous Agents & Multiagent Systems (AAMAS). pp. 548\u2013556 (2016)"},{"key":"27_CR27","unstructured":"Tao, Y., Wu, Y., Zhao, P., Wang, D.: Optimal rates of (locally) differentially private heavy-tailed multi-armed bandits. In: Proceedings of the 25th International Conference on Artificial Intelligence and Statistics. pp. 1546\u20131574 (2022)"},{"key":"27_CR28","unstructured":"Wu, Y., Zhou, X., Tao, Y., Wang, D.: On private and robust bandits. Advances in Neural Information Processing Systems 36 (2024)"},{"key":"27_CR29","unstructured":"Xu, H., Li, J.: Simple combinatorial algorithms for combinatorial bandits: Corruptions and approximations. In: Uncertainty in Artificial Intelligence. pp. 1444\u20131454. PMLR (2021)"},{"key":"27_CR30","doi-asserted-by":"crossref","unstructured":"Zuo, J., Joe-Wong, C.: Combinatorial multi-armed bandits for resource allocation. In: Proceedings of the 55th Annual Conference on Information Sciences and Systems (CISS). pp.\u00a01\u20134. IEEE (2021)","DOI":"10.1109\/CISS50987.2021.9400228"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:28:30Z","timestamp":1757143710000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_27","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":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","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":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}