mlsanityData to 7 Oct 2026

Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering Approach

arXiv 2007.04833 ↗First posted 9 Jul 2020cs.IR cs.LGcited by 20

Not on the map. Why?

Abstract (arXiv)

Recommendation models can effectively estimate underlying user interests and predict one's future behaviors by factorizing an observed user-item rating matrix into products of two sets of latent factors. However, the user-specific embedding factors can only be learned in a transductive way, making it difficult to handle new users on-the-fly. In this paper, we propose an inductive collaborative filtering framework that contains two representation models. The first model follows conventional matrix factorization which factorizes a group of key users' rating matrix to obtain meta latents. The second model resorts to attention-based structure learning that estimates hidden relations from query to key users and learns to leverage meta latents to inductively compute embeddings for query users via neural message passing. Our model enables inductive representation learning for users and meanwhile guarantees equivalent representation capacity as matrix factorization. Experiments demonstrate that our model achieves promising results for recommendation on few-shot users with limited training ratings and new unseen users which are commonly encountered in open-world recommender systems.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 4; 2023: 7; 2024: 4; 2025: 2; 2026: 1.

20 papers.

Sort:

  1. 2023NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classificationcited by 207
  2. 2022Handling Distribution Shifts on Graphs: An Invariance Perspectivecited by 163
  3. 2021Open-world Machine Learning: Applications, Challenges, and Opportunitiescited by 34
  4. 2023QKSAN: A Quantum Kernel Self-Attention Networkcited by 23
  5. 2021Towards Open-World Feature Extrapolation: An Inductive Graph Learning Approachcited by 20
  6. 2024Inductive Cognitive Diagnosis for Fast Student Learning in Web-Based Online Intelligent Education Systemscited by 15
  7. 2023Multi-task Item-attribute Graph Pre-training for Strict Cold-start Item Recommendationcited by 13
  8. 2023GraphGLOW: Universal and Generalizable Structure Learning for Graph Neural Networkscited by 12
  9. 2022The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithmcited by 9
  10. 2024Improved Diversity-Promoting Collaborative Metric Learning for Recommendationcited by 9
  11. 2023EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learningcited by 7
  12. 2023Towards Open-world Cross-Domain Sequential Recommendation: A Model-Agnostic Contrastive Denoising Approachcited by 4
8 more
  1. 2022Generalization Bounds for Inductive Matrix Completion in Low-noise Settingscited by 2
  2. 2023Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solutioncited by 1
  3. 2024Multi-Channel Hypergraph Contrastive Learning for Matrix Completioncited by 1
  4. 2022SUPER-Rec: SUrrounding Position-Enhanced Representation for Recommendationcited by 0
  5. 2024One Subgraph for All: Efficient Reasoning on Opening Subgraphs for Inductive Knowledge Graph Completioncited by 0
  6. 2025Differentially Private Relational Learning with Entity-level Privacy Guaranteescited by 0
  7. 2025Unifying Inductive, Cross-Domain, and Multimodal Learning for Robust and Generalizable Recommendationcited by 0
  8. 2026Social Knowledge for Cross-Domain User Preference Modelingcited by 0