AlphaFree: Recommendation Free from Users, IDs, and GNNs
Not on the map. Why?
Abstract (arXiv)
Can we design effective recommender systems free from users, IDs, and GNNs? Recommender systems are central to personalized content delivery across domains, with top-K item recommendation being a fundamental task to retrieve the most relevant items from historical interactions. Existing methods rely on entrenched design conventions, often adopted without reconsideration, such as storing per-user embeddings (user-dependent), initializing features from raw IDs (ID-dependent), and employing graph neural networks (GNN-dependent). These dependencies incur several limitations, including high memory costs, cold-start and over-smoothing issues, and poor generalization to unseen interactions. In this work, we propose AlphaFree, a novel recommendation method free from users, IDs, and GNNs. Our main ideas are to infer preferences on-the-fly without user embeddings (user-free), replace raw IDs with language representations (LRs) from pre-trained language models (ID-free), and capture collaborative signals through augmentation with similar items and contrastive learning, without GNNs (GNN-free). Extensive experiments on various real-world datasets show that AlphaFree consistently outperforms its competitors, achieving up to around 40% improvements over non-LR-based methods and up to 5.7% improvements over LR-based methods, while significantly reducing GPU memory usage by up to 69% under high-dimensional LRs.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 33 of its 69 references that are in the map. First posted on arXiv 3 Mar 2026.
Builds on
33 of 69 references.
References · 33
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2017Billion-scale similarity search with GPUscited by 2,477
- 2020Graph Contrastive Learning with Augmentationscited by 1,203
- 2025Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Modelscited by 1,175
- 2018Self-Attentive Sequential Recommendationcited by 1,169
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2017Neural Collaborative Filteringcited by 1,108
- 2018Deep Graph Infomaxcited by 1,101
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
- 2019Neural Graph Collaborative Filteringcited by 660
21 more
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
- 2022Recommendation as Language Processing (RLP): A Unified Pretrain, Personalized Prompt & Predict Paradigm (P5)cited by 396
- 2022Text and Code Embeddings by Contrastive Pre-Trainingcited by 358
- 2023TALLRec: An Effective and Efficient Tuning Framework to Align Large Language Model with Recommendationcited by 336
- 2024Bridging Language and Items for Retrieval and Recommendation: Benchmarking LLMs as Semantic Encoderscited by 213
- 2023Representation Learning with Large Language Models for Recommendationcited by 155
- 2024A Comprehensive Survey of Small Language Models in the Era of Large Language Models: Techniques, Enhancements, Applications, Collaboration with LLMs, and Trustworthinesscited by 125
- 2019Embarrassingly Shallow Autoencoders for Sparse Datacited by 93
- 2023On Generative Agents in Recommendationcited by 88
- 2024On Softmax Direct Preference Optimization for Recommendationcited by 64
- 2022Self-Guided Learning to Denoise for Robust Recommendationcited by 24
- 2023Data Scarcity in Recommendation Systems: A Surveycited by 17
- 2017BiRank: Towards Ranking on Bipartite Graphscited by 15
- 2023Contrastive Collaborative Filtering for Cold-Start Item Recommendationcited by 15
- 2020Signed Graph Diffusion Networkcited by 13
- 2024A Comprehensive Review of Recommender Systems: Transitioning from Theory to Practicecited by 13
- 2021Aligning Cross-lingual Sentence Representations with Dual Momentum Contrastcited by 7
- 2022Time-aware Random Walk Diffusion to Improve Dynamic Graph Learningcited by 7
- 2025Multi-Behavior Recommender Systems: A Surveycited by 4
- 2023Learning Disentangled Representations in Signed Directed Graphs without Social Assumptionscited by 2
- 2025Linear Item-Item Model with Neural Knowledge for Session-based Recommendationcited by 1
Built on by
Not cited yet.