Ranking via Robust Binary Classification and Parallel Parameter Estimation in Large-Scale Data

02/11/2014
by   Hyokun Yun, et al.
0

We propose RoBiRank, a ranking algorithm that is motivated by observing a close connection between evaluation metrics for learning to rank and loss functions for robust classification. The algorithm shows a very competitive performance on standard benchmark datasets against other representative algorithms in the literature. On the other hand, in large scale problems where explicit feature vectors and scores are not given, our algorithm can be efficiently parallelized across a large number of machines; for a task that requires 386,133 x 49,824,519 pairwise interactions between items to be ranked, our algorithm finds solutions that are of dramatically higher quality than that can be found by a state-of-the-art competitor algorithm, given the same amount of wall-clock time for computation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2017

A Batch Learning Framework for Scalable Personalized Ranking

In designing personalized ranking algorithms, it is desirable to encoura...
research
11/30/2018

TF-Ranking: Scalable TensorFlow Library for Learning-to-Rank

TensorFlow Ranking is the first open source library for solving large-sc...
research
02/21/2019

Sequential Learning over Implicit Feedback for Robust Large-Scale Recommender Systems

In this paper, we propose a robust sequential learning strategy for trai...
research
01/15/2020

Extreme Regression for Dynamic Search Advertising

This paper introduces a new learning paradigm called eXtreme Regression ...
research
06/21/2017

Ensembles of Models and Metrics for Robust Ranking of Homologous Proteins

An ensemble of models (EM), where each model is constructed on a diverse...
research
12/31/2019

Deep Attentive Ranking Networks for Learning to Order Sentences

We present an attention-based ranking framework for learning to order se...
research
08/31/2022

One-class Recommendation Systems with the Hinge Pairwise Distance Loss and Orthogonal Representations

In one-class recommendation systems, the goal is to learn a model from a...

Please sign up or login with your details

Forgot password? Click here to reset