Analyzing sparse dictionaries for online learning with kernels - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Signal Processing Year : 2015

Analyzing sparse dictionaries for online learning with kernels


Many signal processing and machine learning methods share essentially the same linear-in-the-parameter model, with as many parameters as available samples as in kernel-based machines. Sparse approximation is essential in many disciplines, with new challenges emerging in online learning with kernels. To this end, several sparsity measures have been proposed in the literature to quantify sparse dictionaries and constructing relevant ones, the most prolific ones being the distance, the approximation, the coherence and the Babel measures. In this paper, we analyze sparse dictionaries based on these measures. By conducting an eigenvalue analysis, we show that these sparsity measures share many properties, including the linear independence condition and inducing a well-posed optimization problem. Furthermore, we prove that there exists a quasi-isometry between the parameter (i.e., dual) space and the dictionary's induced feature space.
Fichier principal
Vignette du fichier
15.sparse.eigen.pdf (449.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01965568 , version 1 (26-12-2018)



Paul Honeine. Analyzing sparse dictionaries for online learning with kernels. IEEE Transactions on Signal Processing, 2015, 63 (23), pp.6343 - 6353. ⟨10.1109/TSP.2015.2457396⟩. ⟨hal-01965568⟩
17 View
202 Download



Gmail Facebook Twitter LinkedIn More