Title
Multi-objective Ranking via Constrained Optimization
Abstract
In this paper, we introduce an Augmented Lagrangian based method to incorporate the multiple objectives (MO) in a search ranking algorithm. Optimizing MOs is an essential and realistic requirement for building ranking models in production. The proposed method formulates MO in constrained optimization and solves the problem in the popular Boosting framework – a novel contribution of our work. Furthermore, we propose a procedure to set up all optimization parameters in the problem. The experimental results show that the method successfully achieves MO criteria much more efficiently than existing methods.
Year
DOI
Venue
2020
10.1145/3366424.3382723
WWW '20: The Web Conference 2020 Taipei Taiwan April, 2020
DocType
ISBN
Citations 
Conference
978-1-4503-7024-0
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Momma Michinari100.34
Garakani Alireza Bagheri200.34
Ma Nanxun300.34
Yi Sun47129.06