J. C. Laria, R. E. Lillo Rodríguez, M. C. Aguilera-Morillo
In high-dimensional supervised learning problems, sparsity constraints in the solution often lead to better performance and interpretability of the results. For problems in which covariates are grouped and sparse structure are desired, both on group and within group levels, the sparse-group lasso (SGL) regularization method has proved to be very efficient. Sometimes the group structure in the covariates is clear, e.g., when we have dummy variables corresponding to different levels of the same original categorical variable. However, many real problems lack of an explicit configuration for the groups. In this work, we investigate properties of the SGL regularization when the group structure in the covariates is unknown, derive strategies to supply those missing groups and compare the SGL to other methods which do not depend on the choice of groups. We support our analysis using both real and synthetic data sets.
Palabras clave / Keywords: sparse-group lasso, high-dimension, regularization
Programado
Sesión GT02-2: Análisis Multivariante y Clasificación (AMyC-2). Organizadora: Eva Boj del Val
29 de mayo de 2018 12:20
Sala 5
