A doubly sparse approach for group variable selection
type: Item
instance of: scholarly article
title: A doubly sparse approach for group variable selection
zbMATH Open document ID: 1436.62327
author: Sunghoon Kwon
author: Jeongyoun Ahn
author: Woncheol Jang
author: Sangin Lee
author: Yongdai Kim
published in: Annals of the Institute of Statistical Mathematics
publication date: 2017-11-16T00:00:00Z
Mathematics Subject Classification ID: 62J05
Mathematics Subject Classification ID: 62J07
zbMATH DE Number: 6807780
zbMATH Keywords: doubly sparse penalty
zbMATH Keywords: group selection
zbMATH Keywords: group selection consistency
zbMATH Keywords: variable selection
describes a project that uses: glasso
MaRDI profile type: Publication
full work available at URL: s10463-016-0571-z
OpenAlex ID: W2462083476
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: Q3151174
cites work: Simultaneous analysis of Lasso and Dantzig selector
cites work: The group exponential Lasso for bi-level variable selection
cites work: Penalized methods for bi-level variable selection
cites work: Estimating Optimal Transformations for Multiple Regression and Correlation
cites work: Least angle regression. (With discussion)
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: Nonconcave penalized likelihood with a diverging number of parameters.
cites work: Pathwise coordinate optimization
cites work: The benefit of group sparsity
cites work: Asymptotic properties of bridge estimators in sparse high-dimensional regression models
cites work: A group bridge approach for variable selection
cites work: A selective review of group selection in high-dimensional models
cites work: Global optimality of nonconvex penalized estimators
cites work: Smoothly Clipped Absolute Deviation on High Dimensions
cites work: Moderately clipped Lasso
cites work: Component selection and smoothing in multivariate nonparametric regression
cites work: Lasso-type recovery of sparse representations for high-dimensional data
cites work: Piecewise linear regularized solution paths
cites work: An extension of mechanism design optimization for motion generation
cites work: Q4864293
cites work: Tuning parameter selectors for the smoothly clipped absolute deviation method
cites work: Shrinkage tuning parameter selection with a diverging number of parameters
cites work: Calibrating nonconvex penalized regression in ultra-high dimension
cites work: Consistent group selection in high-dimensional linear regression
cites work: Rate minimaxity of the Lasso and Dantzig selector for the \(l_{q}\) loss in \(l_{r}\) balls
cites work: Model Selection and Estimation in Regression with Grouped Variables
cites work: The Concave-Convex Procedure
cites work: Nearly unbiased variable selection under minimax concave penalty
cites work: A general theory of concave regularization for high-dimensional sparse estimation problems
cites work: Q3174050
cites work: Group variable selection via a hierarchical lasso and its oracle property
cites work: The Adaptive Lasso and Its Oracle Properties
DOI: 10.1007/S10463-016-0571-Z
description: scientific article; zbMATH DE number 6807780