Summary and Info
This thesis demonstrates techniques that provide faster and more accurate solutions to a variety of problems in machine learning and signal processing. The author proposes a "greedy" algorithm, deriving sparse solutions with guarantees of optimality. The use of this algorithm removes many of the inaccuracies that occurred with the use of previous models.
Review and Comments
Rate the Book
Algorithms for Sparsity-Constrained Optimization 0 out of 5 stars based on 0 ratings.