{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T20:59:02Z","timestamp":1768597142718,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T00:00:00Z","timestamp":1530057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1553568,IIS-1618948"],"award-info":[{"award-number":["IIS-1553568,IIS-1618948"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,27]]},"DOI":"10.1145\/3209978.3210045","type":"proceedings-article","created":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T12:12:40Z","timestamp":1530533560000},"page":"145-154","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Efficient Exploration of Gradient Space for Online Learning to Rank"],"prefix":"10.1145","author":[{"given":"Huazheng","family":"Wang","sequence":"first","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]},{"given":"Ramsey","family":"Langley","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]},{"given":"Sonwoo","family":"Kim","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]},{"given":"Eric","family":"McCord-Snook","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]},{"given":"Hongning","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,6,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings., 36th Annual Symposium on. IEEE, 322--331","author":"Auer Peter","year":"1995","unstructured":"Peter Auer , Nicolo Cesa-Bianchi , Yoav Freund , and Robert E Schapire . 1995 . Gambling in a rigged casino: The adversarial multi-armed bandit problem Foundations of Computer Science, 1995 . Proceedings., 36th Annual Symposium on. IEEE, 322--331 . Peter Auer, Nicolo Cesa-Bianchi, Yoav Freund, and Robert E Schapire . 1995. Gambling in a rigged casino: The adversarial multi-armed bandit problem Foundations of Computer Science, 1995. Proceedings., 36th Annual Symposium on. IEEE, 322--331."},{"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 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_1_4_1","volume-title":"Proceedings of the Learning to Rank Challenge. 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. 1--24 . Olivier Chapelle and Yi Chang . 2011. Yahoo! learning to rank challenge overview. In Proceedings of the Learning to Rank Challenge. 1--24."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526711"},{"key":"e_1_3_2_1_6_1","volume-title":"Adam Tauman Kalai, and H Brendan McMahan","author":"Flaxman Abraham D","year":"2005","unstructured":"Abraham D Flaxman , Adam Tauman Kalai, and H Brendan McMahan . 2005 . Online convex optimization in the bandit setting: gradient descent without a gradient Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 385--394. Abraham D Flaxman, Adam Tauman Kalai, and H Brendan McMahan . 2005. Online convex optimization in the bandit setting: gradient descent without a gradient Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 385--394."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498818"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433419"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9197-9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130332.3130334"},{"key":"e_1_3_2_1_12_1","unstructured":"Sumeet Katariya Branislav Kveton Csaba Szepesvari and Zheng Wen . 2016. DCM bandits: Learning to rank with multiple clicks International Conference on Machine Learning. 1215--1224.   Sumeet Katariya Branislav Kveton Csaba Szepesvari and Zheng Wen . 2016. DCM bandits: Learning to rank with multiple clicks International Conference on Machine Learning. 1215--1224."},{"key":"e_1_3_2_1_13_1","volume-title":"Cascading bandits: Learning to rank in the cascade model Proceedings of the 32nd International Conference on Machine Learning (ICML-15). 767--776","author":"Kveton Branislav","unstructured":"Branislav Kveton , Csaba Szepesvari , Zheng Wen , and Azin Ashkan . 2015. Cascading bandits: Learning to rank in the cascade model Proceedings of the 32nd International Conference on Machine Learning (ICML-15). 767--776 . Branislav Kveton, Csaba Szepesvari, Zheng Wen, and Azin Ashkan . 2015. Cascading bandits: Learning to rank in the cascade model Proceedings of the 32nd International Conference on Machine Learning (ICML-15). 767--776."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553449"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390221"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_1_17_1","volume-title":"Letor: Benchmark dataset for research on learning to rank for information retrieval Proceedings of SIGIR 2007 workshop on learning to rank for information retrieval","author":"Liu Tie-Yan","year":"2007","unstructured":"Tie-Yan Liu , Jun Xu , Tao Qin , Wenying Xiong , and Hang Li . 2007 . Letor: Benchmark dataset for research on learning to rank for information retrieval Proceedings of SIGIR 2007 workshop on learning to rank for information retrieval , Vol. Vol. 310 . Tie-Yan Liu, Jun Xu, Tao Qin, Wenying Xiong, and Hang Li . 2007. Letor: Benchmark dataset for research on learning to rank for information retrieval Proceedings of SIGIR 2007 workshop on learning to rank for information retrieval, Vol. Vol. 310."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132896"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390255"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458092"},{"key":"e_1_3_2_1_21_1","volume-title":"mbox","author":"Mark Sanderson","year":"2010","unstructured":"Mark Sanderson et al mbox . . 2010 . Test collection based evaluation of information retrieval systems. Foundations and Trends\u00ae in Information Retrieval , Vol. 4 , 4 (2010), 247--375. Mark Sanderson et almbox. . 2010. Test collection based evaluation of information retrieval systems. Foundations and Trends\u00ae in Information Retrieval, Vol. 4, 4 (2010), 247--375."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2513150.2513162"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835804"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661952"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2502595"},{"key":"e_1_3_2_1_26_1","volume-title":"et almbox","author":"Voorhees Ellen M","year":"2005","unstructured":"Ellen M Voorhees , Donna K Harman , et almbox . . 2005 . TREC : Experiment and evaluation in information retrieval. Vol. Vol. 1 . MIT press Cambridge . Ellen M Voorhees, Donna K Harman, et almbox. . 2005. TREC: Experiment and evaluation in information retrieval. Vol. Vol. 1. MIT press Cambridge."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609607"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.12.028"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553527"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983774"},{"key":"e_1_3_2_1_31_1","unstructured":"Masrour Zoghi Tomas Tunys Mohammad Ghavamzadeh Branislav Kveton Csaba Szepesvari and Zheng Wen . 2017. Online Learning to Rank in Stochastic Click Models International Conference on Machine Learning. 4199--4208.  Masrour Zoghi Tomas Tunys Mohammad Ghavamzadeh Branislav Kveton Csaba Szepesvari and Zheng Wen . 2017. Online Learning to Rank in Stochastic Click Models International Conference on Machine Learning. 4199--4208."}],"event":{"name":"SIGIR '18: The 41st International ACM SIGIR conference on research and development in Information Retrieval","location":"Ann Arbor MI USA","acronym":"SIGIR '18","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209978.3210045","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209978.3210045","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209978.3210045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:49Z","timestamp":1750212469000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209978.3210045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,27]]},"references-count":31,"alternative-id":["10.1145\/3209978.3210045","10.1145\/3209978"],"URL":"https:\/\/doi.org\/10.1145\/3209978.3210045","relation":{},"subject":[],"published":{"date-parts":[[2018,6,27]]},"assertion":[{"value":"2018-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}