Interpretable Triplet Importance for Personalized Ranking
Not on the map. Why?
Abstract (arXiv)
Personalized item ranking has been a crucial component contributing to the performance of recommender systems. As a representative approach, pairwise ranking directly optimizes the ranking with user implicit feedback by constructing (textituser, textitpositive item, textitnegative item) triplets. Several recent works have noticed that treating all triplets equally may hardly achieve the best effects. They assign different importance scores to negative items, user-item pairs, or triplets, respectively. However, almost all the generated importance scores are groundless and hard to interpret, thus far from trustworthy and transparent. To tackle these, we propose the textitTriplet Shapley -- a Shapely value-based method to measure the triplet importance in an interpretable manner. Due to the huge number of triplets, we transform the original Shapley value calculation to the Monte Carlo (MC) approximation, where the guarantee for the approximation unbiasedness is also provided. To stabilize the MC approximation, we adopt a control covariates-based method. Finally, we utilize the triplet Shapley value to guide the resampling of important triplets for benefiting the model learning. Extensive experiments are conducted on six public datasets involving classical matrix factorization- and graph neural network-based recommendation models. Empirical results and subsequent analysis show that our model consistently outperforms the state-of-the-art methods.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 21 of its 48 references that are in the map. First posted on arXiv 28 Jul 2024.
Builds on
21 of 48 references.
References · 21
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2017Neural Collaborative Filteringcited by 1,108
- 2019Neural Graph Collaborative Filteringcited by 660
- 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
- 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
- 2019Implicit Regularization in Deep Matrix Factorizationcited by 402
- 2019Monte Carlo Gradient Estimation in Machine Learningcited by 281
- 2021Beta Shapley: a Unified and Noise-reduced Data Valuation Framework for Machine Learningcited by 162
- 2019Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithmscited by 147
- 2020Neuron Shapley: Discovering the Responsible Neuronscited by 98
- 2016Yelp Dataset Challenge: Review Rating Predictioncited by 84
9 more
- 2020Denoising Implicit Feedback for Recommendationcited by 80
- 2020A Distributional Framework for Data Valuationcited by 79
- 2022Towards Understanding the Overfitting Phenomenon of Deep Click-Through Rate Prediction Modelscited by 33
- 2022CS-Shapley: Class-wise Shapley Values for Data Valuation in Classificationcited by 32
- 2020Multi-Graph Convolution Collaborative Filteringcited by 27
- 2023Dynamically Expandable Graph Convolution for Streaming Recommendationcited by 26
- 2023Dynamic Embedding Size Search with Minimum Regret for Streaming Recommender Systemcited by 7
- 2022Reweighting Clicks with Dwell Time in Recommendationcited by 6
- 2022Adapting Triplet Importance of Implicit Feedback for Personalized Recommendationcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.