Control via Request-Aware Masking for Editing Recommenders (CRAMER), a framework that takes users' natural-language requests to immediately change sequential recommendation models' behavior, establishing a new paradigm for request-aware sequential recommendation.
Abstract
Sequential recommendation models, while powerful, have limited flexibility in responding to immediate user requests, making it difficult to adapt their recommendations to the user's timely interests. Unfortunately, existing user request adaptation methods often incur high computational overhead due to either 1) retraining the entire backbone network or 2) leveraging the inference ability of large language models (a.k.a. prompt engineering), limiting their applicability in large-scale recommendation services. This paper presents Control via Request-Aware Masking for Editing Recommenders (CRAMER), a framework that takes users'natural-language requests to immediately change sequential recommendation models'behavior. Specifically, inspired by the model control theory, CRAMER treats user requests as control signals to modulate frozen backbone parameters through masking, achieving instant adaptation to diverse requests while avoiding costly retraining. Experiments on multiple large-scale benchmark datasets show that CRAMER outperforms four state-of-the-art request-aware baselines across multiple recommendation metrics while achieving minimal overhead. Moreover, the proposed framework exhibits enhanced controllability and cross-domain adaptability, establishing a new paradigm for request-aware sequential recommendation.
Experiments on five real-world datasets show that \textsc{DS-Frame} consistently improves representative sequential recommendation backbones, with larger gains on challenging groups and effective accuracy--efficiency trade-offs, highlighting the potential of adaptive inference for more efficient and robust recommendati...
Zichen Yuan, Xiao-Xuan Dong, Linkun Dai et al.· 0 citations
Traditional recommender systems are typically trained to predict what item users will interact with next, but not why. However, offering personalized evidence for why a user might like the predicted item is an important way to enhance the service and to raise the likelihood that the user will be genuinely interested in...
Historically, recommendation systems have focused on maximizing precision by treating user preference as a static, predictable target. However, this approach ignores both the inherent randomness of human behavior and the model’s own varying levels of confidence. To compensate, many industrial systems rely on "reserved...
Nitu Sharaff, Brian Y. C. Leung, Shawn Andrews et al.· Proceedings of the 20th ACM...· 0 citations
This work proposes a novel Token Selection approach for Preference Optimization in LLM-based sequential Recommendation, i.e., TSPORec, which accurately pinpoints informative tokens throughout the entire textual content to improve recommendation performance.
Wenqiao Zhu, Chao Xu, Haipang Wu et al.· 0 citations
Transformer-based models have become the cornerstone of sequential recommendation, yet they are often perceived either as rigid engineering recipes or as a collection of disconnected architectures. This tutorial demystifies these systems by centering on a provocative guiding question: “What is not sequential recommenda...
J. Lichtenberg, A. V. Petrov· Proceedings of the 20th ACM...· 0 citations
Modern recommender systems often rely on multiple retrieval sources to generate candidate items, yet determining optimal quota allocation across these sources remains challenging. We present Mixture of Retrieval (MoR) bandit, a novel framework that dynamically optimizes retrieval allocation by balancing long-term user...
Yan Fu, Ron Peled, Brian Biesel et al.· Proceedings of the 20th ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.