Multi-objective Ranking via Constrained Optimization

by   Michinari Momma, et al.
University of Washington

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.


page 1

page 2

page 3

page 4


Multi-constrained topology optimization via the topological sensitivity

The objective of this paper is to introduce and demonstrate a robust met...

Constrained Multi-Slot Optimization for Ranking Recommendations

Ranking items to be recommended to users is one of the main problems in ...

Regression Compatible Listwise Objectives for Calibrated Ranking

As Learning-to-Rank (LTR) approaches primarily seek to improve ranking q...

Conditional Sequential Slate Optimization

The top search results matching a user query that are displayed on the f...

Online Article Ranking as a Constrained, Dynamic, Multi-Objective Optimization Problem

The content ranking problem in a social news website, is typically a fun...

GRaCE: Optimizing Grasps to Satisfy Ranked Criteria in Complex Scenarios

This paper addresses the multi-faceted problem of robot grasping, where ...

Multi-Objective Design of State Feedback Controllers Using Reinforced Quantum-Behaved Particle Swarm Optimization

In this paper, a novel and generic multi-objective design paradigm is pr...

Please sign up or login with your details

Forgot password? Click here to reset