A cost-sensitive constrained Lasso

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Blanquero, Rafael, Carrizosa, Emilio, Ramírez-Cobo, Pepa, Sillero-Denamiel, M. Remedios
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916111311699968
author Blanquero, Rafael
Carrizosa, Emilio
Ramírez-Cobo, Pepa
Sillero-Denamiel, M. Remedios
author_facet Blanquero, Rafael
Carrizosa, Emilio
Ramírez-Cobo, Pepa
Sillero-Denamiel, M. Remedios
contents The Lasso has become a benchmark data analysis procedure, and numerous variants have been proposed in the literature. Although the Lasso formulations are stated so that overall prediction error is optimized, no full control over the accuracy prediction on certain individuals of interest is allowed. In this work we propose a novel version of the Lasso in which quadratic performance constraints are added to Lasso-based objective functions, in such a way that threshold values are set to bound the prediction errors in the different groups of interest (not necessarily disjoint). As a result, a constrained sparse regression model is defined by a nonlinear optimization problem. This cost-sensitive constrained Lasso has a direct application in heterogeneous samples where data are collected from distinct sources, as it is standard in many biomedical contexts. Both theoretical properties and empirical studies concerning the new method are explored in this paper. In addition, two illustrations of the method on biomedical and sociological contexts are considered.
format Preprint
id arxiv_https___arxiv_org_abs_2401_18023
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A cost-sensitive constrained Lasso
Blanquero, Rafael
Carrizosa, Emilio
Ramírez-Cobo, Pepa
Sillero-Denamiel, M. Remedios
Methodology
Machine Learning
The Lasso has become a benchmark data analysis procedure, and numerous variants have been proposed in the literature. Although the Lasso formulations are stated so that overall prediction error is optimized, no full control over the accuracy prediction on certain individuals of interest is allowed. In this work we propose a novel version of the Lasso in which quadratic performance constraints are added to Lasso-based objective functions, in such a way that threshold values are set to bound the prediction errors in the different groups of interest (not necessarily disjoint). As a result, a constrained sparse regression model is defined by a nonlinear optimization problem. This cost-sensitive constrained Lasso has a direct application in heterogeneous samples where data are collected from distinct sources, as it is standard in many biomedical contexts. Both theoretical properties and empirical studies concerning the new method are explored in this paper. In addition, two illustrations of the method on biomedical and sociological contexts are considered.
title A cost-sensitive constrained Lasso
topic Methodology
Machine Learning
url https://arxiv.org/abs/2401.18023