The NodeHopper: Enabling low latency ranking with constraints via a fast dual solver
Ivan Lobov: DeepMind; Krishnamurthy Dj Dvijotham: DeepMind; Anton Zhernov: DeepMind; Dan A. Calian: DeepMind; Michelle Gong: DeepMind; Timothy A. Mann: DeepMind; Natarajan Chandrashekar: Google
Modern recommender systems need to deal with multiple objectives like balancing user engagement with recommending diverse and fresh content. An appealing way to optimally trade these off is by imposing constraints on the ranking according to which items are presented to a user. This results in a constrained ranking optimization problem that can be solved as a linear program (LP). However, off-the-shelf LP solvers are unable to meet the severe latency constraints in systems that serve live traffic. To address this challenge, we exploit the structure of the dual optimization problem to develop a fast solver. We analyze theoretical properties of our solver and show experimentally that it is able to solve constrained ranking problems on synthetic and real-world recommendation datasets an order of magnitude faster than off-the-shelf solvers, thereby enabling their deployment under severe latency constraints.
How can we assist you?
We'll be updating the website as information becomes available. If you have a question that requires immediate attention, please feel free to contact us. Thank you!
Please enter the word you see in the image below: