MKL-L_0/1-SVM

08/23/2023
by   Bin Zhu, et al.
0

This paper presents a Multiple Kernel Learning (abbreviated as MKL) framework for the Support Vector Machine (SVM) with the (0, 1) loss function. Some KKT-like first-order optimality conditions are provided and then exploited to develop a fast ADMM algorithm to solve the nonsmooth nonconvex optimization problem. Numerical experiments on real data sets show that the performance of our MKL-L_0/1-SVM is comparable with the one of the leading approaches called SimpleMKL developed by Rakotomamonjy, Bach, Canu, and Grandvalet [Journal of Machine Learning Research, vol. 9, pp. 2491-2521, 2008].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/08/2023

An ADMM Solver for the MKL-L_0/1-SVM

We formulate the Multiple Kernel Learning (abbreviated as MKL) problem f...
research
06/02/2021

Improvement over Pinball Loss Support Vector Machine

Recently, there have been several papers that discuss the extension of t...
research
02/09/2021

Learning a powerful SVM using piece-wise linear loss functions

In this paper, we have considered general k-piece-wise linear convex los...
research
07/23/2019

A Hardware-Efficient ADMM-Based SVM Training Algorithm for Edge Computing

This work demonstrates a hardware-efficient support vector machine (SVM)...
research
11/30/2015

Alternating direction method of multipliers for regularized multiclass support vector machines

The support vector machine (SVM) was originally designed for binary clas...
research
09/30/2017

Gaussian Three-Dimensional kernel SVM for Edge Detection Applications

This paper presents a novel and uniform algorithm for edge detection bas...
research
10/16/2017

Spectral Algorithms for Computing Fair Support Vector Machines

Classifiers and rating scores are prone to implicitly codifying biases, ...

Please sign up or login with your details

Forgot password? Click here to reset