Top-Personalized-K Recommendation
Wonbin Kweon, SeongKu Kang, Sanghwan Jang, Hwanjo Yu
Abstract
The conventional top-K recommendation, which presents the top-K items with the highest ranking scores, is a common practice for generating personalized ranking lists. However, is this fixed-size top-𝐾 recommendation the optimal approach for every user's satisfaction? Not necessarily. We point out that providing fixed-size recommendations without taking into account user utility can be suboptimal, as it may unavoidably include irrelevant items or limit the exposure to relevant ones. To address this issue, we introduce Top-Personalized-𝐾 Recommendation, a new recommendation task aimed at generating a personalized-sized ranking list to maximize individual user satisfaction. As a solution to the proposed task, we develop a model-agnostic framework named PerK. PerK estimates the expected user utility by leveraging calibrated interaction probabilities, subsequently selecting the recommendation size that maximizes this expected utility. Through extensive experiments on real-world datasets, we demonstrate the superiority of PerK in Top-Personalized-𝐾 recommendation task. We expect that Top-Personalized-𝐾 recommendation has the potential to offer enhanced solutions for various real-world recommendation scenarios, based on its great compatibility with existing models.
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 b280419a-45d2-4e37-84bf-4912367625b5Cited by top-tier papers6
- Doubly Calibrated Estimator for Recommendation on Data Missing Not at RandomWonbin Kweon, Hwanjo YuWWW 2024 · 23 citations
- Uncertainty Quantification and Decomposition for LLM-based RecommendationWonbin Kweon, Sanghwan Jang, SeongKu Kang, Hwanjo YuWWW 2025 · 13 citations
- CUGF: A Reliable and Fair Recommendation FrameworkNitin Bisht, Xiuwen Gong, Guandong XuAAAI 2025 · 1 citation
- GUIDER: Uncertainty Guided Dynamic Re-ranking for Large Language Models Based Recommender SystemsCai Xu, Xujing Wang, Ziyu Guan, Wei Zhao et al.AAAI 2026
- ENSUR: Equitable and Statistically Unbiased RecommendationNitin Bisht, Xiuwen Gong, Guandong XuICML 2025
Builds on15
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Self-supervised Graph Learning for RecommendationJiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He et al.SIGIR 2021 · 1,476 citations
- Revisiting the Calibration of Modern Neural NetworksMatthias Minderer, Josip Djolonga, Rob Romijnders, Frances Hubis et al.NeurIPS 2021 · 633 citations
- Bootstrapping User and Item Representations for One-Class Collaborative FilteringDongha Lee, SeongKu Kang, Hyunjun Ju, Chanyoung Park et al.SIGIR 2021 · 117 citations
- Local Temperature Scaling for Probability CalibrationZhipeng Ding, Xu Han, Peirong Liu, Marc NiethammerICCV 2021 · 109 citations
Related papers
- A Rank-Based Approach to Recommender System's Top-K Queries with Uncertain ScoresCoral Scharf, Carmel Domshlak, Avigdor Gal, Haggai RoitmanSIGMOD 2025 · 2 citations
- Obtaining Calibrated Probabilities with Personalized Ranking ModelsWonbin Kweon, SeongKu Kang, Hwanjo YuAAAI 2022 · 20 citations
- Towards Off-Policy Learning for Ranking Policies with Logged FeedbackTeng Xiao, Suhang WangAAAI 2022 · 8 citations
- Measuring and Mitigating Item Under-Recommendation Bias in Personalized Ranking SystemsZiwei Zhu, Jianling Wang, James CaverleeSIGIR 2020 · 103 citations
- Lower-Left Partial AUC: An Effective and Efficient Optimization Metric for RecommendationWentao Shi, Chenxu Wang, Fuli Feng, Yang Zhang et al.WWW 2024 · 13 citations
