Sparse $ε$ insensitive zone bounded asymmetric elastic net support vector machines for pattern classification

• URL: http://arxiv.org/abs/2604.07748v1
• Date: Thu, 09 Apr 2026 03:10:20 GMT
• Title: Sparse $ε$ insensitive zone bounded asymmetric elastic net support vector machines for pattern classification
• Abstract summary: Existing support vector machines(SVM) models are sensitive to noise and lack sparsity, which limits their performance.<n>We combine the elastic net loss with a robust loss framework to construct a $varepsilon-insensitive asymmetric bounded elastic net loss.<n>$varepsilon-BAEN-SVM outperforms traditional and existing robust SVMs.
• Score: 4.4568150591571785
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Existing support vector machines(SVM) models are sensitive to noise and lack sparsity, which limits their performance. To address these issues, we combine the elastic net loss with a robust loss framework to construct a sparse $\varepsilon$-insensitive bounded asymmetric elastic net loss, and integrate it with SVM to build $\varepsilon$ Insensitive Zone Bounded Asymmetric Elastic Net Loss-based SVM($\varepsilon$-BAEN-SVM). $\varepsilon$-BAEN-SVM is both sparse and robust. Sparsity is proven by showing that samples inside the $\varepsilon$-insensitive band are not support vectors. Robustness is theoretically guaranteed because the influence function is bounded. To solve the non-convex optimization problem, we design a half-quadratic algorithm based on clipping dual coordinate descent. It transforms the problem into a series of weighted subproblems, improving computational efficiency via the $\varepsilon$ parameter. Experiments on simulated and real datasets show that $\varepsilon$-BAEN-SVM outperforms traditional and existing robust SVMs. It balances sparsity and robustness well in noisy environments. Statistical tests confirm its superiority. Under the Gaussian kernel, it achieves better accuracy and noise insensitivity, validating its effectiveness and practical value.

Related papers

• Robust and sparse support vector machine via hybrid truncated loss for supervised classification [9.063787748337715]
  We propose a hybrid truncated loss function ($_Lmathrmht$-SVM) for single-view classification.<n>We show that $L_mathrmht$-SVM achieves higher accuracy with fewer support vectors and better noise than five single-view methods.
  arXiv  Detail & Related papers  (2026-06-04T07:53:48Z)
• 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)
• Evolution Strategies at the Hyperscale [57.75314521465674]
  We introduce EGGROLL, an evolution strategies (ES) algorithm designed to scale backprop-free optimization to large population sizes.<n>ES is a set of powerful blackbox optimisation methods that can handle non-differentiable or noisy objectives.<n>EGGROLL overcomes these bottlenecks by generating random matrices $Ain mathbbRmtimes r, Bin mathbbRntimes r$ with $rll min(m,n)$ to form a low-rank matrix perturbation $A Btop$
  arXiv  Detail & Related papers  (2025-11-20T18:56:05Z)
• $ε$-Softmax: Approximating One-Hot Vectors for Mitigating Label Noise [99.91399796174602]
  Noisy labels pose a common challenge for training accurate deep neural networks.<n>We propose $epsilon$-softmax, which modifies the outputs of the softmax layer to approximate one-hot vectors with a controllable error.<n>We prove theoretically that $epsilon$-softmax can achieve noise-tolerant learning with controllable excess risk bound for almost any loss function.
  arXiv  Detail & Related papers  (2025-08-04T13:10:48Z)
• FedSVD: Adaptive Orthogonalization for Private Federated Learning with LoRA [68.44043212834204]
  Low-Rank Adaptation (LoRA) is widely used for efficient fine-tuning of language models in learning (FL)<n>Low-Rank Adaptation (LoRA) is widely used for efficient fine-tuning of language models in learning (FL)
  arXiv  Detail & Related papers  (2025-05-19T07:32:56Z)
• A Novel Loss Function-based Support Vector Machine for Binary Classification [3.773980481058198]
  We propose a novel Slide loss function ($ell_s$) to construct the support vector machine classifier($ell_s$-SVM) By introducing the concept of proximal stationary point, and utilizing the property of Lipschitz continuity, we derive the first-order optimality conditions for $ell_s$-SVM. To efficiently handle $ell_s$-SVM, we devise a fast alternating direction method of multipliers with the working set.
  arXiv  Detail & Related papers  (2024-03-25T11:42:01Z)
• Kernel Support Vector Machine Classifiers with the $\ell_0$-Norm Hinge Loss [3.007949058551534]
  Support Vector Machine (SVM) has been one of the most successful machine learning techniques for binary classification problems. This paper is concentrated on vectors with hinge loss (referred as $ell$-KSVM), which is a composite function of hinge loss and $ell_$norm. Experiments on the synthetic and real datasets are illuminated to show that $ell_$-KSVM can achieve comparable accuracy compared with the standard KSVM.
  arXiv  Detail & Related papers  (2023-06-24T14:52:44Z)
• On Convergence of Incremental Gradient for Non-Convex Smooth Functions [63.51187646914962]
  In machine learning and network optimization, algorithms like shuffle SGD are popular due to minimizing the number of misses and good cache. This paper delves into the convergence properties SGD algorithms with arbitrary data ordering.
  arXiv  Detail & Related papers  (2023-05-30T17:47:27Z)
• High-Dimensional Penalized Bernstein Support Vector Machines [0.0]
  Non-differentiability of the SVM hinge loss function can lead to computational difficulties in high dimensional settings. We propose two efficient algorithms for computing the solution of the penalized BernSVM. Our bound holds with high probability and achieves a rate of order $sqrtslog(p)/n$, where $s$ is the number of active features.
  arXiv  Detail & Related papers  (2023-03-16T03:48:29Z)
• Bounding the Width of Neural Networks via Coupled Initialization -- A Worst Case Analysis [121.9821494461427]
  We show how to significantly reduce the number of neurons required for two-layer ReLU networks. We also prove new lower bounds that improve upon prior work, and that under certain assumptions, are best possible.
  arXiv  Detail & Related papers  (2022-06-26T06:51:31Z)
• Learning with Smooth Hinge Losses [15.288802707471792]
  We introduce two smooth Hinge losses $psi_G(alpha;sigma)$ and $psi_M(alpha;sigma)$ which are infinitely differentiable and converge to the Hinge loss uniformly in $alpha$. Experiments in text classification tasks show that the proposed SSVMs are effective in real-world applications.
  arXiv  Detail & Related papers  (2021-02-27T14:50:02Z)
• Optimal Robust Linear Regression in Nearly Linear Time [97.11565882347772]
  We study the problem of high-dimensional robust linear regression where a learner is given access to $n$ samples from the generative model $Y = langle X,w* rangle + epsilon$ We propose estimators for this problem under two settings: (i) $X$ is L4-L2 hypercontractive, $mathbbE [XXtop]$ has bounded condition number and $epsilon$ has bounded variance and (ii) $X$ is sub-Gaussian with identity second moment and $epsilon$ is
  arXiv  Detail & Related papers  (2020-07-16T06:44:44Z)

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.