DREAM: Dynamic Refinement of Early Assignment Mappings

• URL: http://arxiv.org/abs/2606.06947v1
• Date: Fri, 05 Jun 2026 06:21:01 GMT
• Title: DREAM: Dynamic Refinement of Early Assignment Mappings
• Abstract summary: Current methods assign each item a single static identifier through offline tokenization before sufficient user feedback is observed.<n>We identify this one-shot commitment as the fundamental cold-start bottleneck in SID-based generative recommendation.<n>We propose DREAM, a three-stage framework that resolves this flaw through progressive refinement.
• Score: 7.781421530363403
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generative recommendation advances item retrieval by reformulating it as autoregressive generation of Semantic IDs (SIDs), compact token sequences that encode item semantics. While SIDs offer a strong semantic prior, current SID-based methods assign each item a single static identifier through offline tokenization before sufficient user feedback is observed. For cold-start items, this one-shot commitment produces poorly discriminative codes, generating misaligned paths that remain unrefined because the associated tokens are rarely sampled during training. We identify this early static commitment, not model capacity, as the fundamental cold-start bottleneck in SID-based generative recommendation. To overcome this bottleneck and bridge the disjoint objectives of tokenization and generation, we propose DREAM (Dynamic Refinement of Early Assignment Mappings), a three-stage framework that resolves this flaw through progressive refinement. First, an intent-aware tokenizer rebuilds the SID space through counterfactual contrastive learning, generating a diverse pool of behavior-aligned candidates per cold-start item. Second, the frozen recommendation backbone serves as an evaluator, selecting the most reliable candidate based on multi-context user support without retraining. Third, a dynamic beam mechanism maintains multiple weighted SID hypotheses throughout training and inference, preventing premature collapse to a single assignment. Extensive experiments on three Amazon benchmarks show that DREAM substantially outperforms state-of-the-art generative and sequential baselines on cold-start metrics.

Related papers

• EPIC: Explicit Posterior Item Conditioning for Semantic ID Diffusion Recommendation [18.230837696789226]
  Explicit Posterior Item Conditioning introduces explicit item-level competition into SID denoising.<n>EPIC constructs a personalized posterior over feasible candidate items using the current generation context.<n>Experiments on four Amazon benchmarks show consistent improvements over strong baselines.
  arXiv  Detail & Related papers  (2026-09-03T08:21:50Z)
• Preference Shapes Relevance: Cross-component Hierarchical Semantic Alignment for Personalized Generative Retrieval [37.821022474615994]
  Generative Retrieval (GR) has emerged as a promising paradigm by mapping queries directly to Semantic IDs (SIDs) with powerful representation capabilities for candidate items.<n>Existing SIDs derived solely from item content create a semantic gap, failing to align dynamic query intents with static item representations.<n>We present a novel personalized GR framework that models user behavior by synergizing discrete SIDs for structural guidance and continuous representations for fine-grained semantic refinement.
  arXiv  Detail & Related papers  (2026-08-31T10:30:22Z)
• EchoRec: Multi-Item Prediction-Empowered Generative Recommendation via Cycle-Consistent Preference Alignment [57.08595331216049]
  Generative recommendation autoregressively generates the semantic IDs of the target item, unifying preference modeling and index retrieval within the shared token space.<n>Recent attempts have introduced Multi-Token Prediction (MTP), yet they primarily inherit its efficiency merit, leaving its potential as dense supervision unexplored.<n>We propose EchoRec, which empowers MTP with cycle-consistent holistic preference alignment across multi-horizon for generative recommendation.
  arXiv  Detail & Related papers  (2026-08-14T06:59:12Z)
• Preserving Item Semantics for Free: Rethinking Token Initialization in LLM-Based Generative Recommendation [33.094341397930776]
  In generative recommendation systems, items are often represented through semantic IDs (SIDs)<n>Standard vocabulary expansion typically initializes these tokens as random Gaussian vectors, discarding the SIDs' underlying continuous geometry.<n>We propose a simple, parameter-free intervention that initializes SID token embeddings directly from their corresponding centroids in the semantic embedding space.
  arXiv  Detail & Related papers  (2026-08-07T23:33:08Z)
• Grevo: A Unified Generative Recommendation Framework with Evolutionary Item Indexing [7.05169171974845]
  We propose a unified Generative recommendation framework with evolutionary item indexing.<n>Grevo builds on a single recommender that unifies a behavioral SID generation task and a semantic SID grounding task.<n>We show that Grevo consistently outperforms state-of-the-art generative recommendation methods.
  arXiv  Detail & Related papers  (2026-07-28T06:27:33Z)
