ImageNet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever et al.
128
Citations
3
Influential Citations
Mathematics
Venue
2024
Year
The kernel method is a tool that converts data to a kernel space where operation can be performed. When converted to a high-dimensional feature space by using kernel functions, the data samples are more likely to be linearly separable. Traditional machine learning methods can be extended to the kernel space, such as the radial basis function (RBF) network. As a kernel-based method, support vector machine (SVM) is one of the most popular nonparametric classification methods, and is optimal in terms of computational learning theory. Based on statistical learning theory and the maximum margin principle, SVM attempts to determine an optimal hyperplane by addressing a quadratic programming (QP) problem. Using Vapnik–Chervonenkis dimension theory, SVM maximizes generalization performance by finding the widest classification margin within the feature space. In this paper, kernel machines and SVMs are systematically introduced. We first describe how to turn classical methods into kernel machines, and then give a literature review of existing kernel machines. We then introduce the SVM model, its principles, and various SVM training methods for classification, clustering, and regression. Related topics, including optimizing model architecture, are also discussed. We conclude by outlining future directions for kernel machines and SVMs. This article functions both as a state-of-the-art survey and a tutorial.
This paper provides a thorough and accessible overview of kernel machines and support vector machines (SVMs), two foundational techniques in machine learning. As a combined survey and tutorial, it is valuable for both newcomers seeking to understand the principles and experienced practitioners looking for a consolidated reference. The paper covers the theoretical underpinnings—statistical learning theory, Vapnik–Chervonenkis dimension, and the maximum margin principle—while also offering practical guidance on training methods for classification, clustering, and regression. Given the enduring relevance of SVMs in domains like bioinformatics, text classification, and image recognition, this work helps bridge the gap between classical theory and modern applications.
The paper does not present new experimental results. Instead, it synthesizes existing knowledge from over 128 cited references, providing a qualitative assessment of the strengths and weaknesses of various kernel methods and SVM training approaches. No quantitative metrics or benchmarks are reported.
This paper serves as a definitive reference for kernel methods and SVMs, consolidating decades of research into a single coherent narrative. Its tutorial nature makes it particularly useful for education and for practitioners who need to understand the theoretical foundations behind these widely used algorithms. By outlining future directions, it also helps guide ongoing research in areas such as large-scale kernel learning and hybrid models that combine SVMs with deep learning.
Alex Krizhevsky, Ilya Sutskever et al.
Ashish Vaswani, Noam Shazeer et al.
Douglas M. Bates, Martin Mächler et al.
Diederik P. Kingma, Jimmy Ba