Fetching the paper…
Reading the bibliography…
Ranking is at the core of many artificial intelligence (AI) applications, including search engines, recommender systems, etc.
Applied statistical decision theory
Howard Raiffa, Robert Schlaifer, et al · 1961
Earlier work this paper cites.
Handbook of mathematical functions with formulas, graphs, and mathematical tables . Vol. 55
Milton Abramowitz and Irene A Stegun. 1964 · 1964
Earlier work this paper cites.
Maximum likelihood from incomplete data via the EM algorithm
Arthur P Dempster, Nan M Laird, and Donald B Rubin. 1977 · 1977
Earlier work this paper cites.
Cumulated gain-based evaluation of IR techniques
Kalervo Järvelin and Jaana Kekäläinen. 2002 · 2002
Earlier work this paper cites.
Improving web search ranking by incorporating user behavior information. In Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval . 19–26
Eugene Agichtein, Eric Brill, and Susan Dumais. 2006 · 2006
Earlier work this paper cites.
A comparison of statistical significance tests for information retrieval evaluation. In Proceedings of the sixteenth ACM conference on Conference on information and knowledge management . 623–632
Mark D Smucker, James Allan, and Ben Carterette. 2007 · 2007
Earlier work this paper cites.
An experimental comparison of click position-bias models. In Proceedings of the 2008 international conference on web search and data mining . 87–94
Nick Craswell, Onno Zoeter, Michael Taylor, and Bill Ramsey. 2008 · 2008
Earlier work this paper cites.
Expected reciprocal rank for graded relevance. In Proceedings of the 18th ACM conference on Information and knowledge management . 621–630
Olivier Chapelle, Donald Metlzer, Ya Zhang, and Pierre Grinspan. 2009 · 2009
Earlier work this paper cites.
Smoothing clickthrough data for web search ranking. In Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval . 355–362
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, and Jian-Yun Nie. 2009 · 2009
Earlier work this paper cites.
Learning to rank for information retrieval
Tie-Yan Liu et al · 2009
Earlier work this paper cites.
Interactively optimizing information retrieval systems as a dueling bandits problem. In Proceedings of the 26th Annual International Conference on Machine Learning . 1201–1208
Yisong Yue and Thorsten Joachims. 2009 · 2009
Earlier work this paper cites.
Risk-aware information retrieval. In European Conference on Information Retrieval . Springer, 17–28
Jianhan Zhu, Jun Wang, Michael Taylor, and Ingemar J Cox. 2009 · 2009
Earlier work this paper cites.
LETOR: A benchmark collection for research on learning to rank for information retrieval
Tao Qin, Tie-Yan Liu, Jun Xu, and Hang Li. 2010 · 2010
Earlier work this paper cites.
Yahoo! learning to rank challenge overview. In Proceedings of the learning to rank challenge . PMLR, 1–24
Olivier Chapelle and Yi Chang. 2011 · 2011
Earlier work this paper cites.
On the usefulness of query features for learning to rank. In Proceedings of the 21st ACM international conference on Information and knowledge management . 2559–2562
Craig Macdonald, Rodrygo LT Santos, and Iadh Ounis. 2012 · 2012
Earlier work this paper cites.
Lerot: An online learning to rank framework. In Proceedings of the 2013 workshop on Living labs for information retrieval evaluation . 23–26
Anne Schuth, Katja Hofmann, Shimon Whiteson, and Maarten de Rijke. 2013 · 2013
Earlier work this paper cites.
Dynamic cutoff prediction in multi-stage retrieval systems. In Proceedings of the 21st Australasian Document Computing Symposium . 17–24
J Shane Culpepper, Charles LA Clarke, and Jimmy Lin. 2016 · 2016
Earlier work this paper cites.
Fast ranking with additive ensembles of oblivious and non-oblivious regression trees
Domenico Dato, Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando, Raffaele Perego, Nicola Tonellotto, and Rossano Venturini. 2016 · 2016
Cited alongside, same era.
Multileave gradient descent for fast online learning to rank. In Proceedings of the Ninth ACM International Conference on Web Search and Data Mining . 457–466
Anne Schuth, Harrie Oosterhuis, Shimon Whiteson, and Maarten de Rijke. 2016 · 2016
Cited alongside, same era.
Learning to rank with selection bias in personal search. In Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval . 115–124
Xuanhui Wang, Michael Bendersky, Donald Metzler, and Marc Najork. 2016 · 2016
Cited alongside, same era.
Unbiased learning-to-rank with biased feedback. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining . 781–789
Thorsten Joachims, Adith Swaminathan, and Tobias Schnabel. 2017 · 2017
Cited alongside, same era.
When Inverse Propensity Scoring does not Work: Affine Corrections for Unbiased Learning to Rank. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management . 1475–1484
Ali Vardasbi, Harrie Oosterhuis, and Maarten de Rijke. 2020 · 2020
Later among the works it cites.
Analysis of multivariate scoring functions for automatic unbiased learning to rank. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management . 2277–2280
Tao Yang, Shikai Fang, Shibo Li, Yulan Wang, and Qingyao Ai. 2020 · 2020
Later among the works it cites.
Unbiased Learning to Rank: Online or Offline?
Qingyao Ai, Tao Yang, Huazheng Wang, and Jiaxin Mao. 2021 · 2021
Later among the works it cites.
Daniel Cohen, Bhaskar Mitra, Oleg Lesota, Navid Rekabsaz, and Carsten Eickhoff. 2021 · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Robust standard deviation estimation for query performance prediction. In Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval . 245–248
Haggai Roitman, Shai Erera, and Bar Weiner. 2017 · 2017
Cited alongside, same era.
Online learning to rank in stochastic click models. In International Conference on Machine Learning . PMLR, 4199–4208
Masrour Zoghi, Tomas Tunys, Mohammad Ghavamzadeh, Branislav Kveton, Csaba Szepesvari, and Zheng Wen. 2017 · 2017
Cited alongside, same era.
Differentiable unbiased online learning to rank. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management . 1293–1302
Harrie Oosterhuis and Maarten de Rijke. 2018 · 2018
Cited alongside, same era.
Fairness of exposure in rankings. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . 2219–2228
Ashudeep Singh and Thorsten Joachims. 2018 · 2018
Cited alongside, same era.
An assumption-free approach to the dynamic truncation of ranked lists. In Proceedings of the 2019 ACM SIGIR International Conference on Theory of Information Retrieval . 79–82
Yen-Chieh Lien, Daniel Cohen, and W Bruce Croft. 2019 · 2019
Cited alongside, same era.
Variance reduction in gradient exploration for online learning to rank. In Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval . 835–844
Huazheng Wang, Sonwoo Kim, Eric McCord-Snook, Qingyun Wu, and Hongning Wang. 2019 · 2019
Cited alongside, same era.
Beyond the selected completely at random assumption for learning from positive and unlabeled data. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases . Springer, 71–85
Jessa Bekker, Pieter Robberechts, and Jesse Davis. 2020 · 2020
Cited alongside, same era.
Treating Cold Start in Product Search by Priors. In Companion Proceedings of the Web Conference 2020 . 77–78
Parth Gupta, Tommaso Dreossi, Jan Bakus, Yu-Hsiang Lin, and Vamsi Salaka. 2020 · 2020
Cited alongside, same era.
Pessimistic reward models for off-policy learning in recommendation. In Proceedings of the 15th ACM Conference on Recommender Systems . 63–74
Olivier Jeunen and Bart Goethals. 2021 · 2021
Later among the works it cites.
Robust Generalization and Safe Query-Specializationin Counterfactual Learning to Rank. In Proceedings of the Web Conference 2021 . 158–170
Harrie Oosterhuis and Maarten de de Rijke. 2021b · 2021
Later among the works it cites.
On the Calibration and Uncertainty of Neural Learning to Rank Models for Conversational Search. In Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume . 160–170
Gustavo Penha and Claudia Hauff. 2021 · 2021
Later among the works it cites.
ULTRA: An Unbiased Learning To Rank Algorithm Toolbox. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management . 4613–4622
Anh Tran, Tao Yang, and Qingyao Ai. 2021 · 2021
Later among the works it cites.
Deep bayesian active learning for learning to rank: A case study in answer selection
Qunbo Wang, Wenjun Wu, Yuxing Qi, and Yongchi Zhao. 2021 · 2021
Later among the works it cites.
Maximizing marginal fairness for dynamic learning to rank. In Proceedings of the Web Conference 2021 . 137–145
Tao Yang and Qingyao Ai. 2021 · 2021
Later among the works it cites.
Pessimistic Off-Policy Optimization for Learning to Rank
Matej Cief, Branislav Kveton, and Michal Kompan. 2022 · 2022
Later among the works it cites.
Addressing Cold Start in Product Search via Empirical Bayes. In Proceedings of the 31st ACM International Conference on Information and Knowledge Management (Atlanta, GA, USA) (CIKM ’22) . Association for Computing Machinery, New York, NY, USA, 3141–3151
Cuize Han, Pablo Castells, Parth Gupta, Xu Xu, and Vamsi Salaka. 2022 · 2022
Later among the works it cites.
On the Value of Prior in Online Learning to Rank. In International Conference on Artificial Intelligence and Statistics . PMLR, 6880–6892
Branislav Kveton, Ofer Meshi, Masrour Zoghi, and Zhen Qin. 2022 · 2022
Later among the works it cites.
Local Policy Improvement for Recommender Systems
Dawen Liang and Nikos Vlassis. 2022 · 2022
Later among the works it cites.
Can clicks be both labels and features? Unbiased Behavior Feature Collection and Uncertainty-aware Learning to Rank. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval . 6–17
Tao Yang, Chen Luo, Hanqing Lu, Parth Gupta, Bing Yin, and Qingyao Ai. 2022 · 2022
Later among the works it cites.
Marginal-Certainty-aware Fair Ranking Algorithm. In Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining . 24–32
Tao Yang, Zhichao Xu, Zhenduo Wang, Anh Tran, and Qingyao Ai. 2023 · 2023
Closest in time.