PIER: Permutation-Level Interest-Based End-to-End Re-ranking Framework
in E-commerce
- URL: http://arxiv.org/abs/2302.03487v1
- Date: Mon, 6 Feb 2023 09:17:52 GMT
- Title: PIER: Permutation-Level Interest-Based End-to-End Re-ranking Framework
in E-commerce
- Authors: Xiaowen Shi, Fan Yang, Ze Wang, Xiaoxu Wu, Muzhi Guan, Guogang Liao,
Yongkang Wang, Xingxing Wang, Dong Wang
- Abstract summary: Existing re-ranking methods directly take the initial ranking list as input, and generate the optimal permutation through a well-designed context-wise model.
evaluating all candidate permutations brings unacceptable computational costs in practice.
This paper presents a novel end-to-end re-ranking framework named PIER to tackle the above challenges.
- Score: 13.885695433738437
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Re-ranking draws increased attention on both academics and industries, which
rearranges the ranking list by modeling the mutual influence among items to
better meet users' demands. Many existing re-ranking methods directly take the
initial ranking list as input, and generate the optimal permutation through a
well-designed context-wise model, which brings the evaluation-before-reranking
problem. Meanwhile, evaluating all candidate permutations brings unacceptable
computational costs in practice. Thus, to better balance efficiency and
effectiveness, online systems usually use a two-stage architecture which uses
some heuristic methods such as beam-search to generate a suitable amount of
candidate permutations firstly, which are then fed into the evaluation model to
get the optimal permutation. However, existing methods in both stages can be
improved through the following aspects. As for generation stage, heuristic
methods only use point-wise prediction scores and lack an effective judgment.
As for evaluation stage, most existing context-wise evaluation models only
consider the item context and lack more fine-grained feature context modeling.
This paper presents a novel end-to-end re-ranking framework named PIER to
tackle the above challenges which still follows the two-stage architecture and
contains two mainly modules named FPSM and OCPM. We apply SimHash in FPSM to
select top-K candidates from the full permutation based on user's
permutation-level interest in an efficient way. Then we design a novel
omnidirectional attention mechanism in OCPM to capture the context information
in the permutation. Finally, we jointly train these two modules end-to-end by
introducing a comparative learning loss. Offline experiment results demonstrate
that PIER outperforms baseline models on both public and industrial datasets,
and we have successfully deployed PIER on Meituan food delivery platform.
Related papers
- Adaptive Neural Ranking Framework: Toward Maximized Business Goal for
Cascade Ranking Systems [33.46891569350896]
Cascade ranking is widely used for large-scale top-k selection problems in online advertising and recommendation systems.
Previous works on learning-to-rank usually focus on letting the model learn the complete order or top-k order.
We name this method as Adaptive Neural Ranking Framework (abbreviated as ARF)
arXiv Detail & Related papers (2023-10-16T14:43:02Z) - Replace Scoring with Arrangement: A Contextual Set-to-Arrangement
Framework for Learning-to-Rank [40.81502990315285]
Learning-to-rank is a core technique in the top-N recommendation task, where an ideal ranker would be a mapping from an item set to an arrangement.
Most existing solutions fall in the paradigm of probabilistic ranking principle (PRP), i.e., first score each item in the candidate set and then perform a sort operation to generate the top ranking list.
We propose Set-To-Arrangement Ranking (STARank), a new framework directly generates the permutations of the candidate items without the need for individually scoring and sort operations.
arXiv Detail & Related papers (2023-08-05T12:22:26Z) - Meta-Wrapper: Differentiable Wrapping Operator for User Interest
Selection in CTR Prediction [97.99938802797377]
Click-through rate (CTR) prediction, whose goal is to predict the probability of the user to click on an item, has become increasingly significant in recommender systems.
Recent deep learning models with the ability to automatically extract the user interest from his/her behaviors have achieved great success.
We propose a novel approach under the framework of the wrapper method, which is named Meta-Wrapper.
arXiv Detail & Related papers (2022-06-28T03:28:15Z) - Bayesian Optimization over Permutation Spaces [30.650753803587794]
We propose and evaluate two algorithms for BO over Permutation Spaces (BOPS)
We theoretically analyze the performance of BOPS-T to show that their regret grows sub-linearly.
Our experiments on multiple synthetic and real-world benchmarks show that both BOPS-T and BOPS-H perform better than the state-of-the-art BO algorithm for spaces.
arXiv Detail & Related papers (2021-12-02T08:20:50Z) - Building an Efficient and Effective Retrieval-based Dialogue System via
Mutual Learning [27.04857039060308]
We propose to combine the best of both worlds to build a retrieval system.
We employ a fast bi-encoder to replace the traditional feature-based pre-retrieval model.
We train the pre-retrieval model and the re-ranking model at the same time via mutual learning.
arXiv Detail & Related papers (2021-10-01T01:32:33Z) - On Second-order Optimization Methods for Federated Learning [59.787198516188425]
We evaluate the performance of several second-order distributed methods with local steps in the federated learning setting.
We propose a novel variant that uses second-order local information for updates and a global line search to counteract the resulting local specificity.
arXiv Detail & Related papers (2021-09-06T12:04:08Z) - Learning-To-Ensemble by Contextual Rank Aggregation in E-Commerce [8.067201256886733]
We propose a new Learning-To-Ensemble framework RAEGO, which replaces the ensemble model with a contextual Rank Aggregator.
RA-EGO has been deployed in our online system and has improved the revenue significantly.
arXiv Detail & Related papers (2021-07-19T03:24:06Z) - Few-Shot Named Entity Recognition: A Comprehensive Study [92.40991050806544]
We investigate three schemes to improve the model generalization ability for few-shot settings.
We perform empirical comparisons on 10 public NER datasets with various proportions of labeled data.
We create new state-of-the-art results on both few-shot and training-free settings.
arXiv Detail & Related papers (2020-12-29T23:43:16Z) - Towards Model-Agnostic Post-Hoc Adjustment for Balancing Ranking
Fairness and Algorithm Utility [54.179859639868646]
Bipartite ranking aims to learn a scoring function that ranks positive individuals higher than negative ones from labeled data.
There have been rising concerns on whether the learned scoring function can cause systematic disparity across different protected groups.
We propose a model post-processing framework for balancing them in the bipartite ranking scenario.
arXiv Detail & Related papers (2020-06-15T10:08:39Z) - Pre-training Is (Almost) All You Need: An Application to Commonsense
Reasoning [61.32992639292889]
Fine-tuning of pre-trained transformer models has become the standard approach for solving common NLP tasks.
We introduce a new scoring method that casts a plausibility ranking task in a full-text format.
We show that our method provides a much more stable training phase across random restarts.
arXiv Detail & Related papers (2020-04-29T10:54:40Z) - SetRank: A Setwise Bayesian Approach for Collaborative Ranking from
Implicit Feedback [50.13745601531148]
We propose a novel setwise Bayesian approach for collaborative ranking, namely SetRank, to accommodate the characteristics of implicit feedback in recommender system.
Specifically, SetRank aims at maximizing the posterior probability of novel setwise preference comparisons.
We also present the theoretical analysis of SetRank to show that the bound of excess risk can be proportional to $sqrtM/N$.
arXiv Detail & Related papers (2020-02-23T06:40:48Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.