Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.32420

Hierarchical GTV Estimation: Bridging the Gap between Container-Level Ranking and Item-Level Conversion

Zerong Lan·Fan Zhang·Chuang Chen·Tianchun Huang·Teng Zhang·Xingxing Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Emerging e-commerce platforms, such as live-streaming and Online-to-Offline (O2O) services, inherently operate under a "Container-based" display paradigm. In this setting, a critical granularity mismatch exists: the platform performs ranking and estimation at the container level (e.g., livestream rooms or stores), whereas the actual transactions occur at the item level within these containers. This structural discrepancy complicates Gross Transaction Value (GTV) estimation, introducing unique challenges including high label variance, severe label sparsity, and dynamic item heterogeneity. To address these challenges, we propose a novel framework named Hierarchical GTV Estimation (HGE). HGE employs a Hybrid Set-Aware Encoder (HSAE) to model the dynamic composition of items and feature interactions. To mitigate label variance, we introduce a Proxy-Label Learning (PLL) strategy that decomposes post-click GTV into purchase probability, quantity, and unit price. Furthermore, a Residual Correction and Ensemble Fusion (RCEF) module is designed to handle label sparsity by effectively combining item-level aggregation with container-level inference. Extensive experiments on large-scale industrial datasets demonstrate that HGE significantly outperforms state-of-the-art baselines, achieving a +0.63% lift in XAUC offline and a +1.42% increase in Revenue Per Search (RPS) in online A/B tests. HGE framework has been fully deployed into our main traffic.

Explore related subjects

cs.IR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zerong Lan, Fan Zhang, Chuang Chen, Tianchun Huang, Teng Zhang, Xingxing Wang. 2026-10-23. Hierarchical GTV Estimation: Bridging the Gap between Container-Level Ranking and Item-Level Conversion. https://doi.org/10.1145/3773078.3831759

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

From Item Scores to Semantic Tokens: Test-Time Collaborative Adaptation for Generative Recommendation

Generative recommenders using semantic identifiers predict items through successive token decisions, but beam search may irreversibly prune promising item paths. This limitation is particularly consequential when a few recent interactions signal an emerging interest while earlier behavior favors established preferences. Yet an independently trained discriminative recommender may rank the same items highly from the same interaction history. Such complementary scores are available at test time, offering a way to adapt a frozen generator without retraining either model. The challenge is to use these scores before pruning: combining completed recommendation lists cannot alter earlier beam decisions, while scores over complete items cannot directly inform choices among semantic prefixes shared by multiple items. We propose \textbf{T}est-Time \textbf{C}ollaborative \textbf{B}eam \textbf{S}earch \textbf{A}daptation (\textbf{TCBSA}), a training-free method that incorporates collaborative information into semantic decoding. TCBSA transforms discriminative score margins into potentials over shared semantic edges and uses a confidence gate to regulate their contributions to cumulative path scores before beam selection. We establish a sufficient condition for target prefix survival under global beam competition and bound score perturbations under low discriminative confidence. Full-catalog experiments show consistent improvements over strong baselines across datasets and different generative and discriminative recommenders. Analyses of emerging interests and decoding behavior demonstrate gains in recommendation accuracy and target path survival, while targeted interventions support the contribution of shared prefix corrections. TCBSA also offers a favorable balance between recommendation accuracy and inference latency compared with simply widening the native beam.

cs.IR↗
arXiv2026

PersonalQuery-Benchmark:Evaluating Retrieval Robustness to Personalized User Expression Differences

Existing personalized information retrieval methods mainly model differences in user needs through user preferences and query intent, while paying little attention to the personalized expression differences that arise when different users express the same retrieval need. Existing real query data typically lack stable user identities, long-term expression histories, and intent-matched counterparts, making it difficult to systematically evaluate the impact of personalized expression differences on retrieval outcomes. To this end, we propose PersonalQuery-Benchmark (PQB). PQB models personalized syntactic expression and personalized writing errors from users' historical texts, constructs personalized syntactic expression queries and personalized writing-error queries, and validates benchmark quality through LLM assessment and independent human evaluation. PQB covers three Amazon product domains with 6,516 query instances in total, and is evaluated on five retrieval models representing lexical, learned sparse, dense bi-encoder, late-interaction, and hybrid architectures, together with two LLM-based ranking models. Results show that even when the information need is held fixed, personalized expression differences still induce measurable ranking variation; different retrieval models exhibit clearly different sensitivities to syntactic variation and writing-error variation, while higher overall retrieval effectiveness does not necessarily correspond to stronger robustness against expression variation. PQB provides a new benchmark and evaluation framework for systematically studying personalized expression robustness. The associated code and dataset are available at the following address: https://github.com/cpxjazz123/PersonalQuery-Benchmark.

cs.IR↗
arXiv2026

SkillRep: Characterizing and Understanding the Representation Design Space of Agent Skill Retrieval

Retrieving the right skill from a large library is essential for LLM agents, yet requests and skills are written for different purposes and in different words. Existing retrievers narrow this request-skill gap with one or two representation choices each, so it is unknown whether their gains hold in combination. No prior work measures the gap itself, so it is also unclear which part of it each choice narrows. We define a representation design space by five choices -- encoder fine-tuning, query-side and document-side expansion, background projection and a lexical channel -- and evaluate them together for the first time, as modules of one retriever, SkillRep. With a 0.6B encoder and LLM expansion, SkillRep improves MRR@10 on SRA-Bench over the strongest same-size retriever by 7.02 points with the official skill pool and 8.79 with UniPool, a 111,247-skill pool we build from public registries, and is best on SkillsBench. The value of each choice depends on the others. Fine-tuning, for instance, reverses the ranking of the four training-free modules and turns them from complementary into overlapping. To understand why, we measure the gap with three quantities: background, the embedding component that does not separate skills; unsaid vocabulary, the gold skill's content a request leaves unsaid; and dilution, the information lost when a skill is encoded into a single vector. They show which part each module narrows and by what mechanism. This reveals that modules narrowing the same part compete for it, while those narrowing different parts complement each other.

cs.IR↗