robust-loss

This paper proposes a new asymmetric robust bounded sparse smooth (aR) loss function for l1-norm penalized geometric twin support vector machine (aRSGTSVM) to handle classification and regression tasks with label and feature noise, achieving feature selection and robustness. Experiments on synthetic and UCI datasets plus China stock market index tracking demonstrate superiority.