Algorithms for Sparsity-Constrained Optimization
Price for Eshop: 3647 Kč (€ 145.9)
VAT 0% included
New
E-book delivered electronically online
E-Book information
Annotation
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.
Ask question
You can ask us about this book and we'll send an answer to your e-mail.