The paper introduces CRAFT, a Contextual Residual Adaptive Feature Transport block that treats unified recommendation models as a discrete context‑conditioned representation evolution process. By summarizing non‑sequential features into a reliability‑aware contextual field, CRAFT generates residual displacement and memory‑preserving signals to control intent and sequence representations. Experiments on the TAAC2026 competition show CRAFT achieving a test AUC of 0.838090, surpassing the previous best, and further improvements with deeper or wider models.
arXiv:2607. 24804v2 Announce Type: replace-cross Abstract: Recommendation systems have undergone significant transformations in the past years.
arXiv:2608. 16797v1 Announce Type: cross Abstract: Industrial recommenders rely on two model families that have evolved largely independently: feature-interaction models over multi-field user/item features, and sequential models over user-behavior histories.
arXiv:2607. 17017v1 Announce Type: cross Abstract: As scalability becomes increasingly important in recommendation modeling, recent architectures have advanced the modeling of two broad sources of ranking signals along separate paths: non-sequence features, including user, item, context, and cross features; and sequence features from user behavior histories.
arXiv:2608. 15429v1 Announce Type: new Abstract: Prior embedding models for sequential recommendation typically operate within a homogeneous action space, limiting their ability to capture cross-surface behavioral signals spanning distinct behavioral domains.
arXiv:2607. 22700v1 Announce Type: new Abstract: Post-click conversion rate (PCVR) prediction is central to industrial recommendation, but remains challenged by the structural mismatch between sparse, unordered multi-field features and long, domain-specific behavior histories.
The paper introduces DSRec, a dual‑interest sequential recommendation model that separates item representations into long‑term and short‑term semantic contexts. Long‑term embeddings capture stable preferences through historical aggregation, while short‑term embeddings focus on local session intent modulated by inter‑click time intervals. Each branch is processed by a distinct State Space Model— a full‑sequence Mamba for long‑term modeling and a time‑modulated SSM for short‑term dynamics— and a residual cross‑fusion mechanism aligns the two granularities while preserving their independence. Experiments on public benchmarks show that DSRec outperforms state‑of‑the‑art methods.
arXiv:2606. 25147v1 Announce Type: cross Abstract: User modeling in industrial recommender systems typically produces dense embeddings, which suffer from representational constraints inherent to fixed-dimensional vectors.
arXiv:2607. 10016v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly used as backbone architectures for recommender systems because of their strong sequence modeling and representation learning capabilities.
arXiv:2607. 24845v1 Announce Type: cross Abstract: Large language models (LLMs) have been applied to sequential recommendation by formulating it as a natural language task.
arXiv:2606. 11023v1 Announce Type: cross Abstract: Sequential recommendation aims to predict users' next interaction with items by analyzing their historical behavior.
SequenceO1 is an end‑to‑end framework that enables ultra‑long (up to 100K interactions) sequence modeling for recommendation systems. It compresses raw user histories into a fixed‑size sketch using Sketch Attention and then models short‑term and long‑term interests with Target‑to‑History Cross Attention. The system incorporates low‑rank caching, batching, pipeline lift, and a FlashSA kernel to keep training and inference efficient, achieving consistent offline and online performance gains when deployed at full traffic on Douyin.
The paper introduces an action‑on‑item schema that pairs interaction roles with content embeddings, enabling a shared update mechanism across different user history types such as movies, news, and dialogue. It demonstrates theoretical properties like invariance to relabeling and bounded state changes, and presents the Multi‑Timescale State Hypothesis (MTSH) implemented in PerTIDE. Experiments on PENS, MovieLens, and MIND datasets show that a frozen source‑trained core outperforms random baselines and that PerTIDE achieves significant MRR gains over comparable models.