Kernelized Supervised Dictionary Learning

Abstract

In this paper, we propose supervised dictionary learning (SDL) by incorporating information on class labels into the learning of the dictionary. To this end, we propose to learn the dictionary in a space where the dependency between the signals and their corresponding labels is maximized. To maximize this dependency, the recently introduced Hilbert Schmidt independence criterion (HSIC) is used. One of the main advantages of this novel approach for SDL is that it can be easily kernelized by incorporating a kernel, particularly a data-derived kernel such as normalized compression distance, into the formulation. The learned dictionary is compact and the proposed approach is fast. We show that it outperforms other unsupervised and supervised dictionary learning approaches in the literature, using real-world data.

This paper has been withdrawn by the author as it has been already published by the IEEE Trans. on Signal Processing and is now available online

References in corpus (3)

• Pathwise coordinate optimization
• Supervised Dictionary Learning
• Detecting User Engagement in Everyday Conversations

Cited by in corpus (7)

• Linearized Kernel Dictionary Learning
• Supervised Dictionary Learning and Sparse Representation-A Review
• Structure-Aware Classification using Supervised Dictionary Learning
• Weakly-supervised Dictionary Learning
• On the Invariance of Dictionary Learning and Sparse Representation to Projecting Data to a Discriminative Space
• Optimal Projections for Discriminative Dictionary Learning using the JL-lemma
• Targeted Source Detection for Environmental Data