Algorithms for Learning Kernels Based on Centered Alignment
Corinna Cortes, Mehryar Mohri, Afshin Rostamizadeh

TL;DR
This paper introduces new algorithms for learning kernels using centered alignment, demonstrating superior empirical performance over existing methods in classification and regression tasks.
Contribution
The paper proposes novel algorithms based on centered alignment, including efficient kernel learning methods and theoretical bounds, advancing kernel learning techniques.
Findings
Algorithms outperform uniform combination solutions in experiments
Centered alignment provides a robust similarity measure for kernels
Theoretical bounds support the effectiveness of the proposed methods
Abstract
This paper presents new and effective algorithms for learning kernels. In particular, as shown by our empirical results, these algorithms consistently outperform the so-called uniform combination solution that has proven to be difficult to improve upon in the past, as well as other algorithms for learning kernels based on convex combinations of base kernels in both classification and regression. Our algorithms are based on the notion of centered alignment which is used as a similarity measure between kernels or kernel matrices. We present a number of novel algorithmic, theoretical, and empirical results for learning kernels based on our notion of centered alignment. In particular, we describe efficient algorithms for learning a maximum alignment kernel by showing that the problem can be reduced to a simple QP and discuss a one-stage algorithm for learning both a kernel and a hypothesis…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and ELM · Sparse and Compressive Sensing Techniques · Domain Adaptation and Few-Shot Learning
