Algorithms for Sparsity-Constrained Optimization
Sohail Bahmani
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.
Կատեգորիաներ:
Տարի:
2014
Հրատարակչություն:
Imprint; Springer; Springer International Publishing
Լեզու:
english
Էջեր:
107
ISBN 10:
3319018817
ISBN 13:
9783319018812
Սերիաներ:
Springer Theses Recognizing Outstanding Ph. D. Research
Ֆայլ:
PDF, 3.02 MB
IPFS:
,
english, 2014