{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:32:39Z","timestamp":1773246759416,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T00:00:00Z","timestamp":1579478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,1,20]]},"DOI":"10.1145\/3336191.3371814","type":"proceedings-article","created":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T19:08:16Z","timestamp":1579720096000},"page":"798-806","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Listwise Learning to Rank by Exploring Unique Ratings"],"prefix":"10.1145","author":[{"given":"Xiaofeng","family":"Zhu","sequence":"first","affiliation":[{"name":"Northwestern University, Evanston, IL, USA"}]},{"given":"Diego","family":"Klabjan","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209985"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341981.3344218"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2018.8489646"},{"key":"e_1_3_2_2_4_1","volume-title":"Discrimination or Ranking? arXiv preprint arXiv:1606.06959","author":"Barber David","year":"2016","unstructured":"David Barber and Aleksandar Botev . 2016. Dealing with a large number of classes--Likelihood , Discrimination or Ranking? arXiv preprint arXiv:1606.06959 ( 2016 ). David Barber and Aleksandar Botev. 2016. Dealing with a large number of classes--Likelihood, Discrimination or Ranking? arXiv preprint arXiv:1606.06959 (2016)."},{"key":"e_1_3_2_2_5_1","volume-title":"Xiyang Luo, Alan Mackey, and Ofer Meshi.","author":"Bello Irwan","year":"2018","unstructured":"Irwan Bello , Sayali Kulkarni , Sagar Jain , Craig Boutilier , Ed Chi, Elad Eban , Xiyang Luo, Alan Mackey, and Ofer Meshi. 2018 . Seq2Slate: re-ranking and Slate Optimization with RNNs . arXiv preprint arXiv:1810.02019 (2018). Irwan Bello, Sayali Kulkarni, Sagar Jain, Craig Boutilier, Ed Chi, Elad Eban, Xiyang Luo, Alan Mackey, and Ofer Meshi. 2018. Seq2Slate: re-ranking and Slate Optimization with RNNs. arXiv preprint arXiv:1810.02019 (2018)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331347"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646033"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_2_2_12_1","volume-title":"Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling. arXiv preprint arXiv:1412.3555","author":"Chung Junyoung","year":"2014","unstructured":"Junyoung Chung , Caglar Gulcehre , KyungHyun Cho , and Yoshua Bengio . 2014. Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling. arXiv preprint arXiv:1412.3555 ( 2014 ). Junyoung Chung, Caglar Gulcehre, KyungHyun Cho, and Yoshua Bengio. 2014. Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling. arXiv preprint arXiv:1412.3555 (2014)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209979"},{"key":"e_1_3_2_2_14_1","first-page":"933","article-title":"An Efficient Boosting Algorithm for Combining Preferences","author":"Freund Yoav","year":"2003","unstructured":"Yoav Freund , Raj Iyer , Robert E Schapire , and Yoram Singer . 2003 . An Efficient Boosting Algorithm for Combining Preferences . Journal of Machine Learning Research 4 , Nov (2003), 933 -- 969 . Yoav Freund, Raj Iyer, Robert E Schapire, and Yoram Singer. 2003. An Efficient Boosting Algorithm for Combining Preferences. Journal of Machine Learning Research 4, Nov (2003), 933--969.","journal-title":"Journal of Machine Learning Research 4"},{"key":"e_1_3_2_2_15_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_16_1","volume-title":"Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining (WSDM '19)","author":"Gallagher Luke","unstructured":"Luke Gallagher , Ruey-Cheng Chen , Roi Blanco , and J. Shane Culpepper . 2019. Joint Optimization of Cascade Ranking Models . In Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining (WSDM '19) . ACM, New York, NY, USA, 15--23. Luke Gallagher, Ruey-Cheng Chen, Roi Blanco, and J. Shane Culpepper. 2019. Joint Optimization of Cascade Ranking Models. In Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining (WSDM '19). ACM, New York, NY, USA, 15--23."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553423"},{"key":"e_1_3_2_2_18_1","volume-title":"A deep look into neural ranking models for information retrieval. arXiv preprint arXiv:1903.06902","author":"Guo Jiafeng","year":"2019","unstructured":"Jiafeng Guo , Yixing Fan , Liang Pang , Liu Yang , Qingyao Ai , Hamed Zamani , Chen Wu , W Bruce Croft , and Xueqi Cheng . 2019. A deep look into neural ranking models for information retrieval. arXiv preprint arXiv:1903.06902 ( 2019 ). Jiafeng Guo, Yixing Fan, Liang Pang, Liu Yang, Qingyao Ai, Hamed Zamani, Chen Wu, W Bruce Croft, and Xueqi Cheng. 2019. A deep look into neural ranking models for information retrieval. arXiv preprint arXiv:1903.06902 (2019)."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330658"},{"key":"e_1_3_2_2_20_1","volume-title":"Large Margin Rank Boundaries for Ordinal Regression. Advances in Neural Information Processing Systems","author":"Herbrich Ralf","year":"1999","unstructured":"Ralf Herbrich , Thore Graepel , and Klaus Obermayer . 1999. Large Margin Rank Boundaries for Ordinal Regression. Advances in Neural Information Processing Systems ( 1999 ), 115--132. Ralf Herbrich, Thore Graepel, and Klaus Obermayer. 1999. Large Margin Rank Boundaries for Ordinal Regression. Advances in Neural Information Processing Systems (1999), 115--132."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"e_1_3_2_2_22_1","volume-title":"Unbiased LambdaMART: An Unbiased Pairwise Learning-to-Rank Algorithm. In The World Wide Web Conference. ACM, 2830--2836","author":"Hu Ziniu","year":"2019","unstructured":"Ziniu Hu , Yang Wang , Qu Peng , and Hang Li . 2019 . Unbiased LambdaMART: An Unbiased Pairwise Learning-to-Rank Algorithm. In The World Wide Web Conference. ACM, 2830--2836 . Ziniu Hu, Yang Wang, Qu Peng, and Hang Li. 2019. Unbiased LambdaMART: An Unbiased Pairwise Learning-to-Rank Algorithm. In The World Wide Web Conference. ACM, 2830--2836."},{"key":"e_1_3_2_2_23_1","volume-title":"Modeling Label Ambiguity for Neural List-wise Learning to Rank. arXiv preprint arXiv:1707.07493","author":"Jagerman Rolf","year":"2017","unstructured":"Rolf Jagerman , Julia Kiseleva , and Maarten de Rijke . 2017. Modeling Label Ambiguity for Neural List-wise Learning to Rank. arXiv preprint arXiv:1707.07493 ( 2017 ). Rolf Jagerman, Julia Kiseleva, and Maarten de Rijke. 2017. Modeling Label Ambiguity for Neural List-wise Learning to Rank. arXiv preprint arXiv:1707.07493 (2017)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_2_25_1","volume-title":"Beyond Greedy Ranking: Slate Optimization via List-CVAE. arXiv preprint arXiv:1803.01682","author":"Jiang Ray","year":"2018","unstructured":"Ray Jiang , Sven Gowal , Timothy A Mann , and Danilo J Rezende . 2018. Beyond Greedy Ranking: Slate Optimization via List-CVAE. arXiv preprint arXiv:1803.01682 ( 2018 ). Ray Jiang, Sven Gowal, Timothy A Mann, and Danilo J Rezende. 2018. Beyond Greedy Ranking: Slate Optimization via List-CVAE. arXiv preprint arXiv:1803.01682 (2018)."},{"key":"e_1_3_2_2_26_1","unstructured":"Guolin Ke Qi Meng Thomas Finley Taifeng Wang Wei Chen Weidong Ma Qiwei Ye and Tie-Yan Liu. 2017. LightGBM: a highly Efficient Gradient Boosting Decision Tree. In Advances in Neural Information Processing Systems. 3146--3154. Guolin Ke Qi Meng Thomas Finley Taifeng Wang Wei Chen Weidong Ma Qiwei Ye and Tie-Yan Liu. 2017. LightGBM: a highly Efficient Gradient Boosting Decision Tree. In Advances in Neural Information Processing Systems. 3146--3154."},{"key":"e_1_3_2_2_27_1","volume-title":"Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence. 449--458","author":"Lan Yanyan","year":"2014","unstructured":"Yanyan Lan , Yadong Zhu , Jiafeng Guo , Shuzi Niu , and Xueqi Cheng . 2014 . Position-Aware ListMLE: a Sequential Learning Process for Ranking . In Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence. 449--458 . Yanyan Lan, Yadong Zhu, Jiafeng Guo, Shuzi Niu, and Xueqi Cheng. 2014. Position-Aware ListMLE: a Sequential Learning Process for Ranking. In Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence. 449--458."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Ling Li and Hsuan-Tien Lin. 2007. Ordinal Regression by Extended Binary Classification. In Advances in Neural Information Processing Systems. 865--872. Ling Li and Hsuan-Tien Lin. 2007. Ordinal Regression by Extended Binary Classification. In Advances in Neural Information Processing Systems. 865--872.","DOI":"10.7551\/mitpress\/7503.003.0113"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330676"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91458-9_11"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_2_32_1","volume-title":"Individual choice behavior: a theoretical analysis","author":"Luce R Duncan","unstructured":"R Duncan Luce . 2012. Individual choice behavior: a theoretical analysis . Courier Corporation . R Duncan Luce. 2012. Individual choice behavior: a theoretical analysis. Courier Corporation."},{"key":"e_1_3_2_2_34_1","volume-title":"Stochastic Top-k Listnet. arXiv preprint arXiv:1511.00271","author":"Luo Tianyi","year":"2015","unstructured":"Tianyi Luo , DongWang, Rong Liu , and Yiqiao Pan . 2015. Stochastic Top-k Listnet. arXiv preprint arXiv:1511.00271 ( 2015 ). Tianyi Luo, DongWang, Rong Liu, and Yiqiao Pan. 2015. Stochastic Top-k Listnet. arXiv preprint arXiv:1511.00271 (2015)."},{"key":"e_1_3_2_2_35_1","unstructured":"Qi Meng Guolin Ke Taifeng Wang Wei Chen Qiwei Ye Zhi-Ming Ma and Tie-Yan Liu. 2016. A communication-efficient Parallel Algorithm for Decision Tree. In Advances in Neural Information Processing Systems. 1279--1287. Qi Meng Guolin Ke Taifeng Wang Wei Chen Qiwei Ye Zhi-Ming Ma and Tie-Yan Liu. 2016. A communication-efficient Parallel Algorithm for Decision Tree. In Advances in Neural Information Processing Systems. 1279--1287."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398681"},{"key":"e_1_3_2_2_37_1","volume-title":"Ranking for Relevance and Display Preferences in Complex Presentation Layouts. arXiv preprint arXiv:1805.02404","author":"Oosterhuis Harrie","year":"2018","unstructured":"Harrie Oosterhuis and Maarten de Rijke . 2018. Ranking for Relevance and Display Preferences in Complex Presentation Layouts. arXiv preprint arXiv:1805.02404 ( 2018 ). Harrie Oosterhuis and Maarten de Rijke. 2018. Ranking for Relevance and Display Preferences in Complex Presentation Layouts. arXiv preprint arXiv:1805.02404 (2018)."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132914"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Rama Kumar Pasumarthi Xuanhui Wang Cheng Li Sebastian Bruch Michael Bendersky Marc Najork Jan Pfeifer Nadav Golbandi Rohan Anil and Stephan Wolf. 2018. TF-Ranking: Scalable TensorFlow Library for Learning-to-Rank. (2018). Rama Kumar Pasumarthi Xuanhui Wang Cheng Li Sebastian Bruch Michael Bendersky Marc Najork Jan Pfeifer Nadav Golbandi Rohan Anil and Stephan Wolf. 2018. TF-Ranking: Scalable TensorFlow Library for Learning-to-Rank. (2018).","DOI":"10.1145\/3292500.3330677"},{"key":"e_1_3_2_2_40_1","volume-title":"The Analysis of Permutations. Applied Statistics","author":"Plackett Robin L","year":"1975","unstructured":"Robin L Plackett . 1975. The Analysis of Permutations. Applied Statistics ( 1975 ), 193--202. Robin L Plackett. 1975. The Analysis of Permutations. Applied Statistics (1975), 193--202."},{"key":"e_1_3_2_2_41_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_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9123-y"},{"key":"e_1_3_2_2_43_1","first-page":"193","article-title":"Learning to Rank with Nonsmooth Cost Functions","volume":"19","author":"Quoc C","year":"2007","unstructured":"C Quoc and Viet Le . 2007 . Learning to Rank with Nonsmooth Cost Functions . Proceedings of the Advances in Neural Information Processing Systems 19 (2007), 193 -- 200 . C Quoc and Viet Le. 2007. Learning to Rank with Nonsmooth Cost Functions. Proceedings of the Advances in Neural Information Processing Systems 19 (2007), 193--200.","journal-title":"Proceedings of the Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_44_1","volume-title":"NIPS Workshop on Advances in Ranking. 58--63","author":"Sculley D","year":"2009","unstructured":"D Sculley . 2009 . Large scale Learning to Rank . In NIPS Workshop on Advances in Ranking. 58--63 . D Sculley. 2009. Large scale Learning to Rank. In NIPS Workshop on Advances in Ranking. 58--63."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341544"},{"key":"e_1_3_2_2_46_1","volume-title":"Proceedings of the 27th ACM International Conference on Information and Knowledge Management. ACM, 1313--1322","author":"Li Cheng","year":"2018","unstructured":"XuanhuiWang, Cheng Li , Nadav Golbandi , Michael Bendersky , and Marc Najork . 2018 . The Lambdaloss Framework for Ranking Metric Optimization . In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. ACM, 1313--1322 . XuanhuiWang, Cheng Li, Nadav Golbandi, Michael Bendersky, and Marc Najork. 2018. The Lambdaloss Framework for Ranking Metric Optimization. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. ACM, 1313--1322."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080685"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3234944.3234977"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390382"}],"event":{"name":"WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining","location":"Houston TX USA","acronym":"WSDM '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 13th International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3336191.3371814","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3336191.3371814","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:14Z","timestamp":1750202594000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3336191.3371814"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,20]]},"references-count":48,"alternative-id":["10.1145\/3336191.3371814","10.1145\/3336191"],"URL":"https:\/\/doi.org\/10.1145\/3336191.3371814","relation":{},"subject":[],"published":{"date-parts":[[2020,1,20]]},"assertion":[{"value":"2020-01-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}