arXiv Machine Learning

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.

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 AI
Oct 28

Counterfactual Profile Perturbations for Recommendation Explanations: A Reproducibility Study

This reproducibility study investigates the counterfactual explanation method Learning to eXplain Recommendations (LXR) by extending its application beyond the top‑ranked item to other recommended items. The authors compare LXR against alternative baselines such as item popularity and latent factor similarity, noting that these baselines perform surprisingly well on certain tasks. They also analyze how item popularity affects explanation quality, finding that LXR produces shorter perturbations for less popular items, and conduct a brute‑force search to estimate a lower bound on optimal perturbation size.

By Meysam Varasteh, Elizabeth McKinnie, Robin Burke
Hugging Face Trending Papers
Jul 23

Probabilistic Residual Learning for Online Recommendations

Modern recommender systems are typically based on deep learning (DL) models, where a dense encoder learns representations of users and items. As a result, these systems often suffer from the black-box nature and computational complexity of the underlying models, making it difficult to systematically enhance their recommendation capabilities.

arXiv AI
Jul 24

Probabilistic Residual Learning for Online Recommendations

arXiv:2607. 20863v1 Announce Type: cross Abstract: Modern recommender systems are typically based on deep learning (DL) models, where a dense encoder learns representations of users and items.

By Wenyuan Wang, Yusong Zhao, Zihao Xu, Hengyi Wang, Qi Xu, Zhigang Hua, Yan Xie, Yi Wang, Zihao Zhao, Bo Long, Chengzhi Mao, Shuang Yang, Hengguan Huang, Hao Wang
arXiv AI
Oct 7

Contrastive Learning for Aspect Representation towards Explainable Recommendation

The paper introduces CLARER, a recommendation model that fuses aspect features extracted from textual reviews with rating data to enhance recommendation accuracy and explainability. It learns user and item representations by combining rating-based features via an MLP and aspect-based features via a transformer encoder with contrastive learning. A transformer decoder then generates explanations using the combined representations, and experiments on three benchmark datasets show superior performance over baseline methods in both recommendation accuracy and explanation generation.

By Emrul Hasan, Chen Ding