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 of the inaccuracies that occurred with the use of previous models.
1116466342
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 of the inaccuracies that occurred with the use of previous models.
169.99 In Stock
Algorithms for Sparsity-Constrained Optimization

Algorithms for Sparsity-Constrained Optimization

by Sohail Bahmani
Algorithms for Sparsity-Constrained Optimization

Algorithms for Sparsity-Constrained Optimization

by Sohail Bahmani

Hardcover(2014)

$169.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
    Not Eligible for Free Shipping
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers


Overview

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.

Product Details

ISBN-13: 9783319018805
Publisher: Springer International Publishing
Publication date: 10/08/2013
Series: Springer Theses , #261
Edition description: 2014
Pages: 107
Product dimensions: 6.10(w) x 9.25(h) x 0.02(d)

About the Author

Dr. Bahmani completed his thesis at Carnegie Mellon University and is currently employed by the Georgia Institute of Technology.

Table of Contents

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.

From the B&N Reads Blog

Customer Reviews