Pith. sign in

REVIEW 4 cited by

Hi-Gen: Generative Retrieval For Large-Scale Personalized E-commerce Search

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

arxiv 2404.15675 v2 pith:LKWG74KB submitted 2024-04-24 cs.IR

Hi-Gen: Generative Retrieval For Large-Scale Personalized E-commerce Search

classification cs.IR
keywords informatione-commercehi-genlarge-scaleretrievalsearchdecodingefficiency
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Leveraging generative retrieval (GR) techniques to enhance search systems is an emerging methodology that has shown promising results in recent years. In GR, a text-to-text model maps string queries directly to relevant document identifiers (docIDs), dramatically simplifying the retrieval process. However, when applying most GR models in large-scale E-commerce for personalized item search, we must face two key problems in encoding and decoding. (1) Existing docID generation methods ignore the encoding of efficiency information, which is critical in E-commerce. (2) The positional information is important in decoding docIDs, while prior studies have not adequately discriminated the significance of positional information or well exploited the inherent interrelation among these positions. To overcome these problems, we introduce an efficient Hierarchical encoding-decoding Generative retrieval method (Hi-Gen) for large-scale personalized E-commerce search systems. Specifically, we first design a representation learning model using metric learning to learn discriminative feature representations of items to capture semantic relevance and efficiency information. Then, we propose a category-guided hierarchical clustering scheme that makes full use of the semantic and efficiency information of items to facilitate docID generation. Finally, we design a position-aware loss to discriminate the importance of positions and mine the inherent interrelation between different tokens at the same position. This loss boosts the performance of the language model used in the decoding stage. Besides, we propose two variants of Hi-Gen (Hi-Gen-I2I and Hi-Gen-Cluster) to support online real-time large-scale recall in the online serving process. Hi-Gen gets 3.30% and 4.62% improvements over SOTA for Recall@1 on the public and industry datasets, respectively.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Beyond Matching: Category-Guided Latent Intent Reasoning for Generative Retrieval in E-Commerce

    cs.IR 2026-06 unverdicted novelty 7.0

    CaLIR learns continuous latent intent states guided by product category hierarchies for generative retrieval, combining hierarchical reasoning and dynamic prefix tries to balance effectiveness and low-latency inferenc...

  2. TSGR: Taobao Search Generative Retrieval

    cs.IR 2026-07 conditional novelty 5.0

    TSGR makes Taobao search retrieval value-aware by ordering item IDs by clicks and query intent and re-ranking generated candidates with a value module, improving HR@1000 and GMV.

  3. Efficient Generative Retrieval for E-commerce Search with Semantic Cluster IDs and Expert-Guided RL

    cs.IR 2026-05 unverdicted novelty 5.0

    CQ-SID semantic IDs and EG-GRPO RL improve generative retrieval hit rates up to 26.76% over RQ-VAE baselines and deliver +1.15% GMV in live e-commerce A/B tests.

  4. Mitigating Collaborative Semantic ID Staleness in Generative Retrieval

    cs.IR 2026-04 unverdicted novelty 5.0

    A model-agnostic SID alignment update mitigates staleness from temporal drift in user-item interactions for generative retrievers, improving Recall@K and nDCG@K while reducing compute by 8-9x versus full retraining.