Algorithms for Sparsity-Constrained Optimization - Sohail Bahmani
-25% koodilla BOOKS
Toimitus 12-18 arkipäivässä
30 päivän palautusoikeus
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.
Saatat myös pitää
Kuvaus
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.
Lisätietoja
| Kirjoittaja | Sohail Bahmani |
|---|---|
| Julkaisija | Springer Nature Switzerland |
| Series | Springer Theses |
| Julkaisuvuosi | 2016 |
| Kannen tyyppi | Pehmeäkantinen |
| EAN | 9783319377193 |