Skip to content

BehaveRec: When Does Long-Term Behavioral History Help Sequential Recommendation? A Study with Session, History, and Community Signals

Oct 2026 · 0 citations · 18 references
Computer Science

TL;DR

This work proposes BehaveRec, a three-signal framework combining a causal session transformer, a bidirectional User History Encoder over a 90-day window, and a GraphSAGE module over a user-user graph built from behavioral embedding similarity rather than item co-occurrence; a learned gate blends the three signals per user.

Abstract

Sequential recommendation models typically predict a user's next action from recent session interactions, which limits personalization when short-term signals are weak or ambiguous. Rather than assuming that incorporating longer-term history and community signals is universally beneficial, we study when it actually helps. We propose BehaveRec, a three-signal framework combining a causal session transformer, a bidirectional User History Encoder over a 90-day window, and a GraphSAGE module over a user-user graph built from behavioral embedding similarity rather than item co-occurrence; a learned gate blends the three signals per user. On an industrial dataset of 137M sequences from 12.6M users, BehaveRec improves R@5 by +3.2% over SASRec, with a larger-capacity SASRec baseline (more parameters than BehaveRec) still trailing by +2.5%, ruling out capacity as the explanation. More importantly, a user-level stratification by history length reveals a clear dose-response relationship: BehaveRec's advantage is negligible below roughly 10 interactions and grows monotonically with history richness, reaching +0.017 R@5 for users with 101+ events. This pattern is corroborated across one industrial and three public datasets spanning history-rich to history-sparse regimes, where session-only models remain preferable. These headline results, and the resulting deployment threshold, are established for category-level intent prediction; a preliminary, single-run check on the full item-level vocabulary yields a directionally mixed result and is scoped as an open question rather than a claim. We use these results to derive a practical deployment rule -- roughly 20 interactions per user -- for when long-term history and behavioral-graph signals are worth their added complexity. Despite this added complexity, BehaveRec remains lightweight: it uses 5.67M parameters and trains on a single GPU in under two days.

View source

Similar papers

Preprint Sep 2026

When LLM-Inferred User Context Adds Value in Production Streaming Recommendation

Contextual information in recommender systems is shifting from static, predefined variables toward latent representations inferred from behavior. Large language models support this shift by rendering an unstructured interaction history as a natural-language summary, which yields a thematic user context that can be enco...

M. Sabouri, Neeraj Sharma, Sardar Hamidian et al. · 0 citations
#machine learning Preprint Sep 2026

KuaFu: Compressing Long User Behavior into Understanding at Billion Scale

KuaFu is a unified behavior-compression layer whose minimal unit is one behavior item, with fidelity-oriented four-stage training and layered intermediate evaluation, which matches or exceeds uncompressed single-task production models on all five headline metrics, raises per-GPU throughput by 37%-350%, and saves 190 GP...

Jia-Hao Hui, Lin Zhu, Beng-Siang Tan et al. · 0 citations
Open access Sep 2026

Dual stream adaptive sequential recommendation

The results show that DSASR consistently outperforms existing methods, making the recommendations more personalized than existing systems, due to the Consistency Gate computing a personalized blend weight for each user, which takes user demographic attributes as well as preference drift into account.

Swastika Ghosh, Sourav Mandal, Rohini Basak et al. · 0 citations
Book Open access Sep 2026

Beyond Passive Preference Inference: User-Governed Preference Memory and Calibrated Initiative in Recommender Systems

Recommender systems remain organized around passive preference inference: estimate latent interest from behavioral traces, then rank. Past: implicit feedback, matrix factorization, learning-to-rank, and large-scale offline evaluation made this abstraction highly productive. Present: four mismatches expose what predicti...

Kai-Wen Deng, Hao Jiang, Jia-Xin Cheng et al. · 0 citations
Book Open access Sep 2026

UniTraj: Cross-Domain Long-Sequence Modeling for Commercial Recommendation

Long-sequence modeling is increasingly important in recommender systems for capturing users’ evolving and long-term interests. In advertising, however, user interaction histories are often highly sparse due to limited exposure opportunities, making ad-only behavior sequences insufficient for effective long-sequence rec...

Xian Hu, Ming Yue, Zhi-Xiang Feng et al. · 0 citations
Conference Sep 2026

Simple, Fresh, and Fair: Revisiting Linear Collaborative Filtering for Large-Scale Job Recommendation

Job-board recommendation is shaped by two pressures that are rarely studied together: which model family wins under a single controlled protocol, and how quickly recommendation quality decays as the job catalog churns. We study both on a large real-world job-application log (about 40.4 million applications, August to N...

K. Uyar, Kutay Acar · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.