{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:05:55Z","timestamp":1775228755988,"version":"3.50.1"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031560620","type":"print"},{"value":"9783031560637","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-56063-7_7","type":"book-chapter","created":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T08:44:01Z","timestamp":1711097041000},"page":"105-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["How to\u00a0Forget Clients in\u00a0Federated Online Learning to\u00a0Rank?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4467-5574","authenticated-orcid":false,"given":"Shuyi","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7858-7468","authenticated-orcid":false,"given":"Bing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0271-5563","authenticated-orcid":false,"given":"Guido","family":"Zuccon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,23]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3439861","volume":"39","author":"Q Ai","year":"2021","unstructured":"Ai, Q., Yang, T., Wang, H., Mao, J.: Unbiased learning to rank: online or offline? ACM Trans. Inf. Syst. (TOIS) 39(2), 1\u201329 (2021)","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"88137","DOI":"10.1109\/ACCESS.2021.3090019","volume":"9","author":"N Aldaghri","year":"2021","unstructured":"Aldaghri, N., Mahdavifar, H., Beirami, A.: Coded machine unlearning. IEEE Access 9, 88137\u201388150 (2021)","journal-title":"IEEE Access"},{"key":"7_CR3","unstructured":"Baruch, G., Baruch, M., Goldberg, Y.: A little is enough: circumventing defenses for distributed learning. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"issue":"9","key":"7_CR4","doi-asserted-by":"publisher","first-page":"3203","DOI":"10.1007\/s10994-022-06178-9","volume":"111","author":"T Baumhauer","year":"2022","unstructured":"Baumhauer, T., Sch\u00f6ttle, P., Zeppelzauer, M.: Machine unlearning: linear filtration for logit-based classifiers. Mach. Learn. 111(9), 3203\u20133226 (2022)","journal-title":"Mach. Learn."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bourtoule, L., et al.: Machine unlearning. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 141\u2013159. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00019"},{"key":"7_CR6","unstructured":"Brophy, J., Lowd, D.: Machine unlearning for random forests. In: Meila, M., Zhang, T. (eds.) Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18\u201324 July 2021, Virtual Event. Proceedings of Machine Learning Research, vol. 139, pp. 1092\u20131104. PMLR (2021). https:\/\/proceedings.mlr.press\/v139\/brophy21a.html"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Cao, Y., Yang, J.: Towards making systems forget with machine unlearning. In: 2015 IEEE Symposium on Security and Privacy, SP 2015, San Jose, CA, USA, 17\u201321 May 2015, pp. 463\u2013480. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/SP.2015.35","DOI":"10.1109\/SP.2015.35"},{"key":"7_CR8","unstructured":"Chapelle, O., Chang, Y.: Yahoo! Learning to rank challenge overview. In: Proceedings of the Learning to Rank Challenge, pp. 1\u201324. PMLR (2011)"},{"key":"7_CR9","unstructured":"Che, T., et al.: Fast federated machine unlearning with nonlinear functional theory. In: International Conference on Machine Learning, pp. 4241\u20134268. PMLR (2023)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Chen, M., Zhang, Z., Wang, T., Backes, M., Humbert, M., Zhang, Y.: When machine unlearning jeopardizes privacy. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 896\u2013911 (2021)","DOI":"10.1145\/3460120.3484756"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Chen, M., Zhang, Z., Wang, T., Backes, M., Humbert, M., Zhang, Y.: Graph unlearning. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, 7\u201311 November 2022, pp. 499\u2013513. ACM (2022). https:\/\/doi.org\/10.1145\/3548606.3559352","DOI":"10.1145\/3548606.3559352"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Chen, Y., Xiong, J., Xu, W., Zuo, J.: A novel online incremental and decremental learning algorithm based on variable support vector machine. Clust. Comput. 22(Supplement), 7435\u20137445 (2019)","DOI":"10.1007\/s10586-018-1772-4"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1109\/TIFS.2023.3265506","volume":"18","author":"VS Chundawat","year":"2023","unstructured":"Chundawat, V.S., Tarun, A.K., Mandal, M., Kankanhalli, M.: Zero-shot machine unlearning. IEEE Trans. Inf. Forensics Secur. 18, 2345\u20132354 (2023)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"7_CR14","unstructured":"Gao, X., et al.: VeriFi: towards verifiable federated unlearning. arXiv preprint arXiv:2205.12709 (2022)"},{"key":"7_CR15","unstructured":"Ginart, A., Guan, M.Y., Valiant, G., Zou, J.: Making AI forget you: data deletion in machine learning. In: Wallach, H.M., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E.B., Garnett, R. (eds.) Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, Vancouver, BC, Canada, 8\u201314 December 2019, pp. 3513\u20133526 (2019). https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/cb79f8fa58b91d3af6c9c991f63962d3-Abstract.html"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Guo, F., Liu, C., Wang, Y.M.: Efficient multiple-click models in web search. In: Proceedings of the second ACM International Conference on Web Search and Data Mining, pp. 124\u2013131 (2009)","DOI":"10.1145\/1498759.1498818"},{"key":"7_CR17","unstructured":"Halimi, A., Kadhe, S., Rawat, A., Baracaldo, N.: Federated unlearning: how to efficiently erase a client in FL? arXiv preprint arXiv:2207.05521 (2022)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Hofmann, K., Schuth, A., Whiteson, S., De Rijke, M.: Reusing historical interaction data for faster online learning to rank for IR. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 183\u2013192 (2013)","DOI":"10.1145\/2433396.2433419"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Hu, H., Salcic, Z., Dobbie, G., Chen, J., Sun, L., Zhang, X.: Membership inference via backdooring. In: The 31st International Joint Conference on Artificial Intelligence (IJCAI 2022) (2022)","DOI":"10.24963\/ijcai.2022\/532"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Jia, Y., Wang, H.: Learning neural ranking models online from implicit user feedback. In: Proceedings of the ACM Web Conference 2022, pp. 431\u2013441 (2022)","DOI":"10.1145\/3485447.3512250"},{"key":"7_CR21","unstructured":"Kairouz, P., et al.: Advances and open problems in federated learning. Found. Trends\u00ae Mach. Learn. 14(1\u20132), 1\u2013210 (2021)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Kharitonov, E.: Federated online learning to rank with evolution strategies. In: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, pp. 249\u2013257 (2019)","DOI":"10.1145\/3289600.3290968"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Liu, G., Ma, X., Yang, Y., Wang, C., Liu, J.: FedEraser: enabling efficient client-level data removal from federated learning models. In: 2021 IEEE\/ACM 29th International Symposium on Quality of Service (IWQOS), pp. 1\u201310. IEEE (2021)","DOI":"10.1109\/IWQOS52092.2021.9521274"},{"key":"7_CR24","unstructured":"Liu, Y., Ma, Z., Liu, X., Ma, J.: Learn to forget: user-level memorization elimination in federated learning. CoRR abs\/2003.10933 (2020). https:\/\/arxiv.org\/abs\/2003.10933"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Liu, Y., Xu, L., Yuan, X., Wang, C., Li, B.: The right to be forgotten in federated learning: an efficient realization with rapid retraining. In: IEEE INFOCOM 2022 - IEEE Conference on Computer Communications, London, United Kingdom, 2\u20135 May 2022, pp. 1749\u20131758. IEEE (2022). https:\/\/doi.org\/10.1109\/INFOCOM48880.2022.9796721","DOI":"10.1109\/INFOCOM48880.2022.9796721"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Lucchese, C., Nardini, F.M., Orlando, S., Perego, R., Silvestri, F., Trani, S.: Post-learning optimization of tree ensembles for efficient ranking. In: Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, pp. 949\u2013952 (2016)","DOI":"10.1145\/2911451.2914763"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"de Magalh\u00e3es, S.T.: The European union\u2019s general data protection regulation (GDPR). In: Cyber Security Practitioner\u2019s Guide, pp. 529\u2013558. World Scientific (2020)","DOI":"10.1142\/9789811204463_0015"},{"key":"7_CR28","unstructured":"Mahadevan, A., Mathioudakis, M.: Certifiable machine unlearning for linear models. arXiv preprint arXiv:2106.15093 (2021)"},{"key":"7_CR29","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., Arcas, B.A.: Communication-efficient learning of deep networks from decentralized data. In: Artificial Intelligence and Statistics, pp. 1273\u20131282. PMLR (2017)"},{"key":"7_CR30","unstructured":"Nguyen, T.T., Huynh, T.T., Nguyen, P.L., Liew, A.W.C., Yin, H., Nguyen, Q.V.H.: A survey of machine unlearning. arXiv preprint arXiv:2209.02299 (2022)"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Oosterhuis, H., de Rijke, M.: Differentiable unbiased online learning to rank. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pp. 1293\u20131302 (2018)","DOI":"10.1145\/3269206.3271686"},{"key":"7_CR32","unstructured":"Qin, T., Liu, T.Y.: Introducing LETOR 4.0 datasets. arXiv preprint arXiv:1306.2597 (2013)"},{"key":"7_CR33","unstructured":"Salimans, T., Ho, J., Chen, X., Sidor, S., Sutskever, I.: Evolution strategies as a scalable alternative to reinforcement learning. arXiv preprint arXiv:1703.03864 (2017)"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Schuth, A., Oosterhuis, H., Whiteson, S., de Rijke, M.: Multileave gradient descent for fast online learning to rank. In: Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, pp. 457\u2013466 (2016)","DOI":"10.1145\/2835776.2835804"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Shokri, R., Stronati, M., Song, C., Shmatikov, V.: Membership inference attacks against machine learning models. In: 2017 IEEE Symposium on Security and Privacy (SP), pp. 3\u201318. IEEE (2017)","DOI":"10.1109\/SP.2017.41"},{"key":"7_CR36","unstructured":"Sommer, D.M., Song, L., Wagh, S., Mittal, P.: Towards probabilistic verification of machine unlearning. arXiv preprint arXiv:2003.04247 (2020)"},{"key":"7_CR37","doi-asserted-by":"publisher","first-page":"268","DOI":"10.56553\/popets-2022-0072","volume":"3","author":"DM Sommer","year":"2022","unstructured":"Sommer, D.M., Song, L., Wagh, S., Mittal, P.: Athena: probabilistic verification of machine unlearning. Proc. Priv. Enhancing Technol. 3, 268\u2013290 (2022)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Wang, H., Kim, S., McCord-Snook, E., Wu, Q., Wang, H.: Variance reduction in gradient exploration for online learning to rank. In: Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 835\u2013844 (2019)","DOI":"10.1145\/3331184.3331264"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Wang, H., Langley, R., Kim, S., McCord-Snook, E., Wang, H.: Efficient exploration of gradient space for online learning to rank. In: The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, pp. 145\u2013154 (2018)","DOI":"10.1145\/3209978.3210045"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Wang, J., Guo, S., Xie, X., Qi, H.: Federated unlearning via class-discriminative pruning. In: Proceedings of the ACM Web Conference 2022, pp. 622\u2013632 (2022)","DOI":"10.1145\/3485447.3512222"},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"Wang, S., Liu, B., Zhuang, S., Zuccon, G.: Effective and privacy-preserving federated online learning to rank. In: Proceedings of the 2021 ACM SIGIR International Conference on Theory of Information Retrieval, pp. 3\u201312 (2021)","DOI":"10.1145\/3471158.3472236"},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Wang, S., Zhuang, S., Zuccon, G.: Federated online learning to rank with evolution strategies: a reproducibility study. In: European Conference on Information Retrieval (2021)","DOI":"10.1007\/978-3-030-72240-1_10"},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Wang, S., Zuccon, G.: Is non-IID data a threat in federated online learning to rank? In: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 2801\u20132813 (2022)","DOI":"10.1145\/3477495.3531709"},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Wang, S., Zuccon, G.: An analysis of untargeted poisoning attack and defense methods for federated online learning to rank systems. In: Proceedings of the 2023 ACM SIGIR International Conference on Theory of Information Retrieval, pp. 215\u2013224 (2023)","DOI":"10.1145\/3578337.3605117"},{"key":"7_CR45","unstructured":"Wu, C., Zhu, S., Mitra, P.: Federated unlearning with knowledge distillation. arXiv preprint arXiv:2201.09441 (2022)"},{"key":"7_CR46","doi-asserted-by":"crossref","unstructured":"Yuan, W., Yin, H., Wu, F., Zhang, S., He, T., Wang, H.: Federated unlearning for on-device recommendation. In: Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, pp. 393\u2013401 (2023)","DOI":"10.1145\/3539597.3570463"},{"key":"7_CR47","doi-asserted-by":"crossref","unstructured":"Yue, Y., Joachims, T.: Interactively optimizing information retrieval systems as a dueling bandits problem. In: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 1201\u20131208 (2009)","DOI":"10.1145\/1553374.1553527"},{"key":"7_CR48","doi-asserted-by":"crossref","unstructured":"Zhao, T., King, I.: Constructing reliable gradient exploration for online learning to rank. In: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, pp. 1643\u20131652 (2016)","DOI":"10.1145\/2983323.2983774"},{"issue":"4","key":"7_CR49","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/s10791-022-09413-y","volume":"25","author":"S Zhuang","year":"2022","unstructured":"Zhuang, S., Qiao, Z., Zuccon, G.: Reinforcement online learning to rank with unbiased reward shaping. Inf. Retr. J. 25(4), 386\u2013413 (2022)","journal-title":"Inf. Retr. J."},{"key":"7_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-45439-5_28","volume-title":"Advances in Information Retrieval","author":"S Zhuang","year":"2020","unstructured":"Zhuang, S., Zuccon, G.: Counterfactual online learning to rank. In: Jose, J.M., et al. (eds.) ECIR 2020, Part I. LNCS, vol. 12035, pp. 415\u2013430. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45439-5_28"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56063-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T08:48:26Z","timestamp":1711097306000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56063-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031560620","9783031560637"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56063-7_7","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":"23 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECIR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"24 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecir2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ecir2024.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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"578","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":"110","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":"69","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":"19% - 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","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","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31 (Tracks: Workshop, Tutorial, Industry, Doctoral Consortium)","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)"}}]}}