Recommendation with User Active Disclosing Willingness
Lei Wang, Xu Chen, Quanyu Dai, Zhenhua Dong

TL;DR
This paper introduces a novel recommendation framework that incorporates user willingness to disclose behaviors, balancing recommendation accuracy with privacy concerns through a game-theoretic approach and influence function-based algorithms.
Contribution
It proposes a new recommendation paradigm that models user willingness as a game and develops efficient algorithms to optimize recommendation quality while respecting user privacy.
Findings
Effective balance between recommendation quality and user privacy.
Algorithm reduces computational cost for exploring recommendation quality.
Model demonstrates strong performance in experiments.
Abstract
Recommender system has been deployed in a large amount of real-world applications, profoundly influencing people's daily life and production.Traditional recommender models mostly collect as comprehensive as possible user behaviors for accurate preference estimation. However, considering the privacy, preference shaping and other issues, the users may not want to disclose all their behaviors for training the model. In this paper, we study a novel recommendation paradigm, where the users are allowed to indicate their "willingness" on disclosing different behaviors, and the models are optimized by trading-off the recommendation quality as well as the violation of the user "willingness". More specifically, we formulate the recommendation problem as a multiplayer game, where the action is a selection vector representing whether the items are involved into the model training. For efficiently…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Advanced Bandit Algorithms Research
