On robust asymmetric Lagrangian ν-twin support vector regression using pinball loss function

• Published in: Applied soft computing Vol. 102; p. 107099
• Main Authors: Gupta, Deepak, Gupta, Umesh
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.04.2021
• Subjects: Asymmetric loss function; Pinball loss; Support vector regression; Twin support vector regression; Unconstrained convex minimization; Twin support vector regression; Support vector regression; Pinball loss; Unconstrained convex minimization; Asymmetric loss function
• DOI: 10.1016/j.asoc.2021.107099
• ISSN: 1568-4946

The main objective of twin support vector regression (TSVR) is to find the optimum regression function based on the ε-insensitive up- and down-bound with equal influences on the regression function where all the data points have a different location above the up-bound points and below the down-bound points. However, the effects of all data points must be distinct based on their distribution in the regression function. Recently, asymmetric ν-twin support vector regression (Asy-ν-TSVR) is encouraged on the same subject but still, the present matrices in the mathematical formulation have faced the problem of semi-definite. In order to handle this problem effectively, a new regressor model named as robust asymmetric Lagrangian ν-twin support vector regression using pinball loss function (URALTSVR) proposes as a pair of the unconstrained minimization problem to handle not only the noise sensitivity and instability of re-sampling but also consist positive definite matrices. Here, we suggest the proposed model URALTSVR in such a way where the pinball loss function is playing a vital role to control the fitting error inside the asymmetric tube. One of the advantages is that unlike TSVR and Asy-ν-TSVR, it considers the concept of structural risk minimization principle through the inclusion of regularization term as well as change the one-norm of the vector of the slack variable by two-norm, which yields the dual problem to be strongly convex, stable and well-posed. Aforementioned, the proposed formulation has a continuous and piecewise quadratic problem that is solved by their gradients based iterative approaches. Specifically, we analyze the three implementations of URALTSVR with the baselines approaches support vector regression (SVR), TSVR and Asy-ν-TSVR, which discard the dependencies to solve a pair of quadratic programming problem (QPP) for obtaining the unique global solution. Overall, SRALTSVR1 based on smooth approximation function performs outstanding for artificial and real-world datasets. [Display omitted] •Proposed a novel approach as a pair of the unconstrained minimization problem.•Applied generalized derivative and smoothing approaches to find the Hessian matrix.•By using gradient based iterative schemes determine solution of the problem.•Improved the stability in the dual formulations and makes the model well-posed.•Performance results of URALTSVR are carried out on artificial & realworld datasets.