Algorithms for Sparsity-Constrained Optimization
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 o...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Libro electrónico |
| Lenguaje: | Inglés |
| Publicado: |
Cham :
Springer International Publishing : Imprint: Springer,
2014.
|
| Colección: | Springer Theses, Recognizing Outstanding Ph.D. Research,
261 |
| Materias: | |
| Acceso en línea: | http://dx.doi.org/10.1007/978-3-319-01881-2 |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
| LEADER | 02257Cam#a22004935i#4500 | ||
|---|---|---|---|
| 001 | INGC-EBK-000254 | ||
| 003 | AR-LpUFI | ||
| 005 | 20220927105736.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 131007s2014 gw | s |||| 0|eng d | ||
| 020 | |a 9783319018812 | ||
| 024 | 7 | |a 10.1007/978-3-319-01881-2 |2 doi | |
| 050 | 4 | |a TK5102.9 | |
| 050 | 4 | |a TA1637-1638 | |
| 050 | 4 | |a TK7882.S65 | |
| 072 | 7 | |a TTBM |2 bicssc | |
| 072 | 7 | |a UYS |2 bicssc | |
| 072 | 7 | |a TEC008000 |2 bisacsh | |
| 072 | 7 | |a COM073000 |2 bisacsh | |
| 100 | 1 | |a Bahmani, Sohail. |9 260576 | |
| 245 | 1 | 0 | |a Algorithms for Sparsity-Constrained Optimization |h [libro electrónico] / |c by Sohail Bahmani. |
| 260 | 1 | |a Cham : |b Springer International Publishing : |b Imprint: Springer, |c 2014. | |
| 300 | |a xxiI, 107 p : |b il. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Springer Theses, Recognizing Outstanding Ph.D. Research, |x 2190-5053 ; |v 261 | |
| 505 | 0 | |a Introduction -- Preliminaries -- Sparsity-Constrained Optimization -- Background -- 1-bit Compressed Sensing -- Estimation Under Model-Based Sparsity -- Projected Gradient Descent for `p-constrained Least Squares -- Conclusion and Future Work. | |
| 520 | |a 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. | ||
| 650 | 0 | |a Engineering. |9 259622 | |
| 650 | 0 | |a Image processing. |9 259604 | |
| 650 | 0 | |a Computer science |x Mathematics. |9 259921 | |
| 650 | 0 | |a Computer mathematics. |9 259612 | |
| 650 | 2 | 4 | |a Signal, Image and Speech Processing. |9 259616 |
| 650 | 2 | 4 | |a Mathematical Applications in Computer Science. |9 260577 |
| 650 | 2 | 4 | |a Image Processing and Computer Vision. |9 259608 |
| 776 | 0 | 8 | |i Printed edition: |z 9783319018805 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1007/978-3-319-01881-2 |
| 912 | |a ZDB-2-ENG | ||
| 929 | |a COM | ||
| 942 | |c EBK |6 _ | ||
| 950 | |a Engineering (Springer-11647) | ||
| 999 | |a SKV |c 27682 |d 27682 | ||