• SAPO: Step-Aligned Policy Optimization for Reasoning-Based Generative Recommendation [43.98709365191658]
  Generative recommendation treats next-item prediction as autoregressive item-identifier generation.<n>Recent work augments this paradigm with reasoning traces and optimize them via reinforcement learning with verifiable rewards.<n>In large-catalog recommendation, exact-match feedback on the generated SID only reports whether the final item is correct.
  arXiv  Detail & Related papers  (2026-05-17T20:53:08Z)
• CapsID: Soft-Routed Variable-Length Semantic IDs for Generative Recommendation [6.439016735163573]
  Generative recommendation maps each item to a sequence of Semantic IDs (SIDs) and recasts retrieval as autoregressive token generation.<n> CAPSID replaces hard residual quantization with capsule routing.<n>On Amazon Beauty, Sports, Toys, and a 35M-item proprietary industrial catalog, CAPSID+SEMANTICBPE improves Recall at 10 by 9.6% on average over ReSID.
  arXiv  Detail & Related papers  (2026-05-06T16:33:13Z)
• IntRR: A Framework for Integrating SID Redistribution and Length Reduction [14.327886721362647]
  We propose IntRR, a novel framework that integrates objective-aligned SID Redistribution and structural Length Reduction.<n>IntRR yields substantial improvements over representative generative baselines, achieving superior performance in both recommendation accuracy and efficiency.
  arXiv  Detail & Related papers  (2026-02-24T09:09:40Z)
• GLASS: A Generative Recommender for Long-sequence Modeling via SID-Tier and Semantic Search [51.44490997013772]
  GLASS is a novel framework that integrates long-term user interests into the generative process via SID-Tier and Semantic Search.<n>We show that GLASS outperforms state-of-the-art baselines in experiments on two large-scale real-world datasets.
  arXiv  Detail & Related papers  (2026-02-05T13:48:33Z)
• Rethinking Generative Recommender Tokenizer: Recsys-Native Encoding and Semantic Quantization Beyond LLMs [17.944727019161878]
  ReSID is a principled, SID framework that recommend learning from the perspective of information preservation and sequential predictability.<n>It consistently outperforms strong sequential and SID-based generative baselines by an average of over 10%, while reducing tokenization cost by up to 122x.
  arXiv  Detail & Related papers  (2026-02-02T17:00:04Z)
• Differentiable Semantic ID for Generative Recommendation [65.83703273297492]
  Generative recommendation provides a novel paradigm in which each item is represented by a discrete semantic ID (SID) learned from rich content.<n>In practice, SIDs are typically optimized only for content reconstruction rather than recommendation accuracy.<n>A natural approach is to make semantic indexing differentiable so that recommendation gradients can directly influence SID learning.<n>We propose DIGER, a first step toward effective differentiable semantic IDs for generative recommendation.
  arXiv  Detail & Related papers  (2026-01-27T15:34:11Z)
• The Best of the Two Worlds: Harmonizing Semantic and Hash IDs for Sequential Recommendation [51.62815306481903]
  We propose textbfname, a novel framework that harmonizes the SID and HID. Specifically, we devise a dual-branch modeling architecture that enables the model to capture both the multi-granular semantics within SID while preserving the unique collaborative identity of HID.<n>Experiments on three real-world datasets show that name balances recommendation quality for both head and tail items while surpassing the existing baselines.
  arXiv  Detail & Related papers  (2025-12-11T07:50:53Z)
• DiffGRM: Diffusion-based Generative Recommendation Model [63.35379395455103]
  Generative recommendation (GR) is an emerging paradigm that represents each item via a tokenizer as an n-digit semantic ID (SID)<n>We propose DiffGRM, a diffusion-based GR model that replaces the autoregressive decoder with a masked discrete diffusion model (MDM)<n> Experiments show consistent gains over strong generative and discriminative recommendation baselines on multiple datasets.
  arXiv  Detail & Related papers  (2025-10-21T03:23:32Z)
• Unsupervised Online 3D Instance Segmentation with Synthetic Sequences and Dynamic Loss [52.28880405119483]
  Unsupervised online 3D instance segmentation is a fundamental yet challenging task.<n>Existing methods, such as UNIT, have made progress in this direction but remain constrained by limited training diversity.<n>We propose a new framework that enriches the training distribution through synthetic point cloud sequence generation.
  arXiv  Detail & Related papers  (2025-09-27T08:53:27Z)
• Recommender Systems with Generative Retrieval [58.454606442670034]
  We propose a novel generative retrieval approach, where the retrieval model autoregressively decodes the identifiers of the target candidates. To that end, we create semantically meaningful of codewords to serve as a Semantic ID for each item. We show that recommender systems trained with the proposed paradigm significantly outperform the current SOTA models on various datasets.
  arXiv  Detail & Related papers  (2023-05-08T21:48:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.