Fast column generation for atomic norm regularization - École des Ponts ParisTech Access content directly
Conference Papers Year : 2017

Fast column generation for atomic norm regularization


We consider optimization problems that consist in minimizing a quadratic function under an atomic norm regularization or constraint. In the line of work on conditional gradient algorithms, we show that the fully corrective Frank-Wolfe (FCFW) algorithm — which is most naturally reformulated as a column generation algorithm in the regularized case — can be made particularly efficient for difficult problems in this family by solving the simplicial or conical subproblems produced by FCFW using a special instance of a classical active set algorithm for quadratic programming (Nocedal and Wright, 2006) that generalizes the min-norm point algorithm (Wolfe, 1976). Our experiments show that the algorithm takes advantages of warm-starts and of the sparsity induced by the norm, displays fast linear convergence, and clearly outperforms the state-of-the-art, for both complex and classical norms, including the standard group Lasso.
Fichier principal
Vignette du fichier
aistats_marina_cr.pdf (639.62 Ko) Télécharger le fichier
supplementary_aistats_cr.pdf (314.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Origin : Files produced by the author(s)

Dates and versions

hal-01502575 , version 1 (09-04-2017)


  • HAL Id : hal-01502575 , version 1


Marina Vinyes, Guillaume Obozinski. Fast column generation for atomic norm regularization. The 20th International Conference on Artificial Intelligence and Statistics, Apr 2017, Fort Lauderdale, United States. ⟨hal-01502575⟩
161 View
247 Download


Gmail Facebook X LinkedIn More