The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.
Fairness in Recommendation Ranking through Pairwise Comparisons
Open accessAbstract
Recommender systems are one of the most pervasive applications of machine learning in industry, with many services using them to match users to products or information. As such it is important to ask: what are the possible fairness risks, how can we quantify them, and how should we address them? In this paper we offer a set of novel metrics for evaluating algorithmic fairness concerns in recommender systems. In particular we show how measuring fairness based on pairwise comparisons from randomized experiments provides a tractable means to reason about fairness in rankings from recommender systems. Building on this metric, we offer a new regularizer to encourage improving this metric during model training and thus improve fairness in the resulting rankings. We apply this pairwise regularization to a large-scale, production recommender system and show that we are able to significantly improve the system's pairwise fairness.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
Neural Collaborative Filtering
He, X., Liao, L., Zhang, H., Nie, L., Hu, X., & Chua, T.-S. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052569 · Cited by 6,652
Optimizing search engines using clickthrough data
Joachims, T. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775067 · Cited by 3,873
Deep Neural Networks for YouTube Recommendations
Covington, P., Adams, J., & Sargin, E. (2016) · Proceedings of the 10th ACM Conference on Recommender Systems · doi:10.1145/2959100.2959190 · Cited by 3,539
Dwork, C., Hardt, M., Pitassi, T., Reingold, O., & Zemel, R. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090255 · Cited by 3,501
Exposure to ideologically diverse news and opinion on Facebook
Bakshy, E., Messing, S., & Adamic, L. A. (2015) · Science · doi:10.1126/science.aaa1160 · Cited by 3,245
Equality of Opportunity in Supervised Learning
Hardt, M., Price, E., & Srebro, N. (2016) · arXiv · doi:10.48550/arxiv.1610.02413 · Cited by 2,536 · cited 6×
“[23], where we are concerned with differences in accuracy across groups.”
BackgroundInfluentialLearning to rank: from pairwise approach to listwise approach
Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273513 · Cited by 1,960 · cited 2×
“(This analysis is similar to probabilistic interpretations in traditional pairwise IR [14], but now in the context of recommender system fairness.”
BackgroundMitigating Unwanted Biases with Adversarial Learning
Zhang, B. H., Lemoine, B., & Mitchell, M. (2018) · Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society · doi:10.1145/3278721.3278779 · Cited by 1,387
A Reductions Approach to Fair ClassificationPreprint
Agarwal, A., Beygelzimer, A., Dudík, M., Langford, J. C., & Wallach, H. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.02453 · Cited by 1,285
Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts
Ma, J., Zhao, Z., Yi, X., Chen, J., Hong, L., & Chi, E. H. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220007 · Cited by 1,233
Self-citationCollaborative filtering with temporal dynamics
Koren, Y. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557072 · Cited by 1,203
(2013) · Cited by 1,126
Inherent Trade-Offs in the Fair Determination of Risk Scores
Kleinberg, J., Mullainathan, S., & Raghavan, M. (2016) · arXiv · doi:10.48550/arxiv.1609.05807 · Cited by 941
Practical Lessons from Predicting Clicks on Ads at Facebook
He, X., Pan, J., Jin, O., Xu, T., Liu, B., Xu, T., Shi, Y., Atallah, A., Herbrich, R., Bowers, S., et al. (2014) · Proceedings of the Eighth International Workshop on Data Mining for Online Advertising · doi:10.1145/2648584.2648589 · Cited by 869
Ad click prediction: a view from the trenches
McMahan, H. B., Holt, G., Sculley, D., Young, M., Ebner, D., Grady, J., Nie, L., Phillips, T., Davydov, E., Golovin, D., et al. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2488200 · Cited by 867
Three naive Bayes approaches for discrimination-free classification.
Calders, T., & Verwer, S. (2010) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0190-x · Cited by 764
Recurrent Recommender Networks
Wu, C.-Y., Ahmed, A., Beutel, A., Smola, A. J., & Jing, H. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018689 · Cited by 713
Self-citationMeasuring and Mitigating Unintended Bias in Text Classification
Dixon, L., Li, J., Sorensen, J., Thain, N., & Vasserman, L. (2018) · Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society · doi:10.1145/3278721.3278729 · Cited by 674
Fairness Constraints: Mechanisms for Fair Classification
Zafar, M. B., Valera, I., Rodriguez, M. G., & Gummadi, K. P. (2015) · arXiv · doi:10.48550/arxiv.1507.05259 · Cited by 645 · cited 2×
“Rather, numerous approaches have been developed for optimizing fairness metrics during classifier training, such as constraint-based optimization [2, 22], adversarial learning [8, 20, 35, 37, 53, 54], and regularization over model predictions [5, 7, 30, 51].”
BackgroundFairness of Exposure in Rankings
Singh, A., & Joachims, T. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220088 · Cited by 591
Unbiased Learning-to-Rank with Biased Feedback
Joachims, T., Swaminathan, A., & Schnabel, T. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018699 · Cited by 531 · cited 1×
“Two that relate to the challenges in fairness are the temporal dynamics [33, 48, 26, 9] and biased training data [29, 15, 3].”
BackgroundSession-based Recommendations with Recurrent Neural Networks
Hidasi, B., Karatzoglou, A., Baltrunas, L., & Tikk, D. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.06939 · Cited by 509
FA*IR: A Fair Top-k Ranking Algorithm
Zehlike, M., Bonchi, F., Castillo, C., Hajian, S., Megahed, M., & Baeza-Yates, R. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3132938 · Cited by 496
Censoring Representations with an AdversaryPreprint
Edwards, H. S., & Storkey, A. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.05897 · Cited by 490
Top-K Off-Policy Correction for a REINFORCE Recommender System
Chen, M., Beutel, A., Covington, P., Jain, S., Belletti, F., & Chi, E. H. (2019) · Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining · doi:10.1145/3289600.3290999 · Cited by 393
Self-citationFairness-aware Learning through Regularization Approach
Kamishima, T., Akaho, S., & Sakuma, J. (2011) · 2011 IEEE 11th International Conference on Data Mining Workshops · doi:10.1109/icdmw.2011.83 · Cited by 371
Equity of Attention: Amortizing Individual Fairness in Rankings
Biega, A. J., Gummadi, K. P., & Weikum, G. (2018) · The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval · doi:10.1145/3209978.3210063 · Cited by 337
The Variational Fair Autoencoder
Louizos, C., Swersky, K., Li, Y., Welling, M., & Zemel, R. S. (2016) · Data Archiving and Networked Services (DANS) · Cited by 336
Latent Cross: Making Use of Context in Recurrent Recommender Systems
Beutel, A., Covington, P., Jain, S., Xu, C., Li, J., Gatto, V., & Chi, E. H. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159727 · Cited by 313
Self-citationInherent Tradeoffs in the Fair Determination of Risk Scores
(2023) · The Societal Impacts of Algorithmic Decision-Making · doi:10.1145/3603195.3603197 · Cited by 310
Nuanced Metrics for Measuring Unintended Bias with Real Data for Text Classification
Borkan, D., Dixon, L., Sorensen, J., Thain, N., & Vasserman, L. (2019) · Companion Proceedings of The 2019 World Wide Web Conference · doi:10.1145/3308560.3317593 · Cited by 309
Assessing calibration of prognostic risk scores
Crowson, C. S., Atkinson, E. J., & Therneau, T. M. (2016) · Statistical Methods in Medical Research · doi:10.1177/0962280213497434 · Cited by 289
Mehrotra, R., McInerney, J., Bouchard, H., Lalmas, M., & Diaz, F. (2018) · Proceedings of the 27th ACM International Conference on Information and Knowledge Management · doi:10.1145/3269206.3272027 · Cited by 279
Data Decisions and Theoretical Implications when Adversarially Learning Fair Representations
Beutel, A., Chen, J., Zhao, Z., & Chi, E. H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.00075 · Cited by 274
Self-citationPleiss, G., Raghavan, M., Wu, F., Kleinberg, J. M., & Weinberger, K. Q. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.02012 · Cited by 263
Degenerate Feedback Loops in Recommender Systems
Jiang, R., Chiappa, S., Lattimore, T., György, A., & Kohli, P. (2019) · Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society · doi:10.1145/3306618.3314288 · Cited by 232
Beyond clicks: dwell time for personalization
Yi, X., Hong, L., Zhong, E., Liu, N. N., & Rajan, S. (2014) · Proceedings of the 8th ACM Conference on Recommender systems · doi:10.1145/2645710.2645724 · Cited by 225
Self-citationA cascade ranking model for efficient ranked retrieval
Wang, L., Lin, J., & Metzler, D. (2011) · Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval · doi:10.1145/2009916.2009934 · Cited by 200
Fairness-Aware Tensor-Based Recommendation
Zhu, Z., Hu, X., & Caverlee, J. (2018) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3269206.3271795 · Cited by 198
Policy Learning for Fairness in RankingPreprint
Singh, A., & Joachims, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.04056 · Cited by 184
Penalizing Unfairness in Binary ClassificationPreprint
Bechavod, Y., & Ligett, K. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.00044 · Cited by 175
Learning Adversarially Fair and Transferable Representations
Madras, D., Creager, E., Pitassi, T., & Zemel, R. S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.06309 · Cited by 171
Beyond Parity: Fairness Objectives for Collaborative Filtering
Yao, S., & Huang, B. (2017) · arXiv · doi:10.48550/arxiv.1705.08804 · Cited by 169
Ranking via Sinkhorn PropagationPreprint
Adams, R. P., & Zemel, R. S. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1106.1925 · Cited by 160
Exploring author gender in book rating and recommendation
Ekstrand, M. D., Tian, M., Kazi, M. I. R., Mehrpouyan, H., & Kluver, D. (2018) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/3240323.3240373 · Cited by 158
Satisfying Real-world Goals with Dataset ConstraintsPreprint
Goh, G., Cotter, A., Gupta, M. R., & Friedlander, M. P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.07558 · Cited by 141
Seq2Slate: Re-ranking and Slate Optimization with RNNsPreprint
Bello, I., Kulkarni, S., Jain, S. C., Boutilier, C. E., Chi, E., Eban, E., Luo, X., Mackey, A., & Meshi, O. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.02019 · Cited by 130
Self-citationPutting Fairness Principles into Practice: Challenges, Metrics, and Improvements
Beutel, A., Chen, J., Doshi, T., Qian, H., Woodruff, A., Luu, C., Kreitmann, P., Bischof, J., & Chi, E. H. (2019) · Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society · doi:10.1145/3306618.3314234 · Cited by 111
Self-citationEstimating Position Bias without Intrusive Interventions
Agarwal, A., Zaitsev, I., Wang, X., Li, C., Najork, M., & Joachims, T. (2019) · Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining · doi:10.1145/3289600.3291017 · Cited by 107
Zafar, M. B., Valera, I., Gomez-Rodriguez, M., & Gummadi, K. P. (2015) · MPG.PuRe (Max Planck Society) · Cited by 92
Online Set Selection with Fairness and Diversity Constraints
Stoyanovich, J., Yang, K., & Jagadish, H. V. (2018) · Movebank · doi:10.5441/002/edbt.2018.22 · Cited by 86
Beyond Globally Optimal: Focused Learning for Improved Recommendations
Beutel, A., Chi, E. H., Cheng, Z., Pham, H., & Anderson, J. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052713 · Cited by 73
Self-citationOn conditional parity as a notion of non-discrimination in machine learningPreprint
Ritov, Y., Sun, Y., & Zhao, R. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.08519 · Cited by 45
Top-K Off-Policy Correction for a REINFORCE Recommender SystemPreprint
Chen, M., Beutel, A., Covington, P., Jain, S. C., Belletti, F., & Ed, H. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.02353 · Cited by 38
Self-citationSelection Problems in the Presence of Implicit Bias
Raghavan, M. (2023) · ACM eBooks · doi:10.1145/3603195.3603209 · Cited by 22
Unbiased Comparative Evaluation of Ranking Functions
Schnabel, T., Swaminathan, A., Frazier, P. I., & Joachims, T. (2016) · ACM SIGIR International Conference on Theory of Information Retrieval (ICTIR) · doi:10.1145/2970398.2970410 · Cited by 19
Cited by
A Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and Directions
Gao, C., Zheng, Y., Li, N., Li, Y., Qin, Y., Piao, J., Quan, Y., Chang, J., Jin, D., He, X., et al. (2023) · ACM Transactions on Recommender Systems · doi:10.1145/3568022 · Cited by 1,082
Bias and Debias in Recommender System: A Survey and Future Directions
Chen, J., Dong, H., Wang, X., Feng, F., Wang, M., & He, X. (2023) · ACM Transactions on Information Systems · doi:10.1145/3564284 · Cited by 741
Self-citationA Review on Fairness in Machine Learning
Pessach, D., & Shmueli, E. (2023) · ACM Computing Surveys · doi:10.1145/3494672 · Cited by 598
Fairness in machine learning: A survey
Caton, S., & Haas, C. (2024) · ACM Computing Surveys · doi:10.1145/3616865 · Cited by 646
A Survey on the Fairness of Recommender Systems
Wang, Y., Ma, W., Zhang, M., Liu, Y., & Ma, S. (2023) · ACM Transactions on Information Systems · doi:10.1145/3547333 · Cited by 356
Metadata
- Authors
- Beutel, A., Chen, J., Doshi, T., Qian, H., Wei, L., Wu, Y., Heldt, L., Zhao, Z., Hong, L., Chi, E. H., & Goodrow, C.
- Venue
- Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
- Publisher
- ACM
- Published
- 2019-07-25
- Pages
- 2212-2220
- OpenAlex
- W2920187767
- Cited by
- 362
- References
- 57
- FWCI
- 46.66
- Type
- conference paper
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.