Penalized Generative Variable Selection

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Wang, Tong, Huang, Jian, Ma, Shuangge
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866911784169897984
author Wang, Tong
Huang, Jian
Ma, Shuangge
author_facet Wang, Tong
Huang, Jian
Ma, Shuangge
contents Deep networks are increasingly applied to a wide variety of data, including data with high-dimensional predictors. In such analysis, variable selection can be needed along with estimation/model building. Many of the existing deep network studies that incorporate variable selection have been limited to methodological and numerical developments. In this study, we consider modeling/estimation using the conditional Wasserstein Generative Adversarial networks. Group Lasso penalization is applied for variable selection, which may improve model estimation/prediction, interpretability, stability, etc. Significantly advancing from the existing literature, the analysis of censored survival data is also considered. We establish the convergence rate for variable selection while considering the approximation error, and obtain a more efficient distribution estimation. Simulations and the analysis of real experimental data demonstrate satisfactory practical utility of the proposed analysis.
format Preprint
id arxiv_https___arxiv_org_abs_2402_16661
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Penalized Generative Variable Selection
Wang, Tong
Huang, Jian
Ma, Shuangge
Machine Learning
Methodology
Deep networks are increasingly applied to a wide variety of data, including data with high-dimensional predictors. In such analysis, variable selection can be needed along with estimation/model building. Many of the existing deep network studies that incorporate variable selection have been limited to methodological and numerical developments. In this study, we consider modeling/estimation using the conditional Wasserstein Generative Adversarial networks. Group Lasso penalization is applied for variable selection, which may improve model estimation/prediction, interpretability, stability, etc. Significantly advancing from the existing literature, the analysis of censored survival data is also considered. We establish the convergence rate for variable selection while considering the approximation error, and obtain a more efficient distribution estimation. Simulations and the analysis of real experimental data demonstrate satisfactory practical utility of the proposed analysis.
title Penalized Generative Variable Selection
topic Machine Learning
Methodology
url https://arxiv.org/abs/2402.16661