# Oracle inequalities for ranking and U-processes with Lasso penalty

arXiv: https://arxiv.org/abs/1512.05698 · HTML: https://mlsanity.com/paper/1512.05698/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Dec 2015.

## Built on by (most cited first, 1 of 1)

- [Pairwise Ranking with Gaussian Kernels](https://mlsanity.com/paper/2304.03185/) (2023)

## Abstract (arXiv)

We investigate properties of estimators obtained by minimization of U-processes with the Lasso penalty in high-dimensional settings. Our attention is focused on the ranking problem that is popular in machine learning. It is related to guessing the ordering between objects on the basis of their observed predictors. We prove the oracle inequality for the excess risk of the considered estimator as well as the bound for the l1 distance between the estimator and the oracle.