Sparse and robust geometric twin support vector machine via asymmetric RoBoSS loss function

• URL: http://arxiv.org/abs/2608.11567v1
• Date: Wed, 12 Aug 2026 02:19:03 GMT
• Title: Sparse and robust geometric twin support vector machine via asymmetric RoBoSS loss function
• Abstract summary: We propose an algorithm that mitigates the impact of label noise and enhances the zero-mean noise around the boundary hyperplanes.<n>We also apply the algorithm to index tracking tasks, where results for the different indices in the China stock market show that it can achieve satisfactory performance.
• Score: 4.243926243206826
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In real-world scenarios, the training data usually contains redundant features, label noise and feature noise, which provide severe challenges for the efficiency of machine learning methods. Since standard support vector machine (SVM) adopts $l_2$-norm penalty and hinge loss function, it lacks the ability of selecting significant features and is sensitive to noise. To address these issues, this paper proposes a novel asymmetric, robust, bounded, sparse and smooth (aR) loss function for $l_1$-norm penalized geometric twin SVM (aRSGTSVM) to handle classification and regression tasks. The $l_1$-norm penalty can achieve the feature selection. The proposed aR loss function can not only effectively mitigate the impact of label noise, but also significantly enhance the stability to resampling noise, i.e., the zero-mean feature noise around the boundary hyperplanes. Furthermore, a statistical analysis of the robustness of aRSGTSVM was also conducted using the influence function. Since aRSGTSVM involves nonconvex and nonsmooth optimization, we develop a fast and stable proximal gradient descent based solving algorithm. Compared with related state-of-the-art methods, experimental results demonstrate the superiority of the proposed aRSGTSVM on both synthetic and UCI datasets. Furthermore, we apply aRSGTSVM to index tracking tasks, where results for tracking the different indices in the China stock market show that it can achieve satisfactory performance.

Related papers

• Variational Rectification Inference for Learning with Noisy Labels [74.85528327499662]
  We propose variational rectification inference (VRI) to formulate the adaptive rectification for loss functions.<n>VRI is constructed as a hierarchical Bayes by treating the rectifying vector as a latent variable.<n>By introducing the variational term in VRI, the conditional posterior is estimated accurately and avoids collapsing to a Dirac delta function.
  arXiv  Detail & Related papers  (2026-03-18T01:25:08Z)
• Robust support vector model based on bounded asymmetric elastic net loss for binary classification [4.4568150591571785]
  We propose a novel bounded elastic net ($L_baen$) loss function combine it with the support vector machine (SVM)<n>By proving violation tolerance upper bound bound (VTUB) of BAEN-SVM, we show that the model is geometrically well-defined.<n>We derive that the influence function of BAEN-SVM is bounded, providing a theoretical guarantee of its robustness.
  arXiv  Detail & Related papers  (2026-03-06T13:17:36Z)
• Support Vector Machine Classifier with Rescaled Huberized Pinball Loss [0.0]
  Support vector machines (SVM) are widely used in machine learning classification tasks.<n>SVM models suffer from sensitivity to outliers instability in resampling and in small-sample data.<n>We develop a novel rescaled performance applications asymmetric loss function.
  arXiv  Detail & Related papers  (2025-11-27T03:31:07Z)
• Introducing Fractional Classification Loss for Robust Learning with Noisy Labels [2.312414367096445]
  We introduce Fractional Classification Loss (FCL), an adaptive robust loss that automatically calibrates its robustness to label noise during training.<n>FCL achieves state-of-the-art results without the need for manual hyper parameter tuning.
  arXiv  Detail & Related papers  (2025-08-08T14:20:52Z)
• Accelerated zero-order SGD under high-order smoothness and overparameterized regime [79.85163929026146]
  We present a novel gradient-free algorithm to solve convex optimization problems. Such problems are encountered in medicine, physics, and machine learning. We provide convergence guarantees for the proposed algorithm under both types of noise.
  arXiv  Detail & Related papers  (2024-11-21T10:26:17Z)
• Advancing RVFL networks: Robust classification with the HawkEye loss function [0.0]
  We propose incorporation of HawkEye loss (H-loss) function into the Random vector functional link (RVFL) framework. H-loss function features nice mathematical properties, including smoothness and boundedness, while simultaneously incorporating an insensitive zone. The proposed H-RVFL model's effectiveness is validated through experiments on $40$ datasets from UCI and KEEL repositories.
  arXiv  Detail & Related papers  (2024-10-01T08:48:05Z)
• Advancing Supervised Learning with the Wave Loss Function: A Robust and Smooth Approach [0.0]
  We present a novel contribution to the realm of supervised machine learning: an asymmetric loss function named wave loss. We incorporate the proposed wave loss function into the least squares setting of support vector machines (SVM) and twin support vector machines (TSVM) To empirically showcase the effectiveness of the proposed Wave-SVM and Wave-TSVM, we evaluate them on benchmark UCI and KEEL datasets.
  arXiv  Detail & Related papers  (2024-04-28T07:32:00Z)
• Improve Noise Tolerance of Robust Loss via Noise-Awareness [60.34670515595074]
  We propose a meta-learning method which is capable of adaptively learning a hyper parameter prediction function, called Noise-Aware-Robust-Loss-Adjuster (NARL-Adjuster for brevity) Four SOTA robust loss functions are attempted to be integrated with our algorithm, and comprehensive experiments substantiate the general availability and effectiveness of the proposed method in both its noise tolerance and performance.
  arXiv  Detail & Related papers  (2023-01-18T04:54:58Z)
• Label Distributionally Robust Losses for Multi-class Classification: Consistency, Robustness and Adaptivity [55.29408396918968]
  We study a family of loss functions named label-distributionally robust (LDR) losses for multi-class classification. Our contributions include both consistency and robustness by establishing top-$k$ consistency of LDR losses for multi-class classification. We propose a new adaptive LDR loss that automatically adapts the individualized temperature parameter to the noise degree of class label of each instance.
  arXiv  Detail & Related papers  (2021-12-30T00:27:30Z)
• Asymmetric Loss Functions for Learning with Noisy Labels [82.50250230688388]
  We propose a new class of loss functions, namely textitasymmetric loss functions, which are robust to learning with noisy labels for various types of noise. Experimental results on benchmark datasets demonstrate that asymmetric loss functions can outperform state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-06-06T12:52:48Z)
• Estimating Average Treatment Effects with Support Vector Machines [77.34726150561087]
  Support vector machine (SVM) is one of the most popular classification algorithms in the machine learning literature. We adapt SVM as a kernel-based weighting procedure that minimizes the maximum mean discrepancy between the treatment and control groups. We characterize the bias of causal effect estimation arising from this trade-off, connecting the proposed SVM procedure to the existing kernel balancing methods.
  arXiv  Detail & Related papers  (2021-02-23T20:22:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.