Toward Pareto Efficient Fairness-Utility Trade-off inRecommendation through Reinforcement Learning
arXiv:2201.00140 · doi:10.1145/3488560.3498487
Abstract
The issue of fairness in recommendation is becoming increasingly essential as Recommender Systems touch and influence more and more people in their daily lives. In fairness-aware recommendation, most of the existing algorithmic approaches mainly aim at solving a constrained optimization problem by imposing a constraint on the level of fairness while optimizing the main recommendation objective, e.g., CTR. While this alleviates the impact of unfair recommendations, the expected return of an approach may significantly compromise the recommendation accuracy due to the inherent trade-off between fairness and utility. This motivates us to deal with these conflicting objectives and explore the optimal trade-off between them in recommendation. One conspicuous approach is to seek a Pareto efficient solution to guarantee optimal compromises between utility and fairness. Moreover, considering the needs of real-world e-commerce platforms, it would be more desirable if we can generalize the whole Pareto Frontier, so that the decision-makers can specify any preference of one objective over another based on their current business needs. Therefore, in this work, we propose a fairness-aware recommendation framework using multi-objective reinforcement learning, called MoFIR, which is able to learn a single parametric representation for optimal recommendation policies over the space of all possible preferences. Specially, we modify traditional DDPG by introducing conditioned network into it, which conditions the networks directly on these preferences and outputs Q-value-vectors. Experiments on several real-world recommendation datasets verify the superiority of our framework on both fairness metrics and recommendation measures when compared with all other baselines. We also extract the approximate Pareto Frontier on real-world datasets generated by MoFIR and compare to state-of-the-art fairness methods.
References in corpus (21)
- BPR: Bayesian Personalized Ranking from Implicit Feedback
- Neural Graph Collaborative Filtering
- Fairness of Exposure in Rankings
- Recommendations with Negative Feedback via Pairwise Deep Reinforcement Learning
- Fairness-Aware Ranking in Search & Recommendation Systems with Application to LinkedIn Talent Search
- User-oriented Fairness in Recommendation
- Towards Long-term Fairness in Recommendation
- Beyond Parity: Fairness Objectives for Collaborative Filtering
- Personalized Counterfactual Fairness in Recommendation
- Counterfactual Explainable Recommendation
- Understanding Echo Chambers in E-commerce Recommender Systems
- The Unfairness of Popularity Bias in Recommendation
- From Parity to Preference-based Notions of Fairness in Classification
- Deep Reinforcement Learning for List-wise Recommendations
- A Generalized Algorithm for Multi-Objective Reinforcement Learning and Policy Adaptation
- Dynamic Weights in Multi-Objective Deep Reinforcement Learning
- Real-time Attention Based Look-alike Model for Recommender System
- Maximizing Marginal Fairness for Dynamic Learning to Rank
- Causal Collaborative Filtering
- Learning Personalized Risk Preferences for Recommendation
- Pareto Efficient Fairness in Supervised Learning: From Extraction to Tracing
Cited by in corpus (15)
- Is ChatGPT Fair for Recommendation? Evaluating Fairness in Large Language Model Recommendation
- A Survey on Reinforcement Learning for Recommender Systems
- Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive Recommendation
- Exploration and Regularization of the Latent Action Space in Recommendation
- Intersectional Two-sided Fairness in Recommendation
- Towards Fairness in Personalized Ads Using Impression Variance Aware Reinforcement Learning
- Future Impact Decomposition in Request-level Recommendations
- Towards Fair Allocation in Social Commerce Platforms
- Learn Basic Skills and Reuse: Modularized Adaptive Neural Architecture Search (MANAS)
- Pareto Front Approximation for Multi-Objective Session-Based Recommender Systems
- FairWASP: Fast and Optimal Fair Wasserstein Pre-processing
- Impression-Aware Recommender Systems
- A Reproducibility Study of Product-side Fairness in Bundle Recommendation
- Value Function Decomposition in Markov Recommendation Process
- Joint Evaluation of Fairness and Relevance in Recommender Systems with Pareto Frontier