Fetching the paper…
Reading the bibliography…
We introduce the concept of \emph{expected exposure} as the average attention ranked items receive from users over repeated samples of the same query.
Smoothing DCG for learning to rank: A novel approach using smoothed hinge functions. In Proc. CIKM . ACM, 1923–1926
Mingrui Wu, Yi Chang, Zhaohui Zheng, and Hongyuan Zha. 2009 · 1926
Earlier work this paper cites.
Fairness Without Demographics in Repeated Loss Minimization. In Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research) , Jennifer Dy and Andreas Krause (Eds.), Vol. 80. 1929–1938
Tatsunori Hashimoto, Megha Srivastava, Hongseok Namkoong, and Percy Liang. 2018 · 1938
Earlier work this paper cites.
Individual Choice Behavior
R. Duncan Luce. 1959 · 1959
Earlier work this paper cites.
The Analysis of Permutations
R. L. Plackett. 1975 · 1975
Earlier work this paper cites.
Generating a random permutation with random transpositions
Persi Diaconis and Mehrdad Shahshahani. 1981 · 1981
Earlier work this paper cites.
Learning to rank using gradient descent. In Proceedings of the 22nd international conference on Machine learning . 89–96
Chris Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, and Greg Hullender. 2005 · 2005
Earlier work this paper cites.
Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results. In VLDB . 781–792
Sandeep Pandey, Sourashis Roy, Christopher Olston, Junghoo Cho, and Soumen Chakrabarti. 2005 · 2005
Earlier work this paper cites.
Subset ranking using regression. In International Conference on Computational Learning Theory . Springer, 605–619
David Cossock and Tong Zhang. 2006 · 2006
Earlier work this paper cites.
Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs. In Proceedings of the 21st National Conference on Artificial Intelligence - Volume 2 (AAAI’06) . 1406–1412
Filip Radlinski and Thorsten Joachims. 2006 · 2006
Earlier work this paper cites.
Active exploration for learning rankings from clickthrough data. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . 570–579
Filip Radlinski and Thorsten Joachims. 2007 · 2007
Earlier work this paper cites.
Rank-biased Precision for Measurement of Retrieval Effectiveness
Alistair Moffat and Justin Zobel. 2008 · 2008
Earlier work this paper cites.
Learning diverse rankings with multi-armed bandits. In Proceedings of the 25th Annual International Conference on Machine Learning (ICML 2008) , Andrew McCallum and Sam Roweis (Eds.). 784–791
F. Radlinski, R. Kleinberg, and T. Joachims. 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 (CIKM ’09) . 621–630
Olivier Chapelle, Donald Metzler, Ya Zhang, and Pierre Grinspan. 2009 · 2009
Earlier work this paper cites.
BPR: Bayesian Personalized Ranking from Implicit Feedback. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI ’09) . 452–461
Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2009 · 2009
Earlier work this paper cites.
Jianhan Zhu, Jun Wang, Ingemar J. Cox, and Michael J. Taylor. 2009 · 2009
Earlier work this paper cites.
Fast Als-based Matrix Factorization for Explicit and Implicit Feedback Datasets. In Proceedings of the Fourth ACM Conference on Recommender Systems (RecSys ’10) . 71–78
István Pilászy, Dávid Zibriczky, and Domonkos Tikk. 2010 · 2010
Earlier work this paper cites.
A general approximation framework for direct optimization of information retrieval measures
Tao Qin, Tie-Yan Liu, and Hang Li. 2010 · 2010
Earlier work this paper cites.
Evaluating Diversified Search Results Using Per-Intent Graded Relevance. In Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR ’11) . 1043–1052
Tetsuya Sakai and Ruihua Song. 2011 · 2011
Cited alongside, same era.
Fairness Through Awareness. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS ’12) . 214–226
Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard Zemel. 2012 · 2012
Cited alongside, same era.
Estimating or propagating gradients through stochastic neurons for conditional computation
Yoshua Bengio, Nicholas Léonard, and Aaron Courville. 2013 · 2013
Cited alongside, same era.
Robust Models of Mouse Movement on Dynamic Web Search Results Pages. In Proceedings of the 22nd ACM conference on Information and knowledge management (CIKM 2013) . 1451–1460
Fernando Diaz, Ryen W. White, Georg Buscher, and Dan Liebling. 2013 · 2013
Cited alongside, same era.
FA*IR: A Fair Top-k Ranking Algorithm. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management (CIKM ’17) . 1569–1578
Meike Zehlike, Francesco Bonchi, Carlos Castillo, Sara Hajian, Mohamed Megahed, and Ricardo Baeza-Yates. 2017 · 2017
Later among the works it cites.
Equity of Attention: Amortizing Individual Fairness in Rankings. In The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval (SIGIR ’18) . 405–414
Asia J. Biega, Krishna P. Gummadi, and Gerhard Weikum. 2018 · 2018
Later among the works it cites.
Ranking with Fairness Constraints. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic . 28:1–28:15
L. Elisa Celis, Damian Straszak, and Nisheeth K. Vishnoi. 2018 · 2018
Later among the works it cites.
How algorithmic confounding in recommendation systems increases homogeneity and decreases utility. In Proceedings of the 12th ACM Conference on Recommender Systems (RecSys ’18) . 224–232
Allison J B Chaney, Brandon M Stewart, and Barbara E Engelhardt. 2018 · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fast and Reliable Online Learning to Rank for Information Retrieval
K. Hofmann. 2013 · 2013
Cited alongside, same era.
Introducing LETOR 4.0 Datasets
Tao Qin and Tie-Yan Liu. 2013 · 2013
Cited alongside, same era.
The MovieLens Datasets: History and Context
F Maxwell Harper and Joseph A Konstan. 2015 · 2015
Cited alongside, same era.
Search Result Diversification . Foundations and Trends in Information Retrieval, Vol. 9
Rodrygo L. T. Santos, Craig Macdonald, and Iadh Ounis. 2015 · 2015
Cited alongside, same era.
Fairness in Learning: Classic and Contextual Bandits
Matthew Joseph, Michael Kearns, Jamie H Morgenstern, and Aaron Roth. 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.
Multisided Fairness for Recommendation
Robin Burke. 2017 · 2017
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.
Short-Term Satisfaction and Long-Term Coverage: Understanding How Users Tolerate Algorithmic Exploration. In Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining (WSDM ’18) . 513–521
Tobias Schnabel, Paul N. Bennett, Susan T. Dumais, and Thorsten Joachims. 2018 · 2018
Later among the works it cites.
Fairness of Exposure in Rankings. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD ’18) . 2219–2228
Ashudeep Singh and Thorsten Joachims. 2018 · 2018
Later among the works it cites.
A Unified Approach to Quantifying Algorithmic Unfairness: Measuring Individual & Group Unfairness via Inequality Indices. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD ’18) . 2239–2248
Till Speicher, Hoda Heidari, Nina Grgic-Hlaca, Krishna P. Gummadi, Adish Singla, Adrian Weller, and Muhammad Bilal Zafar. 2018 · 2018
Later among the works it cites.
Fairness in Recommendation Ranking Through Pairwise Comparisons. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD ’19) . 2212–2220
Alex Beutel, Jilin Chen, Tulsee Doshi, Hai Qian, Li Wei, Yi Wu, Lukasz Heldt, Zhe Zhao, Lichan Hong, Ed H. Chi, and Cristos Goodrow. 2019 · 2019
Later among the works it cites.
Quantifying the Impact of User Attentionon Fair Group Representation in Ranked Lists. In Companion Proceedings of The 2019 World Wide Web Conference on - WWW ’19 . 553–562
Piotr Sapiezynski, Wesley Zeng, Ronald E Robertson, Alan Mislove, and Christo Wilson. 2019 · 2019
Later among the works it cites.
Policy Learning for Fairness in Ranking. In Advances in Neural Information Processing Systems
Ashudeep Singh and Thorsten Joachims. 2019 · 2019
Later among the works it cites.
Two-sided fairness for repeated matchings in two-sided markets: A case study of a ride-hailing platform. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . ACM, 3082–3092
Tom Sühr, Asia J Biega, Meike Zehlike, Krishna P Gummadi, and Abhijnan Chakraborty. 2019 · 2019
Later among the works it cites.
Fair Learning-to-Rank from Implicit Feedback
Himank Yadav, Zhengxiao Du, and Thorsten Joachims. 2019 · 2019
Later among the works it cites.
A Stochastic Treatment of Learning to Rank Scoring Functions. In Proceedings of the 13th ACM International Conference on Web Search and Data Mining (WSDM 2020)
Sebastian Bruch, Shuguang Han, Mike Bendersky, and Marc Najork. 2020 · 2020
Closest in time.
LensKit for Python: Next-Generation Software for Recommender System Experiments. In Proceedings of the 29th ACM International Conference on Information and Knowledge Management . ACM
Michael D. Ekstrand. 2020 · 2020
Closest in time.
Toward creating a fairer ranking in search engine results
Ruoyuan Gao and Chirag Shah. 2020 · 2020
Closest in time.
Reducing Disparate Exposure in Ranking: A Learning To Rank Approach. In WWW ’20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020 , Yennun Huang, Irwin King, Tie-Yan Liu, and Maarten van Steen (Eds.). 2849–2855
Meike Zehlike and Carlos Castillo. 2020 · 2020
Closest in time.