TopKGAT: A Top-K Objective-Driven Architecture for Recommendation
Sirui Chen, Jiawei Chen, Canghong Jin, Sheng Zhou, Jingbang Chen, Wujie Sun, Can Wang
摘要
Recommendation systems (RS) aim to retrieve the top-K items most relevant to users, with metrics such as Precision@K and Recall@K commonly used to assess effectiveness. The architecture of an RS model acts as an inductive bias, shaping the patterns the model is inclined to learn. In recent years, numerous recommendation architectures have emerged, spanning traditional matrix factorization, deep neural networks, and graph neural networks. However, their designs are often not explicitly aligned with the top-K objective, thereby limiting their effectiveness. To address this limitation, we propose TopKGAT, a novel recommendation architecture directly derived from a differentiable approximation of top-K metrics. The forward computation of a single TopKGAT layer is intrinsically aligned with the gradient ascent dynamics of the Precision@K metric, enabling the model to naturally improve top-K recommendation accuracy. Structurally, TopKGAT resembles a graph attention network and can be implemented efficiently. Extensive experiments on four benchmark datasets demonstrate that TopKGAT consistently outperforms state-of-the-art baselines. The code is available at https://github.com/StupidThree/TopKGAT . CCS Concepts • Information systems → Recommender systems.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper15
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li 等SIGIR 2020 · 被引用 4,448 次
- GMAN: A Graph Multi-Attention Network for Traffic PredictionChuanpan Zheng, Xiaoliang Fan, Cheng Wang, Jianzhong QiAAAI 2020 · 被引用 1,858 次
- How Attentive are Graph Attention Networks?Shaked Brody, Uri Alon, Eran YahavICLR 2022 · 被引用 1,717 次
- Measuring and Relieving the Over-Smoothing Problem for Graph Neural Networks from the Topological ViewDeli Chen, Yankai Lin, Wei Li, Peng Li 等AAAI 2020 · 被引用 1,353 次
- How to Find Your Friendly Neighborhood: Graph Attention Design with Self-SupervisionDongkwan Kim, Alice OhICLR 2021 · 被引用 309 次
相关 Paper
- Rankformer: A Graph Transformer for Recommendation based on Ranking ObjectiveSirui Chen, Shen Han, Jiawei Chen, Binbin Hu 等WWW 2025 · 被引用 7 次
- Attentive Knowledge-aware Graph Convolutional Networks with Collaborative Guidance for Personalized RecommendationYankai Chen, Yaming Yang, Yujing Wang, Jing Bai 等ICDE 2022 · 被引用 81 次
- ST: A Scalable Module for Solving Top-k ProblemsHanchen Xia, Weidong Liu, Xiaojun MaoNeurIPS 2024 · 被引用 1 次
- Breaking the Top-K Barrier: Advancing Top-K Ranking Metrics Optimization in Recommender SystemsWeiqin Yang, Jiawei Chen, Shengjia Zhang, Peng Wu 等KDD 2025
- AutoGSR: Neural Architecture Search for Graph-based Session RecommendationJingfan Chen, Guanghui Zhu, Haojun Hou, Chunfeng Yuan 等SIGIR 2022 · 被引用 25 次
