TSPORec: Token Selection via Preference Optimization for LLM-Based Sequential Recommendation
arXiv:2608. 09605v1 Announce Type: cross Abstract: Large Language Models (LLMs) have emerged as powerful tools for improving recommendation systems.
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:2608. 09605v1 Announce Type: cross Abstract: Large Language Models (LLMs) have emerged as powerful tools for improving recommendation systems.
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. 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. 19635v1 Announce Type: cross Abstract: Large Recommendation Models (LRMs) have demonstrated promising capabilities in industry-scale recommendation tasks.
The paper introduces Tlow, a flow-based item tokenizer that transforms raw semantic embeddings into a latent space following a standard normal distribution, enabling independent tokenization and simplifying distributional complexity. Tlow incorporates codebook guidance to align token embeddings with the codebook space, producing semantically clear token IDs. Experiments on four public datasets and an online multi‑modal retrieval task on WeChat show that Tlow improves recommendation performance and increases user click‑through rates by over 10%.
The paper introduces ED$^2$, an end‑to‑end large language model–based sequential recommender that integrates index generation and recommendation through a dual dynamic index mechanism. It employs a multigrained token regulator for alignment supervision and custom instruction‑tuning tasks to capture high‑order user‑item interactions. Experiments on three public datasets show ED$^2$ outperforms baselines with an average 19.62% gain in Hit‑Rate and 21.11% in NDCG.
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:2511.22707v2 Announce Type: replace-cross Abstract: In web environments, user preferences are often refined progressively as users move from browsing broad categories to exploring specific item...
arXiv:2608. 07816v1 Announce Type: cross Abstract: Recent advances in generative recommendation (GR) leverage large language models (LLMs) as recommender backbones, enabling LLMs to directly generate recommendations conditioned on item-interaction histories.
arXiv:2607. 24865v1 Announce Type: cross Abstract: Large-scale recommendation systems face "Memory Wall" bottlenecks due to massive, dense embedding tables.
arXiv:2512. 10388v3 Announce Type: replace-cross Abstract: Conventional Sequential Recommender Systems (SRS) typically assign unique hash IDs (HID) to construct item embeddings, which mainly capture collaborative signals from historical user-item interactions.
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.