{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T21:07:00Z","timestamp":1761599220125,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T00:00:00Z","timestamp":1618790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,4,19]]},"DOI":"10.1145\/3442381.3449972","type":"proceedings-article","created":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T19:37:45Z","timestamp":1622749065000},"page":"146-157","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["PairRank: Online Pairwise Learning to Rank by Divide-and-Conquer"],"prefix":"10.1145","author":[{"given":"Yiling","family":"Jia","sequence":"first","affiliation":[{"name":"University of Virginia, USA"}]},{"given":"Huazheng","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Virginia, USA"}]},{"given":"Stephen","family":"Guo","sequence":"additional","affiliation":[{"name":"WalmartLabs, USA"}]},{"given":"Hongning","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Virginia, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Yasin Abbasi-Yadkori D\u00e1vid P\u00e1l and Csaba Szepesv\u00e1ri. 2011. Improved algorithms for linear stochastic bandits. In NIPS. 2312\u20132320.  Yasin Abbasi-Yadkori D\u00e1vid P\u00e1l and Csaba Szepesv\u00e1ri. 2011. Improved algorithms for linear stochastic bandits. In NIPS. 2312\u20132320."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148177"},{"key":"e_1_3_2_1_3_1","first-page":"23","article-title":"From ranknet to lambdarank to lambdamart: An overview","volume":"11","author":"Burges JC","year":"2010","unstructured":"Christopher\u00a0 JC Burges . 2010 . From ranknet to lambdarank to lambdamart: An overview . Learning 11 , 23 - 581 (2010), 81. Christopher\u00a0JC Burges. 2010. From ranknet to lambdarank to lambdamart: An overview. Learning 11, 23-581 (2010), 81.","journal-title":"Learning"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458348"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the Learning to Rank Challenge. 1\u201324","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. 1\u201324 . Olivier Chapelle and Yi Chang. 2011. Yahoo! learning to rank challenge overview. In Proceedings of the Learning to Rank Challenge. 1\u201324."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2094072.2094078"},{"key":"e_1_3_2_1_7_1","unstructured":"Sarah Filippi Olivier Cappe Aur\u00e9lien Garivier and Csaba Szepesv\u00e1ri. 2010. Parametric bandits: The generalized linear case. In NIPS. 586\u2013594.  Sarah Filippi Olivier Cappe Aur\u00e9lien Garivier and Csaba Szepesv\u00e1ri. 2010. Parametric bandits: The generalized linear case. In NIPS. 586\u2013594."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526712"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498818"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Ralf Herbrich Thore Graepel and Klaus Obermayer. 1999. Support vector learning for ordinal regression. (1999).  Ralf Herbrich Thore Graepel and Klaus Obermayer. 1999. Support vector learning for ordinal regression. (1999).","DOI":"10.1049\/cp:19991091"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398516"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9197-9"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076063"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229179.1229181"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018699"},{"key":"e_1_3_2_1_17_1","unstructured":"Sumeet Katariya Branislav Kveton Csaba Szepesvari and Zheng Wen. 2016. DCM bandits: Learning to rank with multiple clicks. In ICML. 1215\u20131224.  Sumeet Katariya Branislav Kveton Csaba Szepesvari and Zheng Wen. 2016. DCM bandits: Learning to rank with multiple clicks. In ICML. 1215\u20131224."},{"key":"e_1_3_2_1_18_1","volume-title":"Bubblerank: Safe online learning to rerank. arXiv preprint arXiv:1806.05819(2018).","author":"Kveton Branislav","year":"2018","unstructured":"Branislav Kveton , Chang Li , Tor Lattimore , Ilya Markov , Maarten de Rijke , Csaba Szepesvari , and Masrour Zoghi . 2018 . Bubblerank: Safe online learning to rerank. arXiv preprint arXiv:1806.05819(2018). Branislav Kveton, Chang Li, Tor Lattimore, Ilya Markov, Maarten de Rijke, Csaba Szepesvari, and Masrour Zoghi. 2018. Bubblerank: Safe online learning to rerank. arXiv preprint arXiv:1806.05819(2018)."},{"key":"e_1_3_2_1_19_1","unstructured":"Branislav Kveton Csaba Szepesvari Zheng Wen and Azin Ashkan. 2015. Cascading bandits: Learning to rank in the cascade model. In ICML. 767\u2013776.  Branislav Kveton Csaba Szepesvari Zheng Wen and Azin Ashkan. 2015. Cascading bandits: Learning to rank in the cascade model. In ICML. 767\u2013776."},{"key":"e_1_3_2_1_20_1","unstructured":"Branislav Kveton Zheng Wen Azin Ashkan and Csaba Szepesvari. 2015. Combinatorial cascading bandits. In NIPS. 1450\u20131458.  Branislav Kveton Zheng Wen Azin Ashkan and Csaba Szepesvari. 2015. Combinatorial cascading bandits. In NIPS. 1450\u20131458."},{"key":"e_1_3_2_1_21_1","unstructured":"Branislav Kveton Zheng Wen Azin Ashkan and Csaba Szepesvari. 2015. Tight regret bounds for stochastic combinatorial semi-bandits. In Artificial Intelligence and Statistics. 535\u2013543.  Branislav Kveton Zheng Wen Azin Ashkan and Csaba Szepesvari. 2015. Tight regret bounds for stochastic combinatorial semi-bandits. In Artificial Intelligence and Statistics. 535\u2013543."},{"key":"e_1_3_2_1_22_1","volume-title":"Toprank: A practical algorithm for online stochastic ranking. In NIPS. 3945\u20133954.","author":"Lattimore Tor","year":"2018","unstructured":"Tor Lattimore , Branislav Kveton , Shuai Li , and Csaba Szepesvari . 2018 . Toprank: A practical algorithm for online stochastic ranking. In NIPS. 3945\u20133954. Tor Lattimore, Branislav Kveton, Shuai Li, and Csaba Szepesvari. 2018. Toprank: A practical algorithm for online stochastic ranking. In NIPS. 3945\u20133954."},{"key":"e_1_3_2_1_23_1","unstructured":"Shuai Li Tor Lattimore and Csaba Szepesv\u00e1ri. 2018. Online learning to rank with features. arXiv preprint arXiv:1810.02567(2018).  Shuai Li Tor Lattimore and Csaba Szepesv\u00e1ri. 2018. Online learning to rank with features. arXiv preprint arXiv:1810.02567(2018)."},{"key":"e_1_3_2_1_24_1","unstructured":"Shuai Li Baoxiang Wang Shengyu Zhang and Wei Chen. 2016. Contextual Combinatorial Cascading Bandits.. In ICML Vol.\u00a016. 1245\u20131253.  Shuai Li Baoxiang Wang Shengyu Zhang and Wei Chen. 2016. Contextual Combinatorial Cascading Bandits.. In ICML Vol.\u00a016. 1245\u20131253."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132896"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271686"},{"key":"e_1_3_2_1_27_1","unstructured":"Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 Datasets. arxiv:1306.2597\u00a0[cs.IR]  Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 Datasets. arxiv:1306.2597\u00a0[cs.IR]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Filip Radlinski Robert Kleinberg and Thorsten Joachims. 2008. Learning diverse rankings with multi-armed bandits. In ICML. 784\u2013791.  Filip Radlinski Robert Kleinberg and Thorsten Joachims. 2008. Learning diverse rankings with multi-armed bandits. In ICML. 784\u2013791.","DOI":"10.1145\/1390156.1390255"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835804"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661952"},{"key":"e_1_3_2_1_31_1","unstructured":"Roman Vershynin. 2010. Introduction to the non-asymptotic analysis of random matrices. arXiv preprint arXiv:1011.3027(2010).  Roman Vershynin. 2010. Introduction to the non-asymptotic analysis of random matrices. arXiv preprint arXiv:1011.3027(2010)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331264"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210045"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Xuanhui Wang Cheng Li Nadav Golbandi Michael Bendersky and Marc Najork. 2018. The LambdaLoss Framework for Ranking Metric Optimization. In CIKM \u201918. ACM 1313\u20131322.  Xuanhui Wang Cheng Li Nadav Golbandi Michael Bendersky and Marc Najork. 2018. The LambdaLoss Framework for Ranking Metric Optimization. In CIKM \u201918. ACM 1313\u20131322.","DOI":"10.1145\/3269206.3271784"},{"key":"e_1_3_2_1_35_1","unstructured":"Yisong Yue and Thorsten Joachims. 2009. Interactively optimizing information retrieval systems as a dueling bandits problem. In ICML. 1201\u20131208.  Yisong Yue and Thorsten Joachims. 2009. Interactively optimizing information retrieval systems as a dueling bandits problem. In ICML. 1201\u20131208."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983774"},{"key":"e_1_3_2_1_37_1","unstructured":"Dongruo Zhou Lihong Li and Quanquan Gu. 2019. Neural Contextual Bandits with UCB-based Exploration. arXiv preprint arXiv:1911.04462(2019).  Dongruo Zhou Lihong Li and Quanquan Gu. 2019. Neural Contextual Bandits with UCB-based Exploration. arXiv preprint arXiv:1911.04462(2019)."},{"key":"e_1_3_2_1_38_1","volume-title":"ICML","author":"Zoghi Masrour","year":"2017","unstructured":"Masrour Zoghi , Tomas Tunys , Mohammad Ghavamzadeh , Branislav Kveton , Csaba Szepesvari , and Zheng Wen . 2017 . Online learning to rank in stochastic click models . In ICML 2017. 4199\u20134208. Masrour Zoghi, Tomas Tunys, Mohammad Ghavamzadeh, Branislav Kveton, Csaba Szepesvari, and Zheng Wen. 2017. Online learning to rank in stochastic click models. In ICML 2017. 4199\u20134208."}],"event":{"name":"WWW '21: The Web Conference 2021","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Ljubljana Slovenia","acronym":"WWW '21"},"container-title":["Proceedings of the Web Conference 2021"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3449972","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3442381.3449972","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:44Z","timestamp":1750195484000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3449972"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,19]]},"references-count":38,"alternative-id":["10.1145\/3442381.3449972","10.1145\/3442381"],"URL":"https:\/\/doi.org\/10.1145\/3442381.3449972","relation":{},"subject":[],"published":{"date-parts":[[2021,4,19]]},"assertion":[{"value":"2021-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}