AI Chat AI Image Generator AI Video Text to Speech

A review on ranking problems in statistical learning

09/06/2019

∙

by Tino Werner, et al.

∙

∙

Ranking problems define a widely spread class of statistical learning problems with many applications, including fraud detection, document ranking or medicine. In this article, we systematically describe different types of ranking problems and investigate existing empirical risk minimization techniques to solve such ranking problems. Furthermore, we discuss whether a Boosting-type algorithm for continuous ranking problems is achievable by using surrogate loss functions.

page 1

page 2

page 3

page 4

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...

0 Sebastian Bruch, et al. ∙

research

∙ 08/19/2019

Gradient Boosting Machine: A Survey

In this survey, we discuss several different types of gradient boosting ...

0 Zhiyuan He, et al. ∙

research

∙ 01/21/2020

Improving Label Ranking Ensembles using Boosting Techniques

Label ranking is a prediction task which deals with learning a mapping b...

0 Lihi Dery, et al. ∙

research

∙ 03/12/2021

Quantitative robustness of instance ranking problems

Instance ranking problems intend to recover the true ordering of the ins...

0 Tino Werner, et al. ∙

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...

0 Ivan Lyzhin, et al. ∙

research

∙ 07/15/2022

A Lexicographic Public Good Ranking

In this paper, we consider the consistency of the desirability relation ...

0 Michele Aleandri, et al. ∙

research

∙ 11/04/2019

Fast Reliability Ranking of Matchstick Minimal Networks

In this article, we take a closer look at the reliability of large minim...

0 Vlad-Florin Dragoi, et al. ∙