Oracle inequalities for ranking and U-processes with Lasso penalty

12/17/2015
by   Wojciech Rejchel, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2022

On Lasso estimator for the drift function in diffusion models

In this paper we study the properties of the Lasso estimator of the drif...
research
05/16/2007

Lasso type classifiers with a reject option

We consider the problem of binary classification where one can, for a pa...
research
03/18/2014

On the Sensitivity of the Lasso to the Number of Predictor Variables

The Lasso is a computationally efficient regression regularization proce...
research
05/11/2016

Asymptotic properties for combined L_1 and concave regularization

Two important goals of high-dimensional modeling are prediction and vari...
research
04/06/2023

Pairwise Ranking with Gaussian Kernels

Regularized pairwise ranking with Gaussian kernels is one of the cutting...
research
11/26/2019

LASSO estimation for spherical autoregressive processes

The purpose of the present paper is to investigate on a class of spheric...

Please sign up or login with your details

Forgot password? Click here to reset