Algorithms for Sparsity-Constrained Optimization - Sohail Bahmani
-25% su kodu BOOKS
Pristatymas per 17-23 d.d.
30 dienų grąžinimo politika
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.
Jums taip pat gali patikti
Aprašymas
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.
Daugiau informacijos
| Autorius | Sohail Bahmani |
|---|---|
| Leidėjas | Springer International Publishing |
| Series | Springer Theses |
| Išleidimo metai | 2013 |
| Viršelio tipas | Kieti viršeliai |
| EAN | 9783319018805 |