{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T23:43:26Z","timestamp":1774309406961,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T00:00:00Z","timestamp":1539734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Netherlands Organisation for Scientific Research (NWO)","award":["612.001.551"],"award-info":[{"award-number":["612.001.551"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,17]]},"DOI":"10.1145\/3269206.3271686","type":"proceedings-article","created":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T12:08:27Z","timestamp":1540210107000},"page":"1293-1302","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":67,"title":["Differentiable Unbiased Online Learning to Rank"],"prefix":"10.1145","author":[{"given":"Harrie","family":"Oosterhuis","sequence":"first","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]},{"given":"Maarten","family":"de Rijke","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"James Allan Ben Carterette Javed A. Aslam Virgil Pavlu Blagovest Dachev and Evangelos Kanoulas. 2007. Million query track 2007 overview. In TREC. NIST.  James Allan Ben Carterette Javed A. Aslam Virgil Pavlu Blagovest Dachev and Evangelos Kanoulas. 2007. Million query track 2007 overview. In TREC. NIST.","DOI":"10.21236\/ADA477388"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_4_1","first-page":"1","article-title":"Yahoo! Learning to Rank Challenge Overview","volume":"14","author":"Chapelle Olivier","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-013-0258-9"},{"key":"e_1_3_2_1_6_1","volume-title":"Click Models for Web Search","author":"Chuklin Aleksandr"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987380"},{"key":"e_1_3_2_1_8_1","volume-title":"The web changes everything: Understanding and supporting people in dynamic information environments","author":"Dumais Susan T."},{"key":"e_1_3_2_1_9_1","unstructured":"Xavier Glorot and Yoshua Bengio. 2010. Understanding the difficulty of training deep feedforward neural networks. In AISTATS. 249--256.  Xavier Glorot and Yoshua Bengio. 2010. Understanding the difficulty of training deep feedforward neural networks. In AISTATS. 249--256."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498818"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646293"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433419"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","volume-title":"Balancing Exploration and Exploitation in Learning to Rank Online","author":"Hofmann Katja","DOI":"10.1007\/978-3-642-20161-5_25"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063618"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9197-9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2508063"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080838"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661947"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781601982452"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132896"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132895"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","volume-title":"Probabilistic Multileave Gradient Descent","author":"Oosterhuis Harrie","DOI":"10.1007\/978-3-319-30671-1_50"},{"key":"e_1_3_2_1_26_1","volume-title":"Monte Carlo theory, methods and examples. Monte Carlo Theory, Methods and Examples. Art Owen","author":"Owen Art B.","year":"2013"},{"key":"e_1_3_2_1_27_1","volume-title":"arXiv preprint arXiv:1306.2597","author":"Qin Tao","year":"2013"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3020165.3020183"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390255"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458092"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000009"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767838"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835804"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661952"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2502595"},{"key":"e_1_3_2_1_36_1","unstructured":"Bal\u00e1zs Sz\u00f6r\u00e9nyi R\u00f3bert Busa-Fekete Adil Paul and Eyke H\u00fcllermeier. 2015. Online rank elicitation for Plackett-Luce: A dueling bandits approach. In NIPS. 604--612.   Bal\u00e1zs Sz\u00f6r\u00e9nyi R\u00f3bert Busa-Fekete Adil Paul and Eyke H\u00fcllermeier. 2015. Online rank elicitation for Plackett-Luce: A dueling bandits approach. In NIPS. 604--612."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1108\/EUM0000000007127"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911537"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553527"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772793"},{"key":"e_1_3_2_1_41_1","unstructured":"Masrour Zoghi Tom\u00e1? Tunys Mohammad Ghavamzadeh Branislav Kveton Csaba Szepesvari and Zheng Wen. 2017. Online Learning to Rank in Stochastic Click Models. In ICML. 4199--4208.  Masrour Zoghi Tom\u00e1? Tunys Mohammad Ghavamzadeh Branislav Kveton Csaba Szepesvari and Zheng Wen. 2017. Online Learning to Rank in Stochastic Click Models. In ICML. 4199--4208."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556256"}],"event":{"name":"CIKM '18: The 27th ACM International Conference on Information and Knowledge Management","location":"Torino Italy","acronym":"CIKM '18","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 27th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3271686","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3269206.3271686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:44:22Z","timestamp":1750207462000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3271686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,17]]},"references-count":40,"alternative-id":["10.1145\/3269206.3271686","10.1145\/3269206"],"URL":"https:\/\/doi.org\/10.1145\/3269206.3271686","relation":{},"subject":[],"published":{"date-parts":[[2018,10,17]]},"assertion":[{"value":"2018-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}