{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T16:39:20Z","timestamp":1786120760674,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T00:00:00Z","timestamp":1786147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"National Science Foundation","award":["2045641"],"award-info":[{"award-number":["2045641"]}]},{"name":"National Science Foundation","award":["2325956"],"award-info":[{"award-number":["2325956"]}]},{"name":"National Science Foundation","award":["2512128"],"award-info":[{"award-number":["2512128"]}]},{"name":"National Science Foundation","award":["2533814"],"award-info":[{"award-number":["2533814"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,8,9]]},"DOI":"10.1145\/3770855.3818086","type":"proceedings-article","created":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T01:08:33Z","timestamp":1786064913000},"page":"1286-1297","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Learning to Rank under Corruption: A Robust Cascading Bandits Approach"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4049-3922","authenticated-orcid":false,"given":"Fatemeh","family":"Ghaffari","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-0608-1618","authenticated-orcid":false,"given":"Siddarth","family":"Sitaraman","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8628-5873","authenticated-orcid":false,"given":"Xutong","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Washington Tacoma, Tacoma, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8043-8521","authenticated-orcid":false,"given":"Xuchuang","family":"Wang","sequence":"additional","affiliation":[{"name":"Hong Kong Baptisit University, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9278-2254","authenticated-orcid":false,"given":"Mohammad","family":"Hajiesmaili","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,8,8]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Amazon. 2023. Amazon's Latest Actions Against Fake Review Brokers. https:\/\/www.aboutamazon.com\/news\/policy-news-views\/amazons-latest-actions-against-fake-review-brokers Accessed: 2025-10-07."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_3_1","first-page":"1","article-title":"Combinatorial Multi-Armed Bandit: General Framework, Results and Applications","volume":"17","author":"Chen Wei","year":"2016","unstructured":"Wei Chen, Yajun Wang, and Yang Yuan. 2016. Combinatorial Multi-Armed Bandit: General Framework, Results and Applications. Journal of Machine Learning Research, V17, 1 (2016), 1-46.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_4_1","volume-title":"Continuous K-Max Bandits. arXiv preprint arXiv:2502.13467","author":"Chen Yu","year":"2025","unstructured":"Yu Chen, Siwei Wang, Longbo Huang, and Wei Chen. 2025. Continuous K-Max Bandits. arXiv preprint arXiv:2502.13467 (2025)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2988450.2988454"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745852"},{"key":"e_1_3_2_1_7_1","first-page":"2116","volume-title":"Advances in Neural Information Processing Systems","volume":"28","author":"Combes Richard","year":"2015","unstructured":"Richard Combes, M Sadegh Talebi, Alexandre Proutiere, and Marc Lelarge. 2015b. Combinatorial Bandits Revisited. In Advances in Neural Information Processing Systems, Vol. V28. 2116-2124."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467580"},{"key":"e_1_3_2_1_9_1","volume-title":"Conference on Learning Theory. PMLR, 1562-1578","author":"Gupta Anupam","year":"2019","unstructured":"Anupam Gupta, Tomer Koren, and Kunal Talwar. 2019. Better algorithms for stochastic bandits with adversarial corruptions. In Conference on Learning Theory. PMLR, 1562-1578."},{"key":"e_1_3_2_1_10_1","volume-title":"International Conference on Machine Learning. PMLR, 4030-4039","author":"Han Yanjun","year":"2021","unstructured":"Yanjun Han, Yining Wang, and Xi Chen. 2021. Adversarial combinatorial bandits with general non-linear reward functions. In International Conference on Machine Learning. PMLR, 4030-4039."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219846"},{"key":"e_1_3_2_1_13_1","first-page":"1214","article-title":"AliExpress Learning-To-Rank: Maximizing online model performance without going online","volume":"35","author":"Huzhang Guangda","year":"2021","unstructured":"Guangda Huzhang, Zhen-Jia Pang, Yongqing Gao, Yawen Liu, Weijie Shen, Wen-Ji Zhou, Qianying Lin, Qing Da, An-Xiang Zeng, Han Yu, et al., 2021. AliExpress Learning-To-Rank: Maximizing online model performance without going online. IEEE Transactions on Knowledge and Data Engineering, V35, 2 (2021), 1214-1226.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_1_14_1","unstructured":"IMDb. 2023. IMDb Weighted Average Ratings. https:\/\/help.imdb.com\/article\/imdb\/track-movies-tv\/weighted-average-ratings\/GWT2DSBYVT2F25SK. Accessed: 2025-10-04."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11600930_5"},{"key":"e_1_3_2_1_16_1","first-page":"2654","volume-title":"Wortman Vaughan (Eds.)","volume":"34","author":"Ito Shinji","year":"2021","unstructured":"Shinji Ito. 2021. Hybrid Regret Bounds for Combinatorial Semi-Bandits and Adversarial Linear Bandits. In Advances in Neural Information Processing Systems, M. Ranzato, A. Beygelzimer, Y. Dauphin, P.S. Liang, and J. Wortman Vaughan (Eds.), Vol. V34. Curran Associates, Inc., 2654-2667. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2021\/file\/15a50c8ba6a0002a2fa7e5d8c0a40bd9-Paper.pdf"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the 33rd International Conference on International Conference on Machine Learning -","volume":"48","author":"Katariya Sumeet","year":"2016","unstructured":"Sumeet Katariya, Branislav Kveton, Csaba Szepesv\u00e1ri, and Zheng Wen. 2016. DCM bandits: learning to rank with multiple clicks. In Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48 (New York, NY, USA) (ICML'16). JMLR.org, 1215\u20131224."},{"key":"e_1_3_2_1_18_1","volume-title":"International conference on machine learning. PMLR, 767-776","author":"Kveton Branislav","year":"2015","unstructured":"Branislav Kveton, Csaba Szepesvari, Zheng Wen, and Azin Ashkan. 2015a. Cascading bandits: Learning to rank in the cascade model. In International conference on machine learning. PMLR, 767-776."},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 18th International Conference on Artificial Intelligence and Statistics. PMLR, 535-543","author":"Kveton Branislav","year":"2015","unstructured":"Branislav Kveton, Csaba Szepesv\u00e1ri, Zheng Wen, and Azin Ashkan. 2015b. Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits. In Proceedings of the 18th International Conference on Artificial Intelligence and Statistics. PMLR, 535-543."},{"key":"e_1_3_2_1_20_1","volume-title":"Matroid bandits: Fast combinatorial optimization with learning. arXiv preprint arXiv:1403.5045","author":"Kveton Branislav","year":"2014","unstructured":"Branislav Kveton, Zheng Wen, Azin Ashkan, Hoda Eydgahi, and Brian Eriksson. 2014. Matroid bandits: Fast combinatorial optimization with learning. arXiv preprint arXiv:1403.5045 (2014)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/3157096.3157276"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412245"},{"key":"e_1_3_2_1_23_1","volume-title":"International Conference on Machine Learning. PMLR, 3856-3865","author":"Li Shuai","year":"2019","unstructured":"Shuai Li, Tor Lattimore, and Csaba Szepesv\u00e1ri. 2019. Online learning to rank with features. In International Conference on Machine Learning. PMLR, 3856-3865."},{"key":"e_1_3_2_1_24_1","volume-title":"International conference on machine learning. PMLR, 1245-1253","author":"Li Shuai","year":"2016","unstructured":"Shuai Li, Baoxiang Wang, Shengyu Zhang, and Wei Chen. 2016. Contextual combinatorial cascading bandits. In International conference on machine learning. PMLR, 1245-1253."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11763"},{"key":"e_1_3_2_1_26_1","volume-title":"V35","author":"Liu Xutong","year":"2022","unstructured":"Xutong Liu, Jinhang Zuo, Siwei Wang, Carlee Joe-Wong, John Lui, and Wei Chen. 2022. Batch-size independent regret bounds for combinatorial semi-bandits with probabilistically triggered arms or independent arms. Advances in Neural Information Processing Systems, V35 (2022), 14904-14916."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2015.2304"},{"key":"e_1_3_2_1_28_1","volume-title":"V19, 5","author":"Lugosi G\u00e1bor","year":"2019","unstructured":"G\u00e1bor Lugosi and Shahar Mendelson. 2019. Mean estimation and regression under heavy-tailed distributions: A survey. Foundations of Computational Mathematics, V19, 5 (2019), 1145-1190."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188918"},{"key":"e_1_3_2_1_30_1","volume-title":"Published","author":"Masurel Paul","year":"2013","unstructured":"Paul Masurel. 2013. Of Bayesian Average and Star Ratings. https:\/\/fulmicoton.com\/posts\/bayesian_rating\/. Published March 17, 2013. Accessed: 2025-10-04."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911996.2912004"},{"key":"e_1_3_2_1_32_1","volume-title":"NIPS Workshop on Advances in Ranking","volume":"3","author":"D","unstructured":"D Sculley et al., 2009. Large scale learning to rank. In NIPS Workshop on Advances in Ranking, Vol. V3."},{"key":"e_1_3_2_1_33_1","volume-title":"V35","author":"Vial Daniel","year":"2022","unstructured":"Daniel Vial, Sujay Sanghavi, Sanjay Shakkottai, and Rayadurgam Srikant. 2022. Minimax regret for cascading bandits. Advances in Neural Information Processing Systems, V35 (2022), 29126-29138."},{"key":"e_1_3_2_1_34_1","volume-title":"V30","author":"Wang Qinshi","year":"2017","unstructured":"Qinshi Wang and Wei Chen. 2017. Improving regret bounds for combinatorial semi-bandits with probabilistically triggered arms and its applications. Advances in Neural Information Processing Systems, V30 (2017)."},{"key":"e_1_3_2_1_35_1","volume-title":"Stochastic Bandits Robust to Adversarial Attacks. arXiv preprint arXiv:2408.08859","author":"Wang Xuchuang","year":"2024","unstructured":"Xuchuang Wang, Jinhang Zuo, Xutong Liu, John Lui, and Mohammad Hajiesmaili. 2024. Stochastic Bandits Robust to Adversarial Attacks. arXiv preprint arXiv:2408.08859 (2024)."},{"key":"e_1_3_2_1_36_1","volume-title":"International Conference on Algorithmic Learning Theory. PMLR, 1043-1096","author":"Wei Chen-Yu","year":"2022","unstructured":"Chen-Yu Wei, Christoph Dann, and Julian Zimmert. 2022. A model selection approach for corruption robust reinforcement learning. In International Conference on Algorithmic Learning Theory. PMLR, 1043-1096."},{"key":"e_1_3_2_1_37_1","volume-title":"Cascading bandits robust to adversarial corruptions. arXiv preprint arXiv:2502.08077","author":"Xie Jize","year":"2025","unstructured":"Jize Xie, Cheng Chen, Zhiyong Wang, and Shuai Li. 2025. Cascading bandits robust to adversarial corruptions. arXiv preprint arXiv:2502.08077 (2025)."},{"key":"e_1_3_2_1_38_1","first-page":"1444","article-title":"Simple combinatorial algorithms for combinatorial bandits: Corruptions and approximations. In Uncertainty in Artificial Intelligence","author":"Xu Haike","year":"2021","unstructured":"Haike Xu and Jian Li. 2021. Simple combinatorial algorithms for combinatorial bandits: Corruptions and approximations. In Uncertainty in Artificial Intelligence. PMLR, 1444-1454.","journal-title":"PMLR"},{"key":"e_1_3_2_1_39_1","volume-title":"V36","author":"Xue Bo","year":"2023","unstructured":"Bo Xue, Yimu Wang, Yuanyu Wan, Jinfeng Yi, and Lijun Zhang. 2023. Efficient algorithms for generalized linear bandits with heavy-tailed rewards. Advances in Neural Information Processing Systems, V36 (2023), 70880-70891."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2507885"},{"key":"e_1_3_2_1_41_1","unstructured":"Yelp Inc. 2024. Yelp Open Dataset. https:\/\/business.yelp.com\/data\/resources\/open-dataset\/. Accessed: 2025-10-07."},{"key":"e_1_3_2_1_42_1","unstructured":"Yelp Inc. 2025. Yelp Open Dataset. https:\/\/business.yelp.com\/data\/resources\/open-dataset. Accessed: 2025-10-04."},{"key":"e_1_3_2_1_43_1","volume-title":"V34","author":"Zhong Han","year":"2021","unstructured":"Han Zhong, Jiayi Huang, Lin Yang, and Liwei Wang. 2021b. Breaking the moments condition barrier: No-regret algorithm for bandits with super heavy-tailed payoffs. Advances in Neural Information Processing Systems, V34 (2021), 15710-15720."},{"key":"e_1_3_2_1_44_1","first-page":"1","article-title":"Thompson sampling algorithms for cascading bandits","volume":"22","author":"Zhong Zixin","year":"2021","unstructured":"Zixin Zhong, Wang Chi Chueng, and Vincent YF Tan. 2021a. Thompson sampling algorithms for cascading bandits. Journal of Machine Learning Research, V22, 218 (2021), 1-66.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_45_1","volume-title":"International conference on machine learning. PMLR, 4199-4208","author":"Zoghi Masrour","year":"2017","unstructured":"Masrour Zoghi, Tomas Tunys, Mohammad Ghavamzadeh, Branislav Kveton, Csaba Szepesvari, and Zheng Wen. 2017. Online learning to rank in stochastic click models. In International conference on machine learning. PMLR, 4199-4208."},{"key":"e_1_3_2_1_46_1","volume-title":"Zheng Wen, and Branislav Kveton.","author":"Zong Shi","year":"2016","unstructured":"Shi Zong, Hao Ni, Kenny Sung, Nan Rosemary Ke, Zheng Wen, and Branislav Kveton. 2016. Cascading bandits for large-scale recommendation problems. arXiv preprint arXiv:1603.05359 (2016)."},{"key":"e_1_3_2_1_47_1","volume-title":"V36","author":"Zuo Jinhang","year":"2023","unstructured":"Jinhang Zuo, Zhiyao Zhang, Zhiyong Wang, Shuai Li, Mohammad Hajiesmaili, and Adam Wierman. 2023. Adversarial attacks on online learning to rank with click feedback. Advances in Neural Information Processing Systems, V36 (2023), 41675-41692."}],"event":{"name":"KDD '26: The 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Jeju Island Republic of Korea","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3770855.3818086","content-type":"text\/html","content-version":"vor","intended-application":"syndication"}],"deposited":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T01:19:54Z","timestamp":1786065594000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3770855.3818086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,8]]},"references-count":47,"alternative-id":["10.1145\/3770855.3818086","10.1145\/3770855"],"URL":"https:\/\/doi.org\/10.1145\/3770855.3818086","relation":{},"subject":[],"published":{"date-parts":[[2026,8,8]]},"assertion":[{"value":"2026-08-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}