{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T23:42:56Z","timestamp":1774309376082,"version":"3.50.1"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030454388","type":"print"},{"value":"9783030454395","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-45439-5_28","type":"book-chapter","created":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:02:50Z","timestamp":1586577770000},"page":"415-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Counterfactual Online Learning to Rank"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6711-0955","authenticated-orcid":false,"given":"Shengyao","family":"Zhuang","sequence":"first","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":[[2020,4,8]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Allan, J., Carterette, B., Aslam, J.A., Pavlu, V., Dachev, B., Kanoulas, E.: Million query track 2007 overview. In: TREC Proceedings (2007)","DOI":"10.21236\/ADA477388"},{"issue":"6","key":"28_CR2","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/3209581","volume":"61","author":"R Baeza-Yates","year":"2018","unstructured":"Baeza-Yates, R.: Bias on the web. Commun. ACM 61(6), 54\u201361 (2018)","journal-title":"Commun. ACM"},{"issue":"1","key":"28_CR3","first-page":"3207","volume":"14","author":"L Bottou","year":"2013","unstructured":"Bottou, L., et al.: Counterfactual reasoning and learning systems: the example of computational advertising. J. Mach. Learn. Res. 14(1), 3207\u20133260 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.Y., Tsai, M.F., Li, H.: Learning to rank: from pairwise approach to listwise approach. In: Proceedings of the 24th International Conference on Machine Learning, pp. 129\u2013136. ACM (2007)","DOI":"10.1145\/1273496.1273513"},{"key":"28_CR5","unstructured":"Chapelle, O., Chang, Y.: Yahoo! learning to rank challenge overview. In: Proceedings of the Learning to Rank Challenge, pp. 1\u201324 (2011)"},{"issue":"3","key":"28_CR6","first-page":"1","volume":"7","author":"A Chuklin","year":"2015","unstructured":"Chuklin, A., Markov, I., Rijke, M.D.: Click models for web search. Synth. Lect. Inf. Concepts Retrieval Serv. 7(3), 1\u2013115 (2015)","journal-title":"Synth. Lect. Inf. Concepts Retrieval Serv."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Guan, Z., Cutrell, E.: An eye tracking study of the effect of target rank on web search. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI 2007, pp. 417\u2013420. ACM, New York (2007)","DOI":"10.1145\/1240624.1240691"},{"key":"28_CR8","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. ACM (2009)","DOI":"10.1145\/1498759.1498818"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"He, J., Zhai, C., Li, X.: Evaluation of methods for relative comparison of retrieval systems based on clickthroughs. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, pp. 2029\u20132032. ACM (2009)","DOI":"10.1145\/1645953.1646293"},{"key":"28_CR10","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. ACM (2013)","DOI":"10.1145\/2433396.2433419"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-20161-5_25","volume-title":"Advances in Information Retrieval","author":"K Hofmann","year":"2011","unstructured":"Hofmann, K., Whiteson, S., de Rijke, M.: Balancing exploration and exploitation in learning to rank online. In: Clough, P., et al. (eds.) ECIR 2011. LNCS, vol. 6611, pp. 251\u2013263. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20161-5_25"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Hofmann, K., Whiteson, S., De Rijke, M.: A probabilistic method for inferring preferences from clicks. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, pp. 249\u2013258. ACM (2011)","DOI":"10.1145\/2063576.2063618"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Hofmann, K., et al.: Fast and reliable online learning to rank for information retrieval. In: SIGIR Forum, vol. 47, p. 140 (2013)","DOI":"10.1145\/2568388.2568413"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Jagerman, R., Oosterhuis, H., de Rijke, M.: To model or to intervene: a comparison of counterfactual and online learning to rank from user interactions. In: Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2019, pp. 15\u201324. Association for Computing Machinery (2019)","DOI":"10.1145\/3331184.3331269"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 133\u2013142. ACM (2002)","DOI":"10.1145\/775047.775067"},{"key":"28_CR16","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1145\/1076034.1076063","volume":"5","author":"T Joachims","year":"2005","unstructured":"Joachims, T., Granka, L.A., Pan, B., Hembrooke, H., Gay, G.: Accurately interpreting clickthrough data as implicit feedback. SIGIR 5, 154\u2013161 (2005)","journal-title":"SIGIR"},{"key":"28_CR17","unstructured":"Joachims, T., Swaminathan, A., de Rijke, M.: Deep learning with logged bandit feedback. In: The Sixth International Conference on Learning Representations (ICLR) (2018)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Joachims, T., Swaminathan, A., Schnabel, T.: Unbiased learning-to-rank with biased feedback. In: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, pp. 781\u2013789. ACM (2017)","DOI":"10.1145\/3018661.3018699"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Lefortier, D., Serdyukov, P., De Rijke, M.: Online exploration for detecting shifts in fresh intent. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 589\u2013598. ACM (2014)","DOI":"10.1145\/2661829.2661947"},{"issue":"3","key":"28_CR20","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"TY Liu","year":"2009","unstructured":"Liu, T.Y., et al.: Learning to rank for information retrieval. Found. Trends Inf. Retrieval 3(3), 225\u2013331 (2009)","journal-title":"Found. Trends Inf. Retrieval"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Oosterhuis, H., de Rijke, M.: Balancing speed and quality in online learning to rank for information retrieval. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 277\u2013286. ACM (2017)","DOI":"10.1145\/3132847.3132896"},{"key":"28_CR22","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. ACM (2018)","DOI":"10.1145\/3269206.3271686"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/978-3-319-30671-1_50","volume-title":"Advances in Information Retrieval","author":"H Oosterhuis","year":"2016","unstructured":"Oosterhuis, H., Schuth, A., de Rijke, M.: Probabilistic multileave gradient descent. In: Ferro, N., et al. (eds.) ECIR 2016. LNCS, vol. 9626, pp. 661\u2013668. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30671-1_50"},{"issue":"3","key":"28_CR24","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1111\/j.1083-6101.2007.00351.x","volume":"12","author":"B Pan","year":"2007","unstructured":"Pan, B., Hembrooke, H., Joachims, T., Lorigo, L., Gay, G., Granka, L.: In google we trust: users\u2019 decisions on rank, position, and relevance. J. Comput.-Mediat. Commun. 12(3), 801\u2013823 (2007)","journal-title":"J. Comput.-Mediat. Commun."},{"key":"28_CR25","unstructured":"Qin, T., Liu, T.Y.: Introducing LETOR 4.0 datasets. arXiv preprint arXiv:1306.2597 (2013)"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Radlinski, F., Kurup, M., Joachims, T.: How does clickthrough data reflect retrieval quality? In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 43\u201352. ACM (2008)","DOI":"10.1145\/1458082.1458092"},{"key":"28_CR27","doi-asserted-by":"publisher","DOI":"10.1002\/9781118631980","volume-title":"Simulation and the Monte Carlo Method","author":"RY Rubinstein","year":"2016","unstructured":"Rubinstein, R.Y., Kroese, D.P.: Simulation and the Monte Carlo Method, vol. 10. Wiley, Hoboken (2016)"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"Schuth, A., et al.: Probabilistic multileave for online retrieval evaluation. In: Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 955\u2013958. ACM (2015)","DOI":"10.1145\/2766462.2767838"},{"key":"28_CR29","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. ACM (2016)","DOI":"10.1145\/2835776.2835804"},{"key":"28_CR30","doi-asserted-by":"crossref","unstructured":"Schuth, A., Sietsma, F., Whiteson, S., Lefortier, D., de Rijke, M.: Multileaved comparisons for fast online evaluation. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 71\u201380. ACM (2014)","DOI":"10.1145\/2661829.2661952"},{"key":"28_CR31","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2011","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (2011)"},{"issue":"1","key":"28_CR32","first-page":"1731","volume":"16","author":"A Swaminathan","year":"2015","unstructured":"Swaminathan, A., Joachims, T.: Batch learning from logged bandit feedback through counterfactual risk minimization. J. Mach. Learn. Res. 16(1), 1731\u20131755 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"28_CR33","doi-asserted-by":"crossref","unstructured":"Swaminathan, A., Joachims, T.: Counterfactual risk minimization: learning from logged bandit feedback. In: International Conference on Machine Learning, pp. 814\u2013823 (2015)","DOI":"10.1145\/2740908.2742564"},{"key":"28_CR34","unstructured":"Swaminathan, A., Joachims, T.: The self-normalized estimator for counterfactual learning. In: Advances in Neural Information Processing Systems, pp. 3231\u20133239 (2015)"},{"key":"28_CR35","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, SIGIR 2019 (2019)","DOI":"10.1145\/3331184.3331264"},{"key":"28_CR36","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. ACM (2018)","DOI":"10.1145\/3209978.3210045"},{"key":"28_CR37","doi-asserted-by":"crossref","unstructured":"Wang, X., Bendersky, M., Metzler, D., Najork, M.: Learning to rank with selection bias in personal search. In: Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, pp. 115\u2013124. ACM (2016)","DOI":"10.1145\/2911451.2911537"},{"key":"28_CR38","doi-asserted-by":"crossref","unstructured":"Wang, X., Golbandi, N., Bendersky, M., Metzler, D., Najork, M.: Position bias estimation for unbiased learning to rank in personal search. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pp. 610\u2013618. ACM (2018)","DOI":"10.1145\/3159652.3159732"},{"key":"28_CR39","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. ACM (2009)","DOI":"10.1145\/1553374.1553527"},{"key":"28_CR40","doi-asserted-by":"crossref","unstructured":"Yue, Y., Patel, R., Roehrig, H.: Beyond position bias: examining result attractiveness as a source of presentation bias in clickthrough data. In: Proceedings of the 19th International Conference on World Wide Web, pp. 1011\u20131018. ACM (2010)","DOI":"10.1145\/1772690.1772793"},{"key":"28_CR41","doi-asserted-by":"crossref","unstructured":"Zoghi, M., Whiteson, S.A., De Rijke, M., Munos, R.: Relative confidence sampling for efficient on-line ranker evaluation. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining, pp. 73\u201382. ACM (2014)","DOI":"10.1145\/2556195.2556256"}],"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-030-45439-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T19:16:09Z","timestamp":1710357369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-45439-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030454388","9783030454395"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45439-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 April 2020","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":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecir2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecir2020.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":"457","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":"55","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":"46","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":"12% - 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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Also included: 8 reproducibility papers, 10 demonstration papers, 12 CLEF organizers lab track papers, 7 doctoral consortium papers, 4 workshops, 3 tutorials. Due to the COVID-19 pandemic, this conference was held virtually.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}