mlsanityData to 7 Oct 2026

Adapting Triplet Importance of Implicit Feedback for Personalized Recommendation

arXiv 2208.01709 ↗First posted 2 Aug 2022cs.IR cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Implicit feedback is frequently used for developing personalized recommendation services due to its ubiquity and accessibility in real-world systems. In order to effectively utilize such information, most research adopts the pairwise ranking method on constructed training triplets (user, positive item, negative item) and aims to distinguish between positive items and negative items for each user. However, most of these methods treat all the training triplets equally, which ignores the subtle difference between different positive or negative items. On the other hand, even though some other works make use of the auxiliary information (e.g., dwell time) of user behaviors to capture this subtle difference, such auxiliary information is hard to obtain. To mitigate the aforementioned problems, we propose a novel training framework named Triplet Importance Learning (TIL), which adaptively learns the importance score of training triplets. We devise two strategies for the importance score generation and formulate the whole procedure as a bilevel optimization, which does not require any rule-based design. We integrate the proposed training procedure with several Matrix Factorization (MF)- and Graph Neural Network (GNN)-based recommendation models, demonstrating the compatibility of our framework. Via a comparison using three real-world datasets with many state-of-the-art methods, we show that our proposed method outperforms the best existing models by 3-21% in terms of Recall@k for the top-k recommendation.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 22 of its 50 references that are in the map. First posted on arXiv 2 Aug 2022.

Builds on

22 of 50 references.

References · 22

  1. 2018DARTS: Differentiable Architecture Searchcited by 1,782
  2. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  3. 2017Neural Collaborative Filteringcited by 1,108
  4. 2019Neural Graph Collaborative Filteringcited by 660
  5. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
  6. 2015Cost Sensitive Learning of Deep Feature Representations from Imbalanced Datacited by 167
  7. 2019Attributed Graph Clustering: A Deep Attentional Embedding Approachcited by 149
  8. 2020Structural Deep Clustering Networkcited by 145
  9. 2017Fast Matrix Factorization for Online Recommendation with Implicit Feedbackcited by 100
  10. 2019Self-Supervised Generalisation with Meta Auxiliary Learningcited by 88
  11. 2020Denoising Implicit Feedback for Recommendationcited by 80
  12. 2015Modeling User Exposure in Recommendationcited by 69
10 more
  1. 2020Reinforced Negative Sampling over Knowledge Graph for Recommendationcited by 40
  2. 2017Adaptive Sampled Softmax with Kernel Based Samplingcited by 38
  3. 2020Multi-Graph Convolution Collaborative Filteringcited by 27
  4. 2022Gradient-based Bi-level Optimization for Deep Learning: A Surveycited by 26
  5. 2020Sampler Design for Implicit Feedback Data by Noisy-label Robust Learningcited by 18
  6. 2019LambdaOpt: Learn to Regularize Recommender Models in Finer Levelscited by 14
  7. 2021Knowledge-Enhanced Top-K Recommendation in Poincar'e Ballcited by 12
  8. 2021Probabilistic Metric Learning with Adaptive Margin for Top-K Recommendationcited by 11
  9. 2018Regularizing Matrix Factorization with User and Item Embeddings for Recommendationcited by 6
  10. 2018Gated Attentive-Autoencoder for Content-Aware Recommendationcited by 6

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.