Issue No. 12 - Dec. (2013 vol. 35)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2013.85
Xiao-Tong Yuan , Sch. of Inf. & Control, Nanjing Univ. of Inf. Sci. & Technol., Nanjing, China
Shuicheng Yan , Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore, 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.
Greedy algorithms, Sparse matrices, Gaussian processes, Dictionaries
Xiao-Tong Yuan and Shuicheng Yan, "Forward Basis Selection for Pursuing Sparse Representations over a Dictionary," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 35, no. 12, pp. 3025-3036, 2013.