Forward basis selection for pursuing sparse representations over a dictionary
The forward greedy selection algorithm of Frank and Wolfe has recently been applied with success to coordinate-wise sparse learning problems, characterized by a tradeoff between sparsity and accuracy. In this paper, we generalize this method to the setup of pursuing sparse representations over a pre...
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 35(2013), 12 vom: 17. Dez., Seite 3025-36 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2013
|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence |
| Sujets: | Journal Article Research Support, Non-U.S. Gov't |
| Accès en ligne |
Volltext |