Towards a Better Tradeoff between Effectiveness and Efficiency in
Pre-Ranking: A Learnable Feature Selection based Approach
- URL: http://arxiv.org/abs/2105.07706v1
- Date: Mon, 17 May 2021 09:48:15 GMT
- Title: Towards a Better Tradeoff between Effectiveness and Efficiency in
Pre-Ranking: A Learnable Feature Selection based Approach
- Authors: Xu Ma, Pengjie Wang, Hui Zhao, Shaoguo Liu, Chuhan Zhao, Wei Lin,
Kuang-Chih Lee, Jian Xu, Bo Zheng
- Abstract summary: In real-world search, recommendation, and advertising systems, the multi-stage ranking architecture is commonly adopted.
In this paper, a novel pre-ranking approach is proposed which supports complicated models with interaction-focused architecture.
It achieves a better tradeoff between effectiveness and efficiency by utilizing the proposed learnable Feature Selection method.
- Score: 12.468550800027808
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In real-world search, recommendation, and advertising systems, the
multi-stage ranking architecture is commonly adopted. Such architecture usually
consists of matching, pre-ranking, ranking, and re-ranking stages. In the
pre-ranking stage, vector-product based models with representation-focused
architecture are commonly adopted to account for system efficiency. However, it
brings a significant loss to the effectiveness of the system. In this paper, a
novel pre-ranking approach is proposed which supports complicated models with
interaction-focused architecture. It achieves a better tradeoff between
effectiveness and efficiency by utilizing the proposed learnable Feature
Selection method based on feature Complexity and variational Dropout (FSCD).
Evaluations in a real-world e-commerce sponsored search system for a search
engine demonstrate that utilizing the proposed pre-ranking, the effectiveness
of the system is significantly improved. Moreover, compared to the systems with
conventional pre-ranking models, an identical amount of computational resource
is consumed.
Related papers
- Learning Fair Ranking Policies via Differentiable Optimization of
Ordered Weighted Averages [55.04219793298687]
This paper shows how efficiently-solvable fair ranking models can be integrated into the training loop of Learning to Rank.
In particular, this paper is the first to show how to backpropagate through constrained optimizations of OWA objectives, enabling their use in integrated prediction and decision models.
arXiv Detail & Related papers (2024-02-07T20:53:53Z) - EASRec: Elastic Architecture Search for Efficient Long-term Sequential
Recommender Systems [82.76483989905961]
Current Sequential Recommender Systems (SRSs) suffer from computational and resource inefficiencies.
We develop the Elastic Architecture Search for Efficient Long-term Sequential Recommender Systems (EASRec)
EASRec introduces data-aware gates that leverage historical information from input data batch to improve the performance of the recommendation network.
arXiv Detail & Related papers (2024-02-01T07:22:52Z) - Rethinking and Benchmarking Predict-then-Optimize Paradigm for
Combinatorial Optimization Problems [62.25108152764568]
Many web applications rely on solving optimization problems, such as energy cost-aware scheduling, budget allocation on web advertising, and graph matching on social networks.
We consider the performance of prediction and decision-making in a unified system.
We provide a comprehensive categorization of current approaches and integrate existing experimental scenarios.
arXiv Detail & Related papers (2023-11-13T13:19:34Z) - Hierarchical Ensemble-Based Feature Selection for Time Series
Forecasting [0.0]
We introduce a novel ensemble approach for feature selection based on hierarchical stacking for non-stationarity.
Our approach exploits the co-dependency between features using a hierarchical structure.
The effectiveness of the approach is demonstrated on synthetic and well-known real-life datasets.
arXiv Detail & Related papers (2023-10-26T16:40:09Z) - Iterative Hierarchy and Ranking Process (IHRP): A Novel Effective
Hierarchy Method for Densely Connected Systems and Case Study in Student
Performance Assessment [1.6317061277457001]
Interpretive structural modeling (ISM) is a widely used hierarchy-building method that mines factor inter-influences based on expert opinions.
This paper discusses one of the main drawbacks of the conventional ISM method in systems where the factors are densely interrelated.
We propose a novel iterative hierarchy-building technique, called 'Iterative Hierarchy and Ranking Process'(IHRP) which performs effectively in such dense systems.
arXiv Detail & Related papers (2023-06-17T19:11:34Z) - ECO-TR: Efficient Correspondences Finding Via Coarse-to-Fine Refinement [80.94378602238432]
We propose an efficient structure named Correspondence Efficient Transformer (ECO-TR) by finding correspondences in a coarse-to-fine manner.
To achieve this, multiple transformer blocks are stage-wisely connected to gradually refine the predicted coordinates.
Experiments on various sparse and dense matching tasks demonstrate the superiority of our method in both efficiency and effectiveness against existing state-of-the-arts.
arXiv Detail & Related papers (2022-09-25T13:05:33Z) - Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions.
For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions.
The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
arXiv Detail & Related papers (2022-05-13T21:09:41Z) - 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) - Probabilistic Case-based Reasoning for Open-World Knowledge Graph
Completion [59.549664231655726]
A case-based reasoning (CBR) system solves a new problem by retrieving cases' that are similar to the given problem.
In this paper, we demonstrate that such a system is achievable for reasoning in knowledge-bases (KBs)
Our approach predicts attributes for an entity by gathering reasoning paths from similar entities in the KB.
arXiv Detail & Related papers (2020-10-07T17:48:12Z) - MM-KTD: Multiple Model Kalman Temporal Differences for Reinforcement
Learning [36.14516028564416]
This paper proposes an innovative Multiple Model Kalman Temporal Difference (MM-KTD) framework to learn optimal control policies.
An active learning method is proposed to enhance the sampling efficiency of the system.
Experimental results show superiority of the MM-KTD framework in comparison to its state-of-the-art counterparts.
arXiv Detail & Related papers (2020-05-30T06:39:55Z)
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.