Comprehensive Fair Meta-learned Recommender System
- URL: http://arxiv.org/abs/2206.04789v1
- Date: Thu, 9 Jun 2022 22:48:35 GMT
- Title: Comprehensive Fair Meta-learned Recommender System
- Authors: Tianxin Wei, Jingrui He
- Abstract summary: We propose a comprehensive fair meta-learning framework, named CLOVER, for ensuring the fairness of meta-learned recommendation models.
Our framework offers a generic training paradigm that is applicable to different meta-learned recommender systems.
- Score: 39.04926584648665
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In recommender systems, one common challenge is the cold-start problem, where
interactions are very limited for fresh users in the systems. To address this
challenge, recently, many works introduce the meta-optimization idea into the
recommendation scenarios, i.e. learning to learn the user preference by only a
few past interaction items. The core idea is to learn global shared
meta-initialization parameters for all users and rapidly adapt them into local
parameters for each user respectively. They aim at deriving general knowledge
across preference learning of various users, so as to rapidly adapt to the
future new user with the learned prior and a small amount of training data.
However, previous works have shown that recommender systems are generally
vulnerable to bias and unfairness. Despite the success of meta-learning at
improving the recommendation performance with cold-start, the fairness issues
are largely overlooked. In this paper, we propose a comprehensive fair
meta-learning framework, named CLOVER, for ensuring the fairness of
meta-learned recommendation models. We systematically study three kinds of
fairness - individual fairness, counterfactual fairness, and group fairness in
the recommender systems, and propose to satisfy all three kinds via a
multi-task adversarial learning scheme. Our framework offers a generic training
paradigm that is applicable to different meta-learned recommender systems. We
demonstrate the effectiveness of CLOVER on the representative meta-learned user
preference estimator on three real-world data sets. Empirical results show that
CLOVER achieves comprehensive fairness without deteriorating the overall
cold-start recommendation performance.
Related papers
- Understanding Biases in ChatGPT-based Recommender Systems: Provider Fairness, Temporal Stability, and Recency [9.882829614199453]
This paper explores the biases in ChatGPT-based recommender systems, focusing on provider fairness (item-side fairness)
In the first experiment, we assess seven distinct prompt scenarios on top-K recommendation accuracy and fairness.
Embedding fairness into system roles, such as "act as a fair recommender," proved more effective than fairness directives within prompts.
arXiv Detail & Related papers (2024-01-19T08:09:20Z) - Meta-Learning with Adaptive Weighted Loss for Imbalanced Cold-Start
Recommendation [4.379304291229695]
We propose a novel sequential recommendation framework based on gradient-based meta-learning.
Our work is the first to tackle the impact of imbalanced ratings in cold-start sequential recommendation scenarios.
arXiv Detail & Related papers (2023-02-28T15:18:42Z) - Improving Recommendation Fairness via Data Augmentation [66.4071365614835]
Collaborative filtering based recommendation learns users' preferences from all users' historical behavior data, and has been popular to facilitate decision making.
A recommender system is considered unfair when it does not perform equally well for different user groups according to users' sensitive attributes.
In this paper, we study how to improve recommendation fairness from the data augmentation perspective.
arXiv Detail & Related papers (2023-02-13T13:11:46Z) - RESUS: Warm-Up Cold Users via Meta-Learning Residual User Preferences in
CTR Prediction [14.807495564177252]
Click-Through Rate (CTR) prediction on cold users is a challenging task in recommender systems.
We propose a novel and efficient approach named RESUS, which decouples the learning of global preference knowledge contributed by collective users from the learning of residual preferences for individual users.
Our approach is efficient and effective in improving CTR prediction accuracy on cold users, compared with various state-of-the-art methods.
arXiv Detail & Related papers (2022-10-28T11:57:58Z) - Meta Policy Learning for Cold-Start Conversational Recommendation [71.13044166814186]
We study CRS policy learning for cold-start users via meta reinforcement learning.
To facilitate policy adaptation, we design three synergetic components.
arXiv Detail & Related papers (2022-05-24T05:06:52Z) - MetaKG: Meta-learning on Knowledge Graph for Cold-start Recommendation [20.650193619161104]
A knowledge graph (KG) consists of a set of interconnected typed entities and their attributes.
Inspired by the success of meta-learning on scarce training samples, we propose a novel framework called MetaKG.
arXiv Detail & Related papers (2022-02-08T13:31:14Z) - Learning to Learn a Cold-start Sequential Recommender [70.5692886883067]
The cold-start recommendation is an urgent problem in contemporary online applications.
We propose a meta-learning based cold-start sequential recommendation framework called metaCSR.
metaCSR holds the ability to learn the common patterns from regular users' behaviors.
arXiv Detail & Related papers (2021-10-18T08:11:24Z) - Offline Meta-level Model-based Reinforcement Learning Approach for
Cold-Start Recommendation [27.17948754183511]
Reinforcement learning has shown great promise in optimizing long-term user interest in recommender systems.
Existing RL-based recommendation methods need a large number of interactions for each user to learn a robust recommendation policy.
We propose a meta-level model-based reinforcement learning approach for fast user adaptation.
arXiv Detail & Related papers (2020-12-04T08:58:35Z) - Partial Bandit and Semi-Bandit: Making the Most Out of Scarce Users'
Feedback [62.997667081978825]
We present a novel approach for considering user feedback and evaluate it using three distinct strategies.
Despite a limited number of feedbacks returned by users (as low as 20% of the total), our approach obtains similar results to those of state of the art approaches.
arXiv Detail & Related papers (2020-09-16T07:32:51Z) - MetaSelector: Meta-Learning for Recommendation with User-Level Adaptive
Model Selection [110.87712780017819]
We propose a meta-learning framework to facilitate user-level adaptive model selection in recommender systems.
We conduct experiments on two public datasets and a real-world production dataset.
arXiv Detail & Related papers (2020-01-22T16:05:01Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.