ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1205.5075
  4. Cited By
Efficient Sparse Group Feature Selection via Nonconvex Optimization

Efficient Sparse Group Feature Selection via Nonconvex Optimization

23 May 2012
Shuo Xiang
Xiao Tong
Jieping Ye
ArXivPDFHTML

Papers citing "Efficient Sparse Group Feature Selection via Nonconvex Optimization"

7 / 7 papers shown
Title
A Selective Review of Group Selection in High-Dimensional Models
A Selective Review of Group Selection in High-Dimensional Models
Jian Huang
P. Breheny
Shuangge Ma
203
380
0
29 Apr 2012
Convergence Rates of Inexact Proximal-Gradient Methods for Convex
  Optimization
Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization
Mark Schmidt
Nicolas Le Roux
Francis R. Bach
200
582
0
12 Sep 2011
Multi-stage Convex Relaxation for Feature Selection
Multi-stage Convex Relaxation for Feature Selection
Tong Zhang
97
112
0
03 Jun 2011
A note on the group lasso and a sparse group lasso
A note on the group lasso and a sparse group lasso
J. Friedman
Trevor Hastie
Robert Tibshirani
221
841
0
05 Jan 2010
On the conditions used to prove oracle results for the Lasso
On the conditions used to prove oracle results for the Lasso
Sara van de Geer
Peter Buhlmann
265
731
0
05 Oct 2009
The Benefit of Group Sparsity
The Benefit of Group Sparsity
Junzhou Huang
Tong Zhang
210
466
0
20 Jan 2009
Simultaneous analysis of Lasso and Dantzig selector
Simultaneous analysis of Lasso and Dantzig selector
Peter J. Bickel
Yaácov Ritov
Alexandre B. Tsybakov
525
2,530
0
07 Jan 2008
1