Kernelized Supervised Dictionary Learning
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Decomposing MLP Activations into Interpretable Features via Semi-Nonnegative Matrix Factorization
Interpreting Large Text-to-Image Diffusion Models with Dictionary Learning
DB-KSVD: Scalable Alternating Optimization for Disentangling High-Dimensional Embedding Spaces
Modeling Musical Genre Trajectories through Pathlet Learning
Towards Understanding the Nature of Attention with Low-Rank Sparse Decomposition
Topological Dictionary Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.