MidRank: Learning to rank based on subsequences

11/29/2015
by   Basura Fernando, et al.
0

We present a supervised learning to rank algorithm that effectively orders images by exploiting the structure in image sequences. Most often in the supervised learning to rank literature, ranking is approached either by analyzing pairs of images or by optimizing a list-wise surrogate loss function on full sequences. In this work we propose MidRank, which learns from moderately sized sub-sequences instead. These sub-sequences contain useful structural ranking information that leads to better learnability during training and better generalization during testing. By exploiting sub-sequences, the proposed MidRank improves ranking accuracy considerably on an extensive array of image ranking applications and datasets.

READ FULL TEXT

page 8

page 9

research
02/13/2020

Listwise Learning to Rank with Deep Q-Networks

Learning to Rank is the problem involved with ranking a sequence of docu...
research
11/22/2019

An Alternative Cross Entropy Loss for Learning-to-Rank

Listwise learning-to-rank methods form a powerful class of ranking algor...
research
04/04/2022

Which Tricks are Important for Learning to Rank?

Nowadays, state-of-the-art learning-to-rank (LTR) methods are based on g...
research
01/21/2021

Assessing the Benefits of Model Ensembles in Neural Re-Ranking for Passage Retrieval

Our work aimed at experimentally assessing the benefits of model ensembl...
research
07/19/2021

Learning-To-Ensemble by Contextual Rank Aggregation in E-Commerce

Ensemble models in E-commerce combine predictions from multiple sub-mode...
research
05/06/2020

Incremental Multiple Longest Common Sub-Sequences

We consider the problem of updating the information about multiple longe...
research
05/03/2014

Perceptron-like Algorithms and Generalization Bounds for Learning to Rank

Learning to rank is a supervised learning problem where the output space...

Please sign up or login with your details

Forgot password? Click here to reset