Learning a powerful SVM using piece-wise linear loss functions

02/09/2021
by   Pritam Anand, et al.
0

In this paper, we have considered general k-piece-wise linear convex loss functions in SVM model for measuring the empirical risk. The resulting k-Piece-wise Linear loss Support Vector Machine (k-PL-SVM) model is an adaptive SVM model which can learn a suitable piece-wise linear loss function according to nature of the given training set. The k-PL-SVM models are general SVM models and existing popular SVM models, like C-SVM, LS-SVM and Pin-SVM models, are their particular cases. We have performed the extensive numerical experiments with k-PL-SVM models for k = 2 and 3 and shown that they are improvement over existing SVM models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2021

Improvement over Pinball Loss Support Vector Machine

Recently, there have been several papers that discuss the extension of t...
research
08/23/2023

MKL-L_0/1-SVM

This paper presents a Multiple Kernel Learning (abbreviated as MKL) fram...
research
09/05/2023

RoBoSS: A Robust, Bounded, Sparse, and Smooth Loss Function for Supervised Learning

In the domain of machine learning algorithms, the significance of the lo...
research
06/12/2020

Weston-Watkins Hinge Loss and Ordered Partitions

Multiclass extensions of the support vector machine (SVM) have been form...
research
10/18/2013

On the Suitable Domain for SVM Training in Image Coding

Conventional SVM-based image coding methods are founded on independently...
research
05/24/2022

Soft-SVM Regression For Binary Classification

The binomial deviance and the SVM hinge loss functions are two of the mo...
research
06/23/2023

The Proximal Operator of the Piece-wise Exponential Function and Its Application in Compressed Sensing

This paper characterizes the proximal operator of the piece-wise exponen...

Please sign up or login with your details

Forgot password? Click here to reset