Loading...
SparseNet: Coordinate Descent With Nonconvex Penalties
We address the problem of sparse selection in linear models. A number of nonconvex penalties have been proposed in the literature for this purpose, along with a variety of convex-relaxation algorithms for finding good solutions. In this article we pursue a coordinate-descent approach for optimizatio...
Saved in:
| Published in: | J Am Stat Assoc |
|---|---|
| Main Authors: | , , |
| Format: | Artigo |
| Language: | Inglês |
| Published: |
2011
|
| Subjects: | |
| Online Access: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4286300/ https://ncbi.nlm.nih.gov/pubmed/25580042 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1198/jasa.2011.tm09738 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|