21787 articles – 15599 references  [version française]

hal-00613125, version 2

Optimization with Sparsity-Inducing Penalties

Francis Bach () 1, 2, Rodolphe Jenatton () 1, 2, Julien Mairal () 3, Guillaume Obozinski () 1, 2

Foundations and Trends in Machine Learning (2011) -

Abstract: 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 non-smooth norms. The goal of this paper is to present from a general perspective optimization tools and techniques dedicated to such sparsity-inducing penalties. We cover proximal methods, block-coordinate descent, reweighted $\ell_2$-penalized techniques, working-set and homotopy methods, as well as non-convex formulations and extensions, and provide an extensive set of experiments to compare various algorithms from a computational point of view.

  • 1:  Laboratoire d'informatique de l'école normale supérieure (LIENS)
  • CNRS : UMR8548 – Ecole normale supérieure de Paris - ENS Paris
  • 2:  SIERRA (INRIA Paris - Rocquencourt)
  • INRIA : PARIS - ROCQUENCOURT – Ecole normale supérieure de Paris - ENS Paris – CNRS : UMR8548
  • 3:  Department of Statistics
  • University of California, Berkeley
  • Domain : Computer Science/Learning
    Mathematics/Optimization and Control
    Statistics/Other Statistics
  • Keywords : Convex optimization – sparsity
  • Available versions :  v1 (2011-08-03) v2 (2011-11-22)
 
  • hal-00613125, version 2
  • http://hal.archives-ouvertes.fr/hal-00613125
  • oai:hal.archives-ouvertes.fr:hal-00613125
  • From: Francis Bach <>
  • Submitted on: Sunday, 20 November 2011 14:56:23
  • Updated on: Sunday, 4 December 2011 14:20:16