A greedy anytime algorithm for sparse PCA (Q6327255)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A greedy anytime algorithm for sparse PCA |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A greedy anytime algorithm for sparse PCA |
preprint article from arXiv |
Statements
15 October 2019
0 references
math.ST
0 references
cs.CC
0 references
cs.LG
0 references
stat.TH
0 references
Guy Holtzman
0 references
Adam Soffer
0 references
Dan Vilenchik
0 references
