BibTeX
CSL-JSON
MLA
Harvard
SWAGGER: Sparsity Within and Across Groups for General Estimation and Recovery
release_myqyknir3rgghfckp3wvpu2fla
by
Charles Saunders, Vivek K Goyal
Released
as a article
.
2020
Abstract
Penalty functions or regularization terms which promote structured solutions
to optimization problems are of great interest in many fields. Proposed in this
work is a nonconvex structured sparsity penalty that promotes one-sparsity
within arbitrary overlapping groups in a vector. We show multiple example use
cases, demonstrate synergy between it and other regularizers, and propose an
algorithm to efficiently solve problems regularized or constrained by the
proposed penalty.
In text/plain
format
Archived Files and Locations
application/pdf 575.0 kB
file_coiywrjhynemrnhxo7ni3jywi4
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
2006.01714v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links