.png){kind=icon}
.png){kind=icon}
Return
Local Rademacher Complexity Machine
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2018.10.087.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Support Vector Machines (SVMs) are a state-of-the-art and powerful learning algorithm that can effectively solve many real world problems. SVMs are the transposition of the Vapnik-Chervonenkis (VC) theory into a learning algorithm. In this paper, we present the Local Rademacher Complexity Machine (LRCM), a transposition of the Local Rademacher Complexity (LRC) theory, the state-of-the-art evolution of the VC theory, into a learning algorithm. Analogously to what has been done for the SVMs, we will present first the theoretical ideas behind the LRC theory, we will show how these ideas can be translated into a learning algorithm, the LRCM, and then how the LRCM can be made efficient and kernelizable. By exploiting a series of real world datasets, we will show the effectiveness of the LRCM against the SVMs. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Vapnik-Chervonenkis Theory
Support Vector Machines
Local Rademacher Complexity Theory
Local Rademacher Complexity Machine
Kernel methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.