Density-Ratio Based Personalised Ranking from Implicit Feedback
Riku Togashi, Masahiro Kato, Mayu Otani, Shin'ichi Satoh
Abstract
Learning from implicit user feedback is challenging as we can only observe positive samples but never access negative ones. Most conventional methods cope with this issue by adopting a pairwise ranking approach with negative sampling. However, the pairwise ranking approach has a severe disadvantage in the convergence time owing to the quadratically increasing computational cost with respect to the sample size; it is problematic, particularly for largescale datasets and complex models such as neural networks. By contrast, a pointwise approach does not directly solve a ranking problem, and is therefore inferior to a pairwise counterpart in top-𝐾 ranking tasks; however, it is generally advantageous in regards to the convergence time. This study aims to establish an approach to learn personalised ranking from implicit feedback, which reconciles the training efficiency of the pointwise approach and ranking effectiveness of the pairwise counterpart. The key idea is to estimate the ranking of items in a pointwise manner; we first reformulate the conventional pointwise approach based on density ratio estimation and then incorporate the essence of ranking-oriented approaches (e.g. the pairwise approach) into our formulation. Through experiments on three real-world datasets, we demonstrate that our approach not only dramatically reduces the convergence time (one to two orders of magnitude faster) but also significantly improving the ranking performance. CCS CONCEPTS • Computing methodologies → Learning from implicit feedback; • Information systems → Recommender systems.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext e075a4a3-53b3-4247-b3de-1c4cc064eb56Cited by top-tier papers4
- Non-Negative Bregman Divergence Minimization for Deep Direct Density Ratio EstimationMasahiro Kato, Takeshi TeshimaICML 2021 · 53 citations
- ApeGNN: Node-Wise Adaptive Aggregation in GNNs for RecommendationDan Zhang, Yifan Zhu, Yuxiao Dong, Yuandong Wang et al.WWW 2023 · 43 citations
- The Minority Matters: A Diversity-Promoting Collaborative Metric Learning AlgorithmShilong Bao, Qianqian Xu, Zhiyong Yang, Yuan He et al.NeurIPS 2022 · 15 citations
- Scalable Personalised Item Ranking through Parametric Density EstimationRiku Togashi, Masahiro Kato, Mayu Otani, Tetsuya Sakai et al.SIGIR 2021
Builds on3
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Reinforced Negative Sampling over Knowledge Graph for RecommendationXiang Wang, Yaokun Xu, Xiangnan He, Yixin Cao et al.WWW 2020 · 209 citations
- Jointly Non-Sampling Learning for Knowledge Graph Enhanced RecommendationChong Chen, Min Zhang, Weizhi Ma, Yiqun Liu et al.SIGIR 2020 · 74 citations
Related papers
- Learning Explicit User Interest Boundary for RecommendationJianhuan Zhuo, Qiannan Zhu, Yinliang Yue, Yuhong ZhaoWWW 2022 · 24 citations
- SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit FeedbackChao Wang, Hengshu Zhu, Chen Zhu, Chuan Qin et al.AAAI 2020 · 53 citations
- Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix FactorizationSuryanarayana Sankagiri, Jalal Etesami, Matthias GrossglauserICML 2025
- A Gain-Tuning Dynamic Negative Sampler for RecommendationQiannan Zhu, Haobo Zhang, Qing He, Zhicheng DouWWW 2022 · 24 citations
- Sampler Design for Implicit Feedback Data by Noisy-label Robust LearningWenhui Yu, Zheng QinSIGIR 2020 · 54 citations
