Aug 2026· Journal of Physics, Conference Series· Vol 3290, pp. 012190· 0 citations· 18 references
Physics
TL;DR
The novel family of Bézier smooth semi-supervised support vector machine for ε-insensitive regression (ε-BS4VR) improves the comprehensive regression performance than other current semi-supervised models.
Abstract
Due to the excellent regression performance for semi-supervised learning, semi-supervised support vector machine (S3VR) is introduced for dealing with quantities of unlabeled data in the real world. However, the optimal objective function is not differentiable, which is required to suffer tedious calculation burden and decrease the regression performance. To address this problem, the smooth Bézier function has been investigated, and builds the novel method based on ε-insensitive loss function. This article presents one novel family of Bézier smooth semi-supervised support vector machine for ε-insensitive regression (ε-BS4VR). Firstly, the development of the novel series of ε-BS4VR regression is presented. Then, one fast algorithm for solving ε-BS4VR, the non-linear model, convergence and complexity analysis are submitted. To show how the ε-BS4VR is practically implemented, experiments are conducted on several benchmark and real-world datasets. The quantitative statistical analysis and experiments comparisons validate the feasibility and the effectiveness of the proposed method. In short, ε-BS4VR enhances the robustness of S3VR, and improves the comprehensive regression performance than other current semi-supervised models.
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 and develops a fast and stable proximal gradient descent based solving algorithm.
The formulation can reduce prediction costs by more than three orders of magnitude in some cases with a moderate sacrifice in classification accuracy as compared to RBF-SVMs and leads to better classi-fication accuracies over leading methods.
We introduce a robust classification model designed for feature selection. Support vector machine (SVM) models continue to play a crucial role in binary classification, particularly with tabular data. Their robust variants are essential for developing classifiers that remain stable despite shifts in data distribution...
Miguel Carrasco, B. Ivorra, Julio López et al.· Journal of Convex Analysis· 0 citations
This paper replaces the cardinality constraint with a difference-of-convex (DC) penalty and establishes a global error bound to prove that the penalized and constrained formulations share the same global minimizers whenever the penalty parameter exceeds a finite threshold.
Meng Xu, Bo Jiang, Han-Fu Zhang et al.· 0 citations
Accurate optimization of a supervised spectral objective need not produce an accurate population subspace or a better predictive representation. We investigate these distinctions for Online Kernel Supervised Principal Component Analysis (OKSPCA), which combines a centered cross-moment in finite random-feature coordinat...
Zhen-Lin Yao, Wei Xiong· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.