A robust regularization path for the Doubly Regularized Support Vector Machine - Archive ouverte HAL Access content directly
Proceedings Year : 2014

## A robust regularization path for the Doubly Regularized Support Vector Machine

S. Canu

#### Abstract

The Doubly Regularized SVM (DrSVM) is an extension of SVM using a mixture of $L2$ and $L1$ norm penalties. This kind of penalty, sometimes referred as the elastic net, allows to perform variable selection while taking into account correlations between variables. Introduced by Wang, an efficient algorithm to compute the whole DrSVM solution path has been proposed. Unfortunately, in some cases, this path is discontinuous, and thus not piecewise linear. To solve this problem, we propose here a new sub gradient formulation of the DrSVM problem. This led us to propose an alternative L1 regularization path algorithm. This reformulation effciently addresses the aforementioned problem and makes the initialization step more generic. The results show the validity of our sub-gradient formulation and the efficiency compared to the initial formulation.

### Dates and versions

cea-01844455 , version 1 (24-03-2023)

### Identifiers

• HAL Id : cea-01844455 , version 1

### Cite

Antoine Lachaud, David Mercier, S. Canu, Frédéric Suard. A robust regularization path for the Doubly Regularized Support Vector Machine. i6doc.com publication, pp.313-318, 2014, 978-287419095-7. ⟨cea-01844455⟩

### Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

0 View