REVIEW 3 cited by
Towards Scalable Semantic Representation for Recommendation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
With recent advances in large language models (LLMs), there has been emerging numbers of research in developing Semantic IDs based on LLMs to enhance the performance of recommendation systems. However, the dimension of these embeddings needs to match that of the ID embedding in recommendation, which is usually much smaller than the original length. Such dimension compression results in inevitable losses in discriminability and dimension robustness of the LLM embeddings, which motivates us to scale up the semantic representation. In this paper, we propose Mixture-of-Codes, which first constructs multiple independent codebooks for LLM representation in the indexing stage, and then utilizes the Semantic Representation along with a fusion module for the downstream recommendation stage. Extensive analysis and experiments demonstrate that our method achieves superior discriminability and dimension robustness scalability, leading to the best scale-up performance in recommendations.
Forward citations
Cited by 3 Pith papers
-
OneShot: Index-in-Ranking with Neural Scoring for Large-Scale Retrieval
OneShot trains hierarchical item codebooks jointly with the ranking loss, enabling nonlinear neural scoring in billion-scale retrieval and reporting +20% recall, 10x fewer dense-ranked items, and live Instagram gains.
-
Empowering Large Language Model for Sequential Recommendation via Multimodal Embeddings and Semantic IDs
MME-SID improves LLM-based sequential recommendation by fusing collaborative, text, and image embeddings with quantized semantic IDs, using MMD reconstruction and code-embedding initialization.
-
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 independ...
Discussion (0). Continue with ORCID to comment.