REVIEW 2 cited by
Breaking the Hourglass Phenomenon of Residual Quantization: Enhancing the Upper Bound of Generative Retrieval
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
Generative retrieval (GR) has emerged as a transformative paradigm in search and recommender systems, leveraging numeric-based identifier representations to enhance efficiency and generalization. Notably, methods like TIGER employing Residual Quantization-based Semantic Identifiers (RQ-SID), have shown significant promise in e-commerce scenarios by effectively managing item IDs. However, a critical issue termed the "\textbf{Hourglass}" phenomenon, occurs in RQ-SID, where intermediate codebook tokens become overly concentrated, hindering the full utilization of generative retrieval methods. This paper analyses and addresses this problem by identifying data sparsity and long-tailed distribution as the primary causes. Through comprehensive experiments and detailed ablation studies, we analyze the impact of these factors on codebook utilization and data distribution. Our findings reveal that the "Hourglass" phenomenon substantially impacts the performance of RQ-SID in generative retrieval. We propose effective solutions to mitigate this issue, thereby significantly enhancing the effectiveness of generative retrieval in real-world E-commerce applications.
Forward citations
Cited by 2 Pith papers
-
Generative Recommendation with Semantic IDs: A Practitioner's Handbook
An open-source framework and ablation study showing which semantic-ID generative recommendation components actually matter, with results that challenge several standard defaults.
-
RankGraph-2: Lifecycle Co-Design for Billion-Node Graph Learning in Recommendation
RankGraph-2 jointly optimizes graph subsampling, pre-computed neighborhoods, and a co-learned cluster index for billion-node recommendation retrieval, reporting 3.8x recall gains and up to +0.96% CTR.
Discussion (0). Continue with ORCID to comment.