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.
arXiv:2607. 25216v1 Announce Type: cross Abstract: Semantic ID-based generative recommendation tokenizes each item into a sequence of discrete semantic IDs and predicts the next item by generating semantic IDs.
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: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...
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: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:2607. 25209v1 Announce Type: cross Abstract: Generative recommendation commonly represents items using fixed-length semantic identifiers (SIDs) constructed through clustering and quantization.
FineSID introduces a new quantization framework for semantic identifier learning in generative recommendation systems. By replacing the traditional Top‑1 hard assignment with a soft, differentiable approach, it distributes gradient updates across all codewords, leading to balanced codebook optimization and reduced identifier collisions. Experiments on public benchmarks show that FineSID improves codebook utilization and recommendation accuracy without relying on complex initialization strategies.
arXiv:2509. 25522v3 Announce Type: replace Abstract: Recent advancements in generative models have allowed the emergence of a promising paradigm for recommender systems (RS), known as Generative Recommendation (GR), which tries to unify rich item semantics and collaborative filtering signals.
arXiv:2608. 10929v1 Announce Type: new Abstract: Cross-domain recommendation (CDR) transfers preference knowledge across related domains, but federated deployment makes cross-domain alignment difficult because the behavioral anchors that align item spaces, such as overlapping users and shared interaction signals, are often sparse, unavailable, or privacy-sensitive across clients.
Refine-POI introduces a reinforcement fine-tuned framework for next point-of-interest recommendation that tackles two key issues: topology-blind indexing of semantic IDs and the limitation of supervised fine-tuning to top‑1 predictions. It uses a hierarchical self‑organizing map to generate topology‑aware semantic IDs and a policy‑gradient approach to produce top‑k recommendation lists. Experiments on three real‑world datasets show that Refine‑POI outperforms state‑of‑the‑art baselines, combining LLM reasoning with accurate, explainable recommendations.
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%.