{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T20:47:55Z","timestamp":1730321275190,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T00:00:00Z","timestamp":1563408000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation Grant","award":["IS-1553568","IIS-1618948"]},{"name":"Bloomberg Data Science","award":["Ph.D. Fellowship"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,18]]},"DOI":"10.1145\/3331184.3331264","type":"proceedings-article","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T17:40:26Z","timestamp":1563558026000},"page":"835-844","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Variance Reduction in Gradient Exploration for Online Learning to Rank"],"prefix":"10.1145","author":[{"given":"Huazheng","family":"Wang","sequence":"first","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":"Qingyun","family":"Wu","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":[[2019,7,18]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"23","article-title":"From ranknet to lambdarank to lambdamart: An overview","volume":"11","author":"Burges Christopher J. C.","year":"2010","unstructured":"Christopher J. C. Burges . 2010 . From ranknet to lambdarank to lambdamart: An overview . Learning , Vol. 11 , 23 -- 581 (2010), 81. Christopher J. C. Burges. 2010. From ranknet to lambdarank to lambdamart: An overview. Learning, Vol. 11, 23--581 (2010), 81.","journal-title":"Learning"},{"volume-title":"Proceedings of the Learning to Rank Challenge. 1--24","year":"2011","author":"Chapelle Olivier","key":"e_1_3_2_2_2_1","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_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526711"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"volume-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 385--394","year":"2005","author":"Flaxman Abraham D.","key":"e_1_3_2_2_5_1","unstructured":"Abraham D. Flaxman , Adam Tauman Kalai , and H. Brendan McMahan . 2005 . Online convex optimization in the bandit setting: gradient descent without a gradient . In 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. In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 385--394."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2914798"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433419"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063618"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130332.3130334"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_2_11_1","volume-title":"Proceedings of SIGIR 2007 workshop on learning to rank for information retrieval","volume":"310","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 . In Proceedings of SIGIR 2007 workshop on learning to rank for information retrieval , 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. In Proceedings of SIGIR 2007 workshop on learning to rank for information retrieval, Vol. 310."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132896"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271686"},{"key":"e_1_3_2_2_14_1","unstructured":"Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 Datasets. arxiv: cs.IR\/1306.2597 Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 Datasets. arxiv: cs.IR\/1306.2597"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458092"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2513150.2513162"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835804"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661952"},{"volume-title":"TREC: Experiment and evaluation in information retrieval.","year":"2005","author":"Voorhees Ellen M.","key":"e_1_3_2_2_19_1","unstructured":"Ellen M. Voorhees , Donna K. Harman , 2005 . TREC: Experiment and evaluation in information retrieval. Vol. 1 . MIT press Cambridge . Ellen M. Voorhees, Donna K. Harman, et al. 2005. TREC: Experiment and evaluation in information retrieval. Vol. 1. MIT press Cambridge."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210045"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911537"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.12.028"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835534"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553527"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983774"}],"event":{"name":"SIGIR '19: The 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Paris France","acronym":"SIGIR '19"},"container-title":["Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3331184.3331264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T21:06:21Z","timestamp":1673125581000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3331184.3331264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,18]]},"references-count":25,"alternative-id":["10.1145\/3331184.3331264","10.1145\/3331184"],"URL":"https:\/\/doi.org\/10.1145\/3331184.3331264","relation":{},"subject":[],"published":{"date-parts":[[2019,7,18]]},"assertion":[{"value":"2019-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}