Algorithms for Sparsity-Constrained Optimization by Sohail Bahmani
Requirements: .PDF reader, 1.3 Mb
Overview: 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.
Genre: Non-Fiction > Tech & Devices
Download Instructions:
http://corneey.com/wV7Ioh