Loss function plays an important role in data classification. Manyloss functions have been proposed and applied to differentclassification problems. This paper proposes a new so called thesmoothed 0-1 loss function, that could be considered as anapproximation of the classical 0-1 loss function. Due to thenon-convexity property of the proposed loss function, globaloptimization methods are required to solve the correspondingoptimization problems. Together with the proposed loss function, wecompare the performance of several existing loss functions in theclassification of noisy data sets. In this comparison, differentoptimization problems are considered in regards to the convexity andsmoothness of different loss functions. The experimental res...
What are the natural loss functions for binary class probability estimation? This question has a sim...
Robust learning in presence of label noise is an important problem of current interest. Training dat...
In this paper, we theoretically study the problem of binary classification in the presence of random...
The application of robust loss function is an important approach to classify data sets that contamin...
Problems of data classification can be studied in the framework of regularization theory as ill-pose...
Problems of data classification can be studied in the framework of regularization theory as ill-pose...
In many applications, the training data, from which one needs to learn a classifier, is corrupted wi...
In this letter, we investigate the impact of choosing different loss functions from the viewpoint of...
A prediction rule in binary classification that aims to achieve the lowest probability of mis-classi...
This paper examines the role and efficiency of the non-convex loss functions for binary classificati...
The combination of using loss functions that are both Bayes consistent and margin enforcing has lead...
Convex potential minimisation is the de facto approach to binary classification. However, Long and S...
Robust regression and classification are often thought to require non-convex loss functions that pre...
In this paper we investigate the impact of choosing different loss functions from the viewpoint of st...
In many classification procedures, the classification function is obtained (or trained) by minimizi...
What are the natural loss functions for binary class probability estimation? This question has a sim...
Robust learning in presence of label noise is an important problem of current interest. Training dat...
In this paper, we theoretically study the problem of binary classification in the presence of random...
The application of robust loss function is an important approach to classify data sets that contamin...
Problems of data classification can be studied in the framework of regularization theory as ill-pose...
Problems of data classification can be studied in the framework of regularization theory as ill-pose...
In many applications, the training data, from which one needs to learn a classifier, is corrupted wi...
In this letter, we investigate the impact of choosing different loss functions from the viewpoint of...
A prediction rule in binary classification that aims to achieve the lowest probability of mis-classi...
This paper examines the role and efficiency of the non-convex loss functions for binary classificati...
The combination of using loss functions that are both Bayes consistent and margin enforcing has lead...
Convex potential minimisation is the de facto approach to binary classification. However, Long and S...
Robust regression and classification are often thought to require non-convex loss functions that pre...
In this paper we investigate the impact of choosing different loss functions from the viewpoint of st...
In many classification procedures, the classification function is obtained (or trained) by minimizi...
What are the natural loss functions for binary class probability estimation? This question has a sim...
Robust learning in presence of label noise is an important problem of current interest. Training dat...
In this paper, we theoretically study the problem of binary classification in the presence of random...