RPG replaces autoregressive semantic ID generation with parallel multi-token prediction plus graph-constrained decoding, improving NDCG@10 by about 12.6% over generative baselines while keeping inference cost independent of catalog size.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Generating Long Semantic IDs in Parallel for Recommendation
RPG replaces autoregressive semantic ID generation with parallel multi-token prediction plus graph-constrained decoding, improving NDCG@10 by about 12.6% over generative baselines while keeping inference cost independent of catalog size.