Fetching the paper…
Reading the bibliography…
Unbiased CLTR requires click propensities to compensate for the difference between user clicks and true relevance of search results via IPS.
An Experimental Comparison of Click Position-bias Models. In WSDM . 87–94
Nick Craswell, Onno Zoeter, Michael Taylor, and Bill Ramsey. 2008 · 2008
Earlier work this paper cites.
A Dynamic Bayesian Network Click Model for Web Search Ranking. In WWW . ACM, 1–10
Olivier Chapelle and Ya Zhang. 2009 · 2009
Earlier work this paper cites.
Learning to rank for information retrieval
Tie-Yan Liu. 2009 · 2009
Earlier work this paper cites.
Yahoo! Learning to Rank Challenge Overview. In Proceedings of the Learning to Rank Challenge . 1–24
Olivier Chapelle and Yi Chang. 2011 · 2011
Earlier work this paper cites.
Click Models for Web Search
Aleksandr Chuklin, Ilya Markov, and Maarten de Rijke. 2015 · 2015
Earlier work this paper cites.
A Comparative Study of Click Models for Web Search. In CLEF . Springer, 78–90
Artem Grotov, Aleksandr Chuklin, Ilya Markov, Luka Stout, Finde Xumara, and Maarten de Rijke. 2015 · 2015
Cited alongside, same era.
Batch Learning from Logged Bandit Feedback through Counterfactual Risk Minimization
Adith Swaminathan and Thorsten Joachims. 2015 · 2015
Cited alongside, same era.
Learning to Rank with Selection Bias in Personal Search. In SIGIR . ACM, 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 WSDM . ACM, 781–789
Thorsten Joachims, Adith Swaminathan, and Tobias Schnabel. 2017 · 2017
Cited alongside, same era.
Unbiased Learning to Rank with Unbiased Propensity Estimation. In SIGIR . ACM, 385–394
Qingyao Ai, Keping Bi, Cheng Luo, Jiafeng Guo, and W Bruce Croft. 2018 · 2018
Cited alongside, same era.
Click Chain Model in Web Search. In WWW . ACM, 11–20
Fan Guo, Chao Liu, Anitha Kannan, Tom Minka, Michael Taylor, Yi-Min Wang, and Christos Faloutsos. 2009b
Cited in the paper.
Efficient Multiple-click Models in Web Search. In WSDM . ACM, 124–131
Fan Guo, Chao Liu, and Yi Min Wang. 2009a
Cited in the paper.
Estimating Clickthrough Bias in the Cascade Model. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management . 1587–1590
Praveen Chandar and Ben Carterette. 2018 · 2018
Later among the works it cites.
Differentiable Unbiased Online Learning to Rank. In CIKM . 1293–1302
Harrie Oosterhuis and Maarten de Rijke. 2018 · 2018
Later among the works it cites.
Position Bias Estimation for Unbiased Learning to Rank in Personal Search. In WSDM . ACM, 610–618
Xuanhui Wang, Nadav Golbandi, Michael Bendersky, Donald Metzler, and Marc Najork. 2018 · 2018
Later among the works it cites.
Addressing Trust Bias for Unbiased Learning-to-Rank. In WWW . ACM, 4–14
Aman Agarwal, Xuanhui Wang, Cheng Li, Michael Bendersky, and Marc Najork. 2019 · 2019
Later among the works it cites.
Learning Groupwise Multivariate Scoring Functions Using Deep Neural Networks. In SIGIR . 85–92
Qingyao Ai, Xuanhui Wang, Sebastian Bruch, Nadav Golbandi, Michael Bendersky, and Marc Najork. 2019 · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…