Skip to Main content Skip to Navigation
Conference papers

Epigraphical proximal projection for sparse multiclass SVM

Abstract : Sparsity inducing penalizations are useful tools in variational methods for machine learning. In this paper, we design a learning algorithm for multiclass support vector machines that allows us to enforce sparsity through various nonsmooth reg-ularizations, such as the mixed L1,p-norm with p ≥ 1. The proposed constrained convex optimization approach involves an epigraphical constraint for which we derive the closed-form expression of the associated projection. This sparse multiclass SVM problem can be efficiently implemented thanks to the flexibility offered by recent primal-dual proximal algorithms. Experiments carried out for handwritten digits demonstrate the interest of considering nonsmooth sparsity-inducing reg-ularizations and the efficiency of the proposed epigraphical projection method.
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Giovanni Chierchia <>
Submitted on : Monday, May 21, 2018 - 9:20:41 PM
Last modification on : Thursday, February 4, 2021 - 6:10:04 PM
Long-term archiving on: : Monday, September 24, 2018 - 11:00:30 PM


Files produced by the author(s)



Giovanni Chierchia, Nelly Pustelnik, Jean-Christophe Pesquet, Beatrice Pesquet-Popescu. Epigraphical proximal projection for sparse multiclass SVM. IEEE International Conference on Acoustics, Speech and Signal Processing, May 2014, Florence, Italy. ⟨10.1109/ICASSP.2014.6855222⟩. ⟨hal-01796717⟩



Record views


Files downloads