{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:01Z","timestamp":1750220401787,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T00:00:00Z","timestamp":1644537600000},"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":[[2022,2,11]]},"DOI":"10.1145\/3488560.3498401","type":"proceedings-article","created":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T21:42:57Z","timestamp":1644961377000},"page":"1036-1044","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning-To-Ensemble by Contextual Rank Aggregation in E-Commerce"],"prefix":"10.1145","author":[{"given":"Xuesi","family":"Wang","sequence":"first","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"given":"Guangda","family":"Huzhang","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"given":"Qianying","family":"Lin","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"given":"Qing","family":"Da","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2022,2,15]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412704"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412713"},{"key":"e_1_3_2_2_3_1","volume-title":"Deepfm: A factorization-machine based neural network for ctr prediction. arXiv preprint arXiv:1703.04247","author":"Guo Huifeng","year":"2017","unstructured":"Huifeng Guo, Ruiming Tang, Yunming Ye, Zhenguo Li, and Xiuqiang He. Deepfm: A factorization-machine based neural network for ctr prediction. arXiv preprint arXiv:1703.04247, 2017."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3124749.3124754"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210104"},{"key":"e_1_3_2_2_6_1","volume-title":"Aliexpress learningto- rank: Maximizing online model performance without going online. arXiv preprint arXiv:2003.11941","author":"Huzhang Guangda","year":"2020","unstructured":"Guangda Huzhang, Zhen-Jia Pang, Yongqing Gao, Yawen Liu,Weijie Shen,Wen-Ji Zhou, Qing Da, An-Xiang Zeng, Han Yu, Yang Yu, et al. Aliexpress learningto- rank: Maximizing online model performance without going online. arXiv preprint arXiv:2003.11941, 2020."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959176"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1125451.1125659"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2532508.2532511"},{"key":"e_1_3_2_2_10_1","volume-title":"Recogym: A reinforcement learning environment for the problem of product recommendation in online advertising. arXiv preprint arXiv:1808.00720","author":"Rohde David","year":"2018","unstructured":"David Rohde, Stephen Bonner, Travis Dunlop, Flavian Vasile, and Alexandros Karatzoglou. Recogym: A reinforcement learning environment for the problem of product recommendation in online advertising. arXiv preprint arXiv:1808.00720, 2018."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3327345.3327465"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412245"},{"key":"e_1_3_2_2_13_1","first-page":"722","volume-title":"Uncertainty in Artificial Intelligence","author":"Hiranandani Gaurush","year":"2020","unstructured":"Gaurush Hiranandani, Harvineet Singh, Prakhar Gupta, Iftikhar Ahamath Burhanuddin, Zheng Wen, and Branislav Kveton. Cascading linear submodular bandits: Accounting for position bias and diversity in online learning to rank. In Uncertainty in Artificial Intelligence, pages 722--732. PMLR, 2020."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972894.4"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372165"},{"key":"e_1_3_2_2_16_1","unstructured":"JC de Borda. M\u00e9moire sur les \u00e9lections au scrutin. Histoire de l'Academie Royale des Sciences pour 1781 (Paris 1784) 1784."},{"key":"e_1_3_2_2_17_1","volume-title":"Multivariate spearman's rho for aggregating ranks using copulas. arXiv preprint arXiv:1410.4391","author":"Bedo Justin","year":"2014","unstructured":"Justin Bedo and Cheng Soon Ong. Multivariate spearman's rho for aggregating ranks using copulas. arXiv preprint arXiv:1410.4391, 2014."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.07.020"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_2_22_1","volume-title":"From ranknet to lambdarank to lambdamart: An overview. Learning, 11(23--581):81","author":"Burges Christopher JC","year":"2010","unstructured":"Christopher JC Burges. From ranknet to lambdarank to lambdamart: An overview. Learning, 11(23--581):81, 2010."},{"key":"e_1_3_2_2_23_1","unstructured":"Laurent Meunier Herilalaina Rakotoarison Pak Kan Wong Baptiste Roziere Jeremy Rapin Olivier Teytaud Antoine Moreau and Carola Doerr. Black-box optimization revisited: Improving algorithm selection wizards through massive benchmarking. arXiv preprint arXiv:2010.04542 2020."},{"key":"e_1_3_2_2_24_1","first-page":"525","volume-title":"Proceedings of the genetic and evolutionary computation conference GECCO-99","volume":"1","author":"Pelikan Martin","year":"1999","unstructured":"Martin Pelikan, David E Goldberg, Erick Cant\u00fa-Paz, et al. Boa: The bayesian optimization algorithm. In Proceedings of the genetic and evolutionary computation conference GECCO-99, volume 1, pages 525--532. Citeseer, 1999."},{"key":"e_1_3_2_2_25_1","volume-title":"Practical bayesian optimization of machine learning algorithms. arXiv preprint arXiv:1206.2944","author":"Snoek Jasper","year":"2012","unstructured":"Jasper Snoek, Hugo Larochelle, and Ryan P Adams. Practical bayesian optimization of machine learning algorithms. arXiv preprint arXiv:1206.2944, 2012."},{"key":"e_1_3_2_2_26_1","first-page":"1166","volume-title":"International Conference on Machine Learning","author":"Duvenaud David","year":"2013","unstructured":"David Duvenaud, James Lloyd, Roger Grosse, Joshua Tenenbaum, and Ghahramani Zoubin. Structure discovery in nonparametric regression through compositional kernel search. In International Conference on Machine Learning, pages 1166--1174. PMLR, 2013."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"e_1_3_2_2_28_1","first-page":"2171","volume-title":"International Conference on Machine Learning","author":"Snoek Jasper","year":"2015","unstructured":"Jasper Snoek, Oren Rippel, Kevin Swersky, Ryan Kiros, Nadathur Satish, Narayanan Sundaram, Mostofa Patwary, Mr Prabhat, and Ryan Adams. Scalable bayesian optimization using deep neural networks. In International Conference on Machine Learning, pages 2171--2180. PMLR, 2015."},{"key":"e_1_3_2_2_29_1","volume-title":"Cobbo: Coordinate backoff bayesian optimization. arXiv preprint arXiv:2101.05147","author":"Tan Jian","year":"2021","unstructured":"Jian Tan, Niv Nayman, Mengchang Wang, Feifei Li, and Rong Jin. Cobbo: Coordinate backoff bayesian optimization. arXiv preprint arXiv:2101.05147, 2021."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12292"},{"key":"e_1_3_2_2_31_1","volume-title":"AIIDE","author":"Chaslot Guillaume","year":"2008","unstructured":"Guillaume Chaslot, Sander Bakkes, Istvan Szita, and Pieter Spronck. Monte-carlo tree search: A new framework for game ai. In AIIDE, 2008."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i06.6546"},{"key":"e_1_3_2_2_33_1","volume-title":"Learning search space partition for black-box optimization using monte carlo tree search. arXiv preprint arXiv:2007.00708","author":"Wang Linnan","year":"2020","unstructured":"Linnan Wang, Rodrigo Fonseca, and Yuandong Tian. Learning search space partition for black-box optimization using monte carlo tree search. arXiv preprint arXiv:2007.00708, 2020."},{"key":"e_1_3_2_2_34_1","volume-title":"Ranking tournaments: Local search and a new algorithm. Journal of Experimental Algorithmics (JEA), 14:2--6","author":"Coleman Tom","year":"2010","unstructured":"Tom Coleman and Anthony Wirth. Ranking tournaments: Local search and a new algorithm. Journal of Experimental Algorithmics (JEA), 14:2--6, 2010."},{"key":"e_1_3_2_2_35_1","volume-title":"Exploration by random network distillation. arXiv preprint arXiv:1810.12894","author":"Burda Yuri","year":"2018","unstructured":"Yuri Burda, Harrison Edwards, Amos Storkey, and Oleg Klimov. Exploration by random network distillation. arXiv preprint arXiv:1810.12894, 2018."},{"key":"e_1_3_2_2_36_1","first-page":"450","volume-title":"Artificial Intelligence and Statistics","author":"Li Pan","year":"2017","unstructured":"Pan Li, Arya Mazumdar, and Olgica Milenkovic. Efficient rank aggregation via lehmer codes. In Artificial Intelligence and Statistics, pages 450--459. PMLR, 2017."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018699"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347033"}],"event":{"name":"WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining","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"],"location":"Virtual Event AZ USA","acronym":"WSDM '22"},"container-title":["Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488560.3498401","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488560.3498401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:51Z","timestamp":1750191531000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488560.3498401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,11]]},"references-count":38,"alternative-id":["10.1145\/3488560.3498401","10.1145\/3488560"],"URL":"https:\/\/doi.org\/10.1145\/3488560.3498401","relation":{},"subject":[],"published":{"date-parts":[[2022,2,11]]},"assertion":[{"value":"2022-02-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}