{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T11:19:59Z","timestamp":1772191199194,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":63,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the School of Computing University of Utah"},{"name":"Amazon Search"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,6]]},"DOI":"10.1145\/3477495.3531948","type":"proceedings-article","created":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T15:12:08Z","timestamp":1657206728000},"page":"6-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Can Clicks Be Both Labels and Features?"],"prefix":"10.1145","author":[{"given":"Tao","family":"Yang","sequence":"first","affiliation":[{"name":"University of Utah, Salt Lake City, UT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Luo","sequence":"additional","affiliation":[{"name":"Amazon Search, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanqing","family":"Lu","sequence":"additional","affiliation":[{"name":"Amazon Search, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Parth","family":"Gupta","sequence":"additional","affiliation":[{"name":"Amazon Search, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Yin","sequence":"additional","affiliation":[{"name":"Amazon Search, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingyao","family":"Ai","sequence":"additional","affiliation":[{"name":"University of Utah, Salt Lake City, UT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,7]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331202"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313697"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148177"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209985"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209986"},{"key":"e_1_3_2_2_6_1","volume-title":"Proceedings of the 27th ACM International Conference on Information and Knowledge Management. 2305--2306","author":"Ai Qingyao","year":"2018","unstructured":"Qingyao Ai , Jiaxin Mao , Yiqun Liu , and W Bruce Croft . 2018 c. Unbiased learning to rank: Theory and practice . In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. 2305--2306 . Qingyao Ai, Jiaxin Mao, Yiqun Liu, and W Bruce Croft. 2018c. Unbiased learning to rank: Theory and practice. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. 2305--2306."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3439861"},{"key":"e_1_3_2_2_8_1","first-page":"397","article-title":"Using confidence bounds for exploitation-exploration trade-offs","volume":"3","author":"Auer Peter","year":"2002","unstructured":"Peter Auer . 2002 . Using confidence bounds for exploitation-exploration trade-offs . Journal of Machine Learning Research , Vol. 3 , Nov (2002), 397 -- 422 . Peter Auer. 2002. Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research, Vol. 3, Nov (2002), 397--422.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_9_1","volume-title":"A Distribution-Free Upper Confidence Bound Based on Independent Samples of X and Y. The Annals of Mathematical Statistics","author":"Birnbaum ZW","year":"1958","unstructured":"ZW Birnbaum and RC McCarty . 1958. A Distribution-Free Upper Confidence Bound Based on Independent Samples of X and Y. The Annals of Mathematical Statistics ( 1958 ), 558--562. ZW Birnbaum and RC McCarty. 1958. A Distribution-Free Upper Confidence Bound Based on Independent Samples of X and Y. The Annals of Mathematical Statistics (1958), 558--562."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/511793.511818"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_2_12_1","first-page":"23","article-title":"From ranknet to lambdarank to lambdamart: An overview","volume":"11","author":"Burges Christopher JC","year":"2010","unstructured":"Christopher JC Burges . 2010 . From ranknet to lambdarank to lambdamart: An overview . Learning , Vol. 11 , 23 -- 581 (2010), 81. Christopher JC Burges. 2010. From ranknet to lambdarank to lambdamart: An overview. Learning, Vol. 11, 23--581 (2010), 81.","journal-title":"Learning"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24412-4_17"},{"key":"e_1_3_2_2_14_1","volume-title":"Proceedings of the learning to rank challenge. PMLR, 1--24","author":"Chapelle Olivier","year":"2011","unstructured":"Olivier Chapelle and Yi Chang . 2011 . Yahoo! learning to rank challenge overview . In Proceedings of the learning to rank challenge. PMLR, 1--24 . Olivier Chapelle and Yi Chang. 2011. Yahoo! learning to rank challenge overview. In Proceedings of the learning to rank challenge. PMLR, 1--24."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_2_2_16_1","volume-title":"Model uncertainty. Statistical science","author":"Clyde Merlise","year":"2004","unstructured":"Merlise Clyde and Edward I George . 2004. Model uncertainty. Statistical science , Vol. 19 , 1 ( 2004 ), 81--94. Merlise Clyde and Edward I George. 2004. Model uncertainty. Statistical science, Vol. 19, 1 (2004), 81--94."},{"key":"e_1_3_2_2_17_1","volume-title":"Not All Relevance Scores are Equal: Efficient Uncertainty and Calibration Modeling for Deep Retrieval Models. arXiv preprint arXiv:2105.04651","author":"Cohen Daniel","year":"2021","unstructured":"Daniel Cohen , Bhaskar Mitra , Oleg Lesota , Navid Rekabsaz , and Carsten Eickhoff . 2021. Not All Relevance Scores are Equal: Efficient Uncertainty and Calibration Modeling for Deep Retrieval Models. arXiv preprint arXiv:2105.04651 ( 2021 ). Daniel Cohen, Bhaskar Mitra, Oleg Lesota, Navid Rekabsaz, and Carsten Eickhoff. 2021. Not All Relevance Scores are Equal: Efficient Uncertainty and Calibration Modeling for Deep Retrieval Models. arXiv preprint arXiv:2105.04651 (2021)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3015022.3015026"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987380"},{"key":"e_1_3_2_2_21_1","volume-title":"Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805","author":"Devlin Jacob","year":"2018","unstructured":"Jacob Devlin , Ming-Wei Chang , Kenton Lee , and Kristina Toutanova . 2018 . Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018). Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2018. Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1995.tb02015.x"},{"key":"e_1_3_2_2_24_1","volume-title":"Multiple regression and the analysis of variance and covariance","author":"Edwards Allen L","unstructured":"Allen L Edwards . 1985. Multiple regression and the analysis of variance and covariance . WH Freeman\/Times Books\/Henry Holt & Co. Allen L Edwards. 1985. Multiple regression and the analysis of variance and covariance. WH Freeman\/Times Books\/Henry Holt & Co."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080714"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-019-09366-9"},{"key":"e_1_3_2_2_27_1","volume-title":"Greedy function approximation: a gradient boosting machine. Annals of statistics","author":"Friedman Jerome H","year":"2001","unstructured":"Jerome H Friedman . 2001. Greedy function approximation: a gradient boosting machine. Annals of statistics ( 2001 ), 1189--1232. Jerome H Friedman. 2001. Greedy function approximation: a gradient boosting machine. Annals of statistics (2001), 1189--1232."},{"key":"e_1_3_2_2_28_1","volume-title":"international conference on machine learning. PMLR, 1050--1059","author":"Gal Yarin","year":"2016","unstructured":"Yarin Gal and Zoubin Ghahramani . 2016 . Dropout as a bayesian approximation: Representing model uncertainty in deep learning . In international conference on machine learning. PMLR, 1050--1059 . Yarin Gal and Zoubin Ghahramani. 2016. Dropout as a bayesian approximation: Representing model uncertainty in deep learning. In international conference on machine learning. PMLR, 1050--1059."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2050345.2050365"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2019.102067"},{"key":"e_1_3_2_2_31_1","volume-title":"Treating Cold Start in Product Search by Priors","author":"Gupta Parth","unstructured":"Parth Gupta , Tommaso Dreossi , Jan Bakus , Yu-Hsiang Lin , and Vamsi Salaka . 2020. Treating Cold Start in Product Search by Priors . Association for Computing Machinery , New York, NY, USA , 77--78. https:\/\/doi.org\/10.1145\/3366424.3382705 10.1145\/3366424.3382705 Parth Gupta, Tommaso Dreossi, Jan Bakus, Yu-Hsiang Lin, and Vamsi Salaka. 2020. Treating Cold Start in Product Search by Priors. Association for Computing Machinery, New York, NY, USA, 77--78. https:\/\/doi.org\/10.1145\/3366424.3382705"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9197-9"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130332.3130334"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018699"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341981.3344234"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398691"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271686"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401102"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441794"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380255"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.eacl-main.12"},{"key":"e_1_3_2_2_43_1","volume-title":"arXiv preprint arXiv:1306.2597","author":"Qin Tao","year":"2013","unstructured":"Tao Qin and Tie-Yan Liu . 2013. Introducing LETOR 4.0 datasets. arXiv preprint arXiv:1306.2597 ( 2013 ). Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 datasets. arXiv preprint arXiv:1306.2597 (2013)."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9123-y"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2099-5_24"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3121050.3121087"},{"key":"e_1_3_2_2_47_1","unstructured":"Mohd Sami. [n. d.]. Upper Confidence Bound Algorithm in Reinforcement Learning. sl https:\/\/www.geeksforgeeks.org\/upper-confidence-bound-algorithm-in-reinforcement-learning\/.  Mohd Sami. [n. d.]. Upper Confidence Bound Algorithm in Reinforcement Learning. sl https:\/\/www.geeksforgeeks.org\/upper-confidence-bound-algorithm-in-reinforcement-learning\/."},{"key":"e_1_3_2_2_48_1","volume-title":"Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval. 955--958","author":"Schuth Anne","unstructured":"Anne Schuth , Robert-Jan Bruintjes , Fritjof Bu\u00fcttner , Joost van Doorn , Carla Groenland , Harrie Oosterhuis , Cong-Nguyen Tran , Bas Veeling , Jos van der Velde, Roger Wechsler, et almbox. 2015. Probabilistic multileave for online retrieval evaluation . In Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval. 955--958 . Anne Schuth, Robert-Jan Bruintjes, Fritjof Bu\u00fcttner, Joost van Doorn, Carla Groenland, Harrie Oosterhuis, Cong-Nguyen Tran, Bas Veeling, Jos van der Velde, Roger Wechsler, et almbox. 2015. Probabilistic multileave for online retrieval evaluation. In Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval. 955--958."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835804"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2180868.2180873"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321528"},{"key":"e_1_3_2_2_52_1","volume-title":"Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research","author":"Srivastava Nitish","year":"2014","unstructured":"Nitish Srivastava , Geoffrey Hinton , Alex Krizhevsky , Ilya Sutskever , and Ruslan Salakhutdinov . 2014. Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research , Vol. 15 , 1 ( 2014 ), 1929--1958. Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014. Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research, Vol. 15, 1 (2014), 1929--1958."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482020"},{"key":"e_1_3_2_2_54_1","volume-title":"Rifat Ozcan, and Ozgur Ulusoy.","author":"Usta Arif","year":"2021","unstructured":"Arif Usta , Ismail Sengor Altingovde , Rifat Ozcan, and Ozgur Ulusoy. 2021 . Learning to Rank for Educational Search Engines. IEEE Transactions on Learning Technologies ( 2021). Arif Usta, Ismail Sengor Altingovde, Rifat Ozcan, and Ozgur Ulusoy. 2021. Learning to Rank for Educational Search Engines. IEEE Transactions on Learning Technologies (2021)."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412031"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462810"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331264"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210045"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911537"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484053"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45886-7_7"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412128"},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553527"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00958-7_5"}],"event":{"name":"SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Madrid Spain","acronym":"SIGIR '22","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477495.3531948","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477495.3531948","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:19Z","timestamp":1750183819000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477495.3531948"}},"subtitle":["Unbiased Behavior Feature Collection and Uncertainty-aware Learning to Rank"],"short-title":[],"issued":{"date-parts":[[2022,7,6]]},"references-count":63,"alternative-id":["10.1145\/3477495.3531948","10.1145\/3477495"],"URL":"https:\/\/doi.org\/10.1145\/3477495.3531948","relation":{},"subject":[],"published":{"date-parts":[[2022,7,6]]},"assertion":[{"value":"2022-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}