{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T01:12:14Z","timestamp":1778721134445,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","funder":[{"name":"National Natural Science Foundation of China","award":["62271434"],"award-info":[{"award-number":["62271434"]}]},{"name":"Shenzhen Key Laboratory of Crowd Intelligence Empowered Low-Carbon Energy Networks","award":["ZDSYS20220606100601002"],"award-info":[{"award-number":["ZDSYS20220606100601002"]}]},{"name":"National Natural Science Foundation of China","award":["625B2163"],"award-info":[{"award-number":["625B2163"]}]},{"name":"National Natural Science Foundation of China","award":["62502412"],"award-info":[{"award-number":["62502412"]}]},{"name":"Hong Kong General Research Fund","award":["14202923"],"award-info":[{"award-number":["14202923"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,4,13]]},"DOI":"10.1145\/3774904.3792396","type":"proceedings-article","created":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T12:38:33Z","timestamp":1777293513000},"page":"2183-2194","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["BANCO: Drift-Aware Batched Bandits for Adaptive Proximity Graph Pruning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3141-3460","authenticated-orcid":false,"given":"Jin","family":"Cheng","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0179-196X","authenticated-orcid":false,"given":"Xiangxiang","family":"Dai","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong SAR, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9052-8719","authenticated-orcid":false,"given":"Ningning","family":"Ding","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7466-0384","authenticated-orcid":false,"given":"John C.S.","family":"Lui","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong SAR, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6631-1096","authenticated-orcid":false,"given":"Jianwei","family":"Huang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, China"}]}],"member":"320","published-online":{"date-parts":[[2026,4,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Improved algorithms for linear stochastic bandits. Advances in neural information processing systems","author":"Abbasi-Yadkori Yasin","year":"2011","unstructured":"Yasin Abbasi-Yadkori, D\u00e1vid P\u00e1l, and Csaba Szepesv\u00e1ri. 2011. Improved algorithms for linear stochastic bandits. Advances in neural information processing systems, Vol. 24 (2011)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.16228"},{"key":"e_1_3_2_1_3_1","first-page":"459","article-title":"Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions","author":"Andoni Alexandr","year":"2008","unstructured":"Alexandr Andoni and Piotr Indyk. 2008. Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. In FOCS. 459-468.","journal-title":"FOCS."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_5_1","volume-title":"2002 b. Finite-time analysis of the multiarmed bandit problem. Machine learning","author":"Auer Peter","year":"2002","unstructured":"Peter Auer, Nicolo Cesa-Bianchi, and Paul Fischer. 2002 b. Finite-time analysis of the multiarmed bandit problem. Machine learning, Vol. 47, 2 (2002), 235-256."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 12th International Conference on Music Information Retrieval (ISMIR","author":"Bertin-Mahieux Thierry","year":"2011","unstructured":"Thierry Bertin-Mahieux, Daniel P.W. Ellis, Brian Whitman, and Paul Lamere. 2011. The Million Song Dataset. In Proceedings of the 12th International Conference on Music Information Retrieval (ISMIR 2011)."},{"key":"e_1_3_2_1_8_1","volume-title":"Trading Vector Data in Vector Databases. arXiv preprint arXiv:2511.07139","author":"Cheng Jin","year":"2025","unstructured":"Jin Cheng, Xiangxiang Dai, Ningning Ding, John Lui, and Jianwei Huang. 2025a. Trading Vector Data in Vector Databases. arXiv preprint arXiv:2511.07139 (2025)."},{"key":"e_1_3_2_1_9_1","volume-title":"OSTOR: Online Scheduling Framework for Trading Continuous Queries. In 2025 IEEE 41st International Conference on Data Engineering (ICDE). IEEE Computer Society","author":"Cheng Jin","year":"2025","unstructured":"Jin Cheng, Ningning Ding, John CS Lui, and Jianwei Huang. 2025b. OSTOR: Online Scheduling Framework for Trading Continuous Queries. In 2025 IEEE 41st International Conference on Data Engineering (ICDE). IEEE Computer Society, 1895-1909."},{"key":"e_1_3_2_1_10_1","volume-title":"The 22nd International Conference on Artificial Intelligence and Statistics. PMLR, 1079-1087","author":"Cheung Wang Chi","year":"2019","unstructured":"Wang Chi Cheung, David Simchi-Levi, and Ruihao Zhu. 2019. Learning to optimize under non-stationarity. In The 22nd International Conference on Artificial Intelligence and Statistics. PMLR, 1079-1087."},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the 32nd COLT Conference. 1075-1104","author":"Cheung Wai-Shun","year":"2019","unstructured":"Wai-Shun Cheung and David Simchi-Levi. 2019. Learning to Optimize under Non-Stationarity. In Proceedings of the 32nd COLT Conference. 1075-1104."},{"key":"e_1_3_2_1_12_1","first-page":"427","volume-title":"Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2","author":"Dai Xiangxiang","unstructured":"Xiangxiang Dai, Xiaowei Sun, Jinhang Zuo, Xutong Liu, and John C.S. Lui. 2025. A Unified Online-Offline Framework for Co-Branding Campaign Recommendations. In Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2. New York, NY, USA, 427-438."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3423442"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3448250"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the VLDB Endowment","volume":"14","author":"Fu Cong","year":"2020","unstructured":"Cong Fu, Chao Xiang, Changxu Wang, and Deng Cai. 2020. Fast Approximate Nearest Neighbor Search with the Navigating Spreading-out Graph. Proceedings of the VLDB Endowment, Vol. 14, 1 (2020)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24412-4_16"},{"key":"e_1_3_2_1_18_1","first-page":"1","article-title":"Batched neural bandits","volume":"1","author":"Gu Quanquan","year":"2024","unstructured":"Quanquan Gu, Amin Karbasi, Khashayar Khosravi, Vahab Mirrokni, and Dongruo Zhou. 2024. Batched neural bandits. ACM\/JMS Journal of Data Science, Vol. 1, 1 (2024), 1-18.","journal-title":"ACM\/JMS Journal of Data Science"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TON.2025.3550732"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.616"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599854"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI). 971-987","author":"Jayaram Subramanya","unstructured":"Subramanya Jayaram, Badrish Chandramouli, Guna Prasaad, and et al., 2022. DiskANN: Fast Accurate Billion-Point Nearest Neighbor Search on a Single Node. In Proceedings of the 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI). 971-987."},{"key":"e_1_3_2_1_23_1","volume-title":"Product quantization for nearest neighbor search","author":"Jegou Herve","year":"2010","unstructured":"Herve Jegou, Matthijs Douze, and Cordelia Schmid. 2010. Product quantization for nearest neighbor search. IEEE transactions on pattern analysis and machine intelligence, Vol. 33, 1 (2010), 117-128."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714870"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_1_26_1","volume-title":"Discounted UCB. In Proceedings of the 2nd PASCAL Challenges Workshop.","author":"Kocsis Levente","year":"2006","unstructured":"Levente Kocsis and Csaba Szepesv\u00e1ri. 2006. Discounted UCB. In Proceedings of the 2nd PASCAL Challenges Workshop."},{"key":"e_1_3_2_1_27_1","article-title":"Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies","volume":"9","author":"Krause Andreas","year":"2008","unstructured":"Andreas Krause, Ajit Singh, and Carlos Guestrin. 2008. Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies. Journal of Machine Learning Research, Vol. 9, 2 (2008).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714773"},{"key":"e_1_3_2_1_29_1","volume-title":"Fedconpe: Efficient federated conversational bandits with heterogeneous clients. arXiv preprint","author":"Li Zhuohua","year":"2024","unstructured":"Zhuohua Li, Maoli Liu, and John Lui. 2024. Fedconpe: Efficient federated conversational bandits with heterogeneous clients. arXiv preprint (2024)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3726302.3730115"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3726854.3727279"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-024-00864-x"},{"key":"e_1_3_2_1_35_1","first-page":"1532","article-title":"GloVe","author":"Pennington Jeffrey","year":"2014","unstructured":"Jeffrey Pennington, Richard Socher, and Christopher D. Manning. 2014. GloVe: Global Vectors for Word Representation. In Empirical Methods in Natural Language Processing (EMNLP). 1532-1543.","journal-title":"Global Vectors for Word Representation. In Empirical Methods in Natural Language Processing (EMNLP)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3669940.3707264"},{"key":"e_1_3_2_1_37_1","volume-title":"Advances in Neural Information Processing Systems 32 (NeurIPS","author":"Subramanya Suhas Jayaram","year":"2019","unstructured":"Suhas Jayaram Subramanya, Devvrit, Rohan Kadekodi, Ravishankar Krishnaswamy, and Harsha Vardhan Simhadri. 2019. DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node. In Advances in Neural Information Processing Systems 32 (NeurIPS 2019)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i12.33380"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA59077.2024.00035"},{"key":"e_1_3_2_1_40_1","first-page":"70880","article-title":"Efficient algorithms for generalized linear bandits with heavy-tailed rewards","volume":"36","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, Vol. 36 (2023), 70880-70891.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714633"},{"key":"e_1_3_2_1_42_1","first-page":"1","article-title":"Continuous-in-time limit for Bayesian bandits","volume":"24","author":"Zhu Yuhua","year":"2023","unstructured":"Yuhua Zhu, Zachary Izzo, and Lexing Ying. 2023. Continuous-in-time limit for Bayesian bandits. Journal of Machine Learning Research, Vol. 24, 305 (2023), 1-35.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557347"}],"event":{"name":"WWW '26: The ACM Web Conference 2026","location":"Dubai United Arab Emirates","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2026"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3774904.3792396","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T00:50:47Z","timestamp":1778719847000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3774904.3792396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,12]]},"references-count":43,"alternative-id":["10.1145\/3774904.3792396","10.1145\/3774904"],"URL":"https:\/\/doi.org\/10.1145\/3774904.3792396","relation":{},"subject":[],"published":{"date-parts":[[2026,4,12]]},"assertion":[{"value":"2026-04-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}