arXiv AI

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.

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 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 Machine Learning
Jul 14

RecRec: Recursive Refinement for Sequential Recommendation

arXiv:2607. 10541v1 Announce Type: cross Abstract: Sequential recommender systems typically infer user preferences through single-pass encoding of interaction histories without iterative refinement, relying on increasingly deep architectures to capture complex patterns.

By Pervez Shaik, Prosenjit Biswas, Abhinav Thorat, Ravi Kolla, Niranjan Pedanekar
arXiv AI
Sep 10

Neutralizing Popularity Bias in LLM-based Recommendation via Counterfactual Reasoning Guidelines

The paper introduces NPRec, a model‑agnostic framework that uses counterfactual reasoning to neutralize popularity bias in large language model–based recommender systems. By generating debiased textual guidelines that separate intrinsic user interests from popularity signals, NPRec injects these guidelines at inference time to guide the LLM’s generation without updating parameters. Experiments on three real‑world datasets show improved recommendation accuracy, explanation quality, and debiasing performance.

By Guanrong Li, Haolin Yang, Xinyu Liu, Zhen Wu, Rui Xia, Xinyu Dai
arXiv Machine Learning
Aug 28

Incremental Recommendation via Causal Models

The paper proposes an incremental recommendation system that uses causal modeling to avoid delivering redundant recommendations. By leveraging existing holdback data and a dual‑threshold targeting policy, the authors reduce recommendation impressions by 7% without harming overall content consumption. Joint training with holdback data also improves the calibration of the treated model, suggesting better generalisable representations than purely observational models.

By Athanasios Vlontzos, David Gustafsson, Michael O'Riordan, Ciar\'an M. Gilligan-Lee
Hugging Face Trending Papers
Aug 27

Incremental Recommendation via Causal Models

The paper proposes an incremental recommendation approach that uses a causal model built from existing holdback data to avoid delivering redundant recommendations. By applying a dual‑threshold targeting policy, the system only recommends content when the likelihood of a treated stream is high and the likelihood of an organic stream is low, thereby reducing recommendation impressions by 7% without hurting overall consumption. Joint training with holdback data also improves the calibration of the treated head, suggesting that causal models capture more generalisable representations than purely observational models.