Metraipolis › archive › dc_a04fe0b28161

Rethinking Semantic ID Construction for Generative Recommendation: SimHash with Parallel Decoding and Semantic Alignment — arXiv:2610.07402

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.07402
License (as archived)
CC0-1.0
Archived
2026-10-07T12:34:54.553Z
SHA-256 of the archived text
9d82e992f0e0bdf04249ea44310ad39788e68903e554db4927493d05a0e33ffd
Stable URL of this page
https://metraipolis.com/documento/dc_a04fe0b28161

How to cite

Rethinking Semantic ID Construction for Generative Recommendation: SimHash with Parallel Decoding and Semantic Alignment — arXiv:2610.07402 — arXiv (en), https://arxiv.org/abs/2610.07402 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a04fe0b28161 (Metraipolis archive dc_a04fe0b28161, sha256 9d82e992f0e0bdf04249ea44310ad39788e68903e554db4927493d05a0e33ffd)
BibTeX
@misc{dca04fe0b28161,
  title = {Rethinking Semantic ID Construction for Generative Recommendation: SimHash with Parallel Decoding and Semantic Alignment — arXiv:2610.07402},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.07402},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a04fe0b28161; sha256 9d82e992f0e0bdf04249ea44310ad39788e68903e554db4927493d05a0e33ffd},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07402. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Semantic ID-based generative recommendation represents each item as a sequence of discrete tokens, enabling structured modeling of item semantics. A critical challenge is constructing semantic IDs that are both semantically expressive and computationally efficient. While recent approaches favor complex learned quantization, simple hashing-based methods such as SimHash are widely regarded as fundamentally inferior. In this work, we challenge this consensus by showing that the apparent performance gap does not stem from inherent limitations of hashing, but rather from a structural mismatch with autoregressive decoding, coupled with the inevitable information loss during rigid discretization. Based on this insight, we propose FLASH, a two-stage framework that revitalizes training-free SimHash tokenization through parallel decoding and explicit semantic alignment. Despite its simplicity, FLASH achieves state-of-the-art performance across multiple datasets without requiring any tokenizer training, while exhibiting stronger generalization in cold-start scenarios. Notably, we demonstrate that semantic alignment acts as a universally effective mechanism across diverse paradigms. Our findings suggest that, with compatible decoding and semantic grounding, simple and efficient tokenizers can achieve performance comparable to complex learned counterparts in generative recommendation. Our code is available at this https URL .

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.IR, nuovi lavori del giorno).
Categorie arXiv: Information Retrieval (cs.IR).
Pagina del lavoro: https://arxiv.org/abs/2610.07402 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T12:07:32.548Z dalla pagina https://arxiv.org/list/cs.IR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).