Optimization with Sparsity-Inducing Penalties

Optimization with Sparsity-Inducing Penalties
Author :
Publisher :
Total Pages : 122
Release :
ISBN-10 : 1601985118
ISBN-13 : 9781601985118
Rating : 4/5 (18 Downloads)

Book Synopsis Optimization with Sparsity-Inducing Penalties by : Francis Bach

Download or read book Optimization with Sparsity-Inducing Penalties written by Francis Bach and published by . This book was released on 2012 with total page 122 pages. Available in PDF, EPUB and Kindle. Book excerpt: Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. They were first dedicated to linear variable selection but numerous extensions have now emerged such as structured sparsity or kernel selection. It turns out that many of the related estimation problems can be cast as convex optimization problems by regularizing the empirical risk with appropriate nonsmooth norms. Optimization with Sparsity-Inducing Penalties presents optimization tools and techniques dedicated to such sparsity-inducing penalties from a general perspective. It covers proximal methods, block-coordinate descent, reweighted ?2-penalized techniques, working-set and homotopy methods, as well as non-convex formulations and extensions, and provides an extensive set of experiments to compare various algorithms from a computational point of view. The presentation of Optimization with Sparsity-Inducing Penalties is essentially based on existing literature, but the process of constructing a general framework leads naturally to new results, connections and points of view. It is an ideal reference on the topic for anyone working in machine learning and related areas.


Optimization with Sparsity-Inducing Penalties Related Books

Optimization with Sparsity-Inducing Penalties
Language: en
Pages: 122
Authors: Francis Bach
Categories: BUSINESS & ECONOMICS
Type: BOOK - Published: 2012 - Publisher:

DOWNLOAD EBOOK

Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. They were first dedicated to linear variable selection
Optimization with Sparsity-Inducing Penalties
Language: en
Pages: 124
Authors: Francis Bach
Categories: Computers
Type: BOOK - Published: 2011-12-23 - Publisher:

DOWNLOAD EBOOK

Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. They were first dedicated to linear variable selection
Learning with Submodular Functions
Language: en
Pages: 228
Authors: Francis Bach
Categories: Convex functions
Type: BOOK - Published: 2013 - Publisher:

DOWNLOAD EBOOK

Submodular functions are relevant to machine learning for at least two reasons: (1) some problems may be expressed directly as the optimization of submodular fu
Proximal Algorithms
Language: en
Pages: 130
Authors: Neal Parikh
Categories: Mathematics
Type: BOOK - Published: 2013-11 - Publisher: Now Pub

DOWNLOAD EBOOK

Proximal Algorithms discusses proximal operators and proximal algorithms, and illustrates their applicability to standard and distributed convex optimization in
Statistical Learning with Sparsity
Language: en
Pages: 354
Authors: Trevor Hastie
Categories: Business & Economics
Type: BOOK - Published: 2015-05-07 - Publisher: CRC Press

DOWNLOAD EBOOK

Discover New Methods for Dealing with High-Dimensional DataA sparse statistical model has only a small number of nonzero parameters or weights; therefore, it is