Pith. sign in

REVIEW 4 cited by

Globally Optimized Mutual Influence Aware Ranking in 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 1805.08524 v1 pith:CG5PVQ36 submitted 2018-05-22 cs.IR

Globally Optimized Mutual Influence Aware Ranking in E-Commerce Search

classification cs.IR
keywords searchmutualrankinge-commerceinfluencesawareinfluenceprobability
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In web search, mutual influences between documents have been studied from the perspective of search result diversification. But the methods in web search is not directly applicable to e-commerce search because of their differences. And little research has been done on the mutual influences between items in e-commerce search. We propose a global optimization framework for mutual influence aware ranking in e-commerce search. Our framework directly optimizes the Gross Merchandise Volume (GMV) for ranking, and decomposes ranking into two tasks. The first task is mutual influence aware purchase probability estimation. We propose a global feature extension method to incorporate mutual influences into the features of an item. We also use Recurrent Neural Network (RNN) to capture influences related to ranking orders in purchase probability estimation. The second task is to find the best ranking order based on the purchase probability estimations. We treat the second task as a sequence generation problem and solved it using the beam search algorithm. We performed online A/B test on a large e-commerce search engine. The results show that our method brings a 5% increase in GMV for the search engine over a strong baseline.

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. Next-Scale Generative Reranking: A Tree-based Generative Rerank Method at Meituan

    cs.IR 2026-04 unverdicted novelty 7.0

    NSGR is a tree-structured generative reranker that progressively generates optimal lists via next-scale expansion and multi-scale neighbor loss to balance perspectives and align training signals.

  2. Rich-Media Re-Ranker: A User Satisfaction-Driven LLM Re-ranking Framework for Rich-Media Search

    cs.IR 2026-02 unverdicted novelty 5.0

    A re-ranking system for rich-media search that plans query intents from sessions, adds visual signals from VLMs, and uses an LLM to score results on multiple facets before multi-task RL adaptation, with reported gains...

  3. Fast and Feasible: Permutation-based Constrained Reranking for Revenue Maximization

    cs.IR 2026-06 unverdicted novelty 4.0

    PermR approximates constrained ILP revenue maximization via neighbor swaps, reaching 63% of optimal gains within latency bounds and delivering 2% revenue lift in a 56M-query online test.

  4. Dual-Rerank: Fusing Causality and Utility for Industrial Generative Reranking

    cs.IR 2026-04 unverdicted novelty 4.0

    Dual-Rerank fuses autoregressive and non-autoregressive generative reranking via knowledge distillation and uses list-wise decoupled RL optimization to improve whole-page utility and cut latency in industrial video search.