arXiv Machine Learning

Alternatives to Shallow Autoencoders for Collaborative Filtering

arXiv Machine Learning
Oct 28

Discovering Topics from Linear Autoencoders

The paper shows that latent topics can be extracted directly from the weight matrix of a closed‑form linear autoencoder under a latent‑factor model of user‑item interactions. These topics enable interpretation of recommendations without extra training, and the authors introduce item and user normalizations to mitigate dominance by popular items or active users. Experiments on six public datasets demonstrate that the method outperforms dedicated topic models in topic quality and matches or exceeds the best linear autoencoder, while maintaining competitive recommendation performance.

By Jutiyakhun Srisoparp, Donlapark Ponnoprat
arXiv AI
Sep 12

On the Regularization Landscape for the Linear Recommendation Models

The paper investigates why many state‑of‑the‑art recommendation algorithms, despite using diverse deep‑learning techniques, achieve similar performance. It shows that the key commonality is a regularizer: either a nuclear‑norm or a Frobenius‑norm term. The authors further propose two new low‑rank, closed‑form solutions that combine the advantages of both regularizers.

By Dong Li, Zhenming Liu, Ruoming Jin, Hao Zhou, Zhi Liu, Jing Gao, Bin Ren
arXiv Machine Learning
Jul 14

ZoRRO: A Zero-Weight Personalized Recommender System for Scalable News Recommendation

arXiv:2607. 10910v1 Announce Type: cross Abstract: We present ZoRRO (Zero-Weight Personalized Recommender System), a zero-weight, training-free framework for personalized news recommendation designed for scalable real-world deployment.

By Johannes Kruse, Ryotaro Shimizu, Kasper Lindskow, Jon Tofteskov, Michael Riis Andersen, Julian McAuley, Jes Frellsen
arXiv AI
6d ago

PRISM: Personalized Item Representations in User History

PRISM introduces personalized item representations in user history, allowing each item’s embedding to reflect its relationship to a specific user rather than using a shared embedding across all users. The method leverages upstream ranking computations and an autoencoder to compress user and item tower states into a single embedding per scored pair for downstream replay. Offline tests on a billion‑scale recommendation surface show a modest but measurable improvement in downstream normalized entropy, with gains scaling with sequence length according to a power‑law relationship.

By Renzhi Wu, Zikun Cui, Junjie Yang, Li Sheng, Yongjun Xie, Jerry Fu, Nipun Mathur, Sri Reddy, Hong Li
arXiv Computation and Language
Oct 7

Enhancing High-order Interaction Awareness in LLM-based Recommender Model

The paper introduces ELMRec, an enhanced LLM-based recommender that improves high-order interaction awareness by using whole-word embeddings to better interpret graph-constructed user-item interactions without graph pre-training. It also identifies that LLMs tend to prioritize earlier user interactions over recent ones and proposes a reranking solution. ELMRec achieves superior performance compared to state-of-the-art methods in both direct and sequential recommendation tasks.

By Xinfeng Wang, Jin Cui, Fumiyo Fukumoto, Yoshimi Suzuki
arXiv AI
Sep 7

Graph Foundation Models for Recommendation: A Comprehensive Survey

The article surveys graph foundation models (GFMs) for recommender systems, highlighting how they combine graph neural networks (GNNs) and large language models (LLMs) to better capture user-item relationships and textual data. It offers a taxonomy of current GFM approaches, discusses methodological details, and identifies key challenges and future research directions. The survey aims to provide comprehensive insights into the evolving landscape of GFM-based recommender systems.

By Bin Wu, Yihang Wang, Yuanhao Zeng, Jiawei Liu, Jiashu Zhao, Cheng Yang, Yawen Li, Long Xia, Dawei Yin, Chuan Shi
Hugging Face Trending Papers
Jul 14

SlimPer: Make Personalization Model Slim and Smart

Transformer-style architectures are increasingly adopted for industrial recommendation systems, yet they inherit a design premise misaligned with the task: generative models rely on per-token autoregressive prediction, which justifies maintaining large intermediate tensors that scale with sequence length. In contrast, recommendation systems produce a single set of relevance scores for each pair without token-level supervision.