Send to

Choose Destination
  • PMID: 23648581 was deleted because it is a duplicate of PMID: 24136438
See comment in PubMed Commons below
IEEE Trans Pattern Anal Mach Intell. 2013 Dec;35(12):3025-36. doi: 10.1109/TPAMI.2013.85.

Forward basis selection for pursuing sparse representations over a dictionary.

Author information

Nanjing University of Information Science and Technology, China and National University of Singapore, Singapore.


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 prefixed dictionary. Our proposed algorithm iteratively selects an atom from the dictionary and minimizes the objective function over the linear combinations of all the selected atoms. The rate of convergence of this greedy selection procedure is analyzed. Furthermore, we extend the algorithm to the setup of learning nonnegative and convex sparse representation over a dictionary. Applications of the proposed algorithms to sparse precision matrix estimation and low-rank subspace segmentation are investigated with efficiency and effectiveness validated on benchmark datasets.

PubMed Commons home

PubMed Commons

How to join PubMed Commons

    Supplemental Content

    Loading ...
    Support Center