Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Sparse Prediction with the $k$-Support Norm

Abstract : We derive a novel norm that corresponds to the tightest convex relaxation of sparsity combined with an $\ell_2$ penalty. We show that this new {\em $k$-support norm} provides a tighter relaxation than the elastic net and is thus a good replacement for the Lasso or the elastic net in sparse prediction problems. Through the study of the $k$-support norm, we also bound the looseness of the elastic net, thus shedding new light on it and providing justification for its use.
Document type :
Preprints, Working Papers, ...
Complete list of metadata
Contributor : Puneet Kumar Dokania Connect in order to contact the contributor
Submitted on : Friday, August 30, 2013 - 12:02:29 PM
Last modification on : Friday, January 21, 2022 - 3:01:24 AM

Links full text


  • HAL Id : hal-00855999, version 1
  • ARXIV : 1204.5043



Andreas Argyriou, Rina Foygel, Nathan Srebro. Sparse Prediction with the $k$-Support Norm. 2012. ⟨hal-00855999⟩



Record views