A Comparison Study of Nonlinear Kernels
Ping Li

TL;DR
This study compares five nonlinear kernels across various datasets, highlighting the min-max kernel's superior performance and efficiency, and explores linearization techniques to reduce computational costs, suggesting new directions for kernel development.
Contribution
The paper provides a comprehensive comparison of five nonlinear kernels, demonstrating the effectiveness of the min-max kernel and its linearization method, and proposing future research directions for kernel improvements.
Findings
Min-max kernel often outperforms RBF and fRBF kernels.
Randomization of the min-max kernel is highly efficient.
Combining kernels shows promising accuracy improvements.
Abstract
In this paper, we compare 5 different nonlinear kernels: min-max, RBF, fRBF (folded RBF), acos, and acos-, on a wide range of publicly available datasets. The proposed fRBF kernel performs very similarly to the RBF kernel. Both RBF and fRBF kernels require an important tuning parameter (). Interestingly, for a significant portion of the datasets, the min-max kernel outperforms the best-tuned RBF/fRBF kernels. The acos kernel and acos- kernel also perform well in general and in some datasets achieve the best accuracies. One crucial issue with the use of nonlinear kernels is the excessive computational and memory cost. These days, one increasingly popular strategy is to linearize the kernels through various randomization algorithms. In our study, the randomization method for the min-max kernel demonstrates excellent performance compared to the randomization…
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
TopicsFace and Expression Recognition · Sparse and Compressive Sensing Techniques · Machine Learning and ELM
