Addressing Purchase-Impression Gap through a Sequential Re-ranker

10/27/2020
by   Shubhangi Tandon, et al.
0

Large scale eCommerce platforms such as eBay carry a wide variety of inventory and provide several buying choices to online shoppers. It is critical for eCommerce search engines to showcase in the top results the variety and selection of inventory available, specifically in the context of the various buying intents that may be associated with a search query. Search rankers are most commonly powered by learning-to-rank models which learn the preference between items during training. However, they score items independent of other items at runtime. Although the items placed at top of the results by such scoring functions may be independently optimal, they can be sub-optimal as a set. This may lead to a mismatch between the ideal distribution of items in the top results vs what is actually impressed. In this paper, we present methods to address the purchase-impression gap observed in top search results on eCommerce sites. We establish the ideal distribution of items based on historic shopping patterns. We then present a sequential reranker that methodically reranks top search results produced by a conventional pointwise scoring ranker. The reranker produces a reordered list by sequentially selecting candidates trading off between their independent relevance and potential to address the purchase-impression gap by utilizing specially constructed features that capture impression distribution of items already added to a reranked list. The sequential reranker enables addressing purchase impression gap with respect to multiple item aspects. Early version of the reranker showed promising lifts in conversion and engagement metrics at eBay. Based on experiments on randomly sampled validation datasets, we observe that the reranking methodology presented produces around 10 average for the top 20 results, while making improvements to conversion metrics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/01/2019

A Contextual-Bandit Approach to Online Learning to Rank for Relevance and Diversity

Online learning to rank (LTR) focuses on learning a policy from user int...
research
08/10/2019

Exploring the Effect of an Item's Neighborhood on its Sellability in eCommerce

Predicting the sale of an item is a critical problem in eCommerce search...
research
11/14/2019

Revenue Maximization of Airbnb Marketplace using Search Results

Correctly pricing products or services in an online marketplace presents...
research
09/13/2021

Online Learning of Optimally Diverse Rankings

Search engines answer users' queries by listing relevant items (e.g. doc...
research
02/24/2019

Aggregating E-commerce Search Results from Heterogeneous Sources via Hierarchical Reinforcement Learning

In this paper, we investigate the task of aggregating search results fro...
research
05/22/2022

Ada-Ranker: A Data Distribution Adaptive Ranking Paradigm for Sequential Recommendation

A large-scale recommender system usually consists of recall and ranking ...

Please sign up or login with your details

Forgot password? Click here to reset