Metraipolis › archive › dc_96eb43374ce9
Sparse and robust geometric twin support vector machine via asymmetric RoBoSS loss function — arXiv:2608.11567
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.11567
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T05:39:50.763Z
- SHA-256 of the archived text
01c753e152826ad2c8b78566bca47642a2a60c9cc9e5330b8c500afd4c052b9f- Stable URL of this page
https://metraipolis.com/documento/dc_96eb43374ce9
How to cite
Sparse and robust geometric twin support vector machine via asymmetric RoBoSS loss function — arXiv:2608.11567 — arXiv (en), https://arxiv.org/abs/2608.11567 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_96eb43374ce9 (Metraipolis archive dc_96eb43374ce9, sha256 01c753e152826ad2c8b78566bca47642a2a60c9cc9e5330b8c500afd4c052b9f)
BibTeX
@misc{dc96eb43374ce9,
title = {Sparse and robust geometric twin support vector machine via asymmetric RoBoSS loss function — arXiv:2608.11567},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.11567},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_96eb43374ce9; sha256 01c753e152826ad2c8b78566bca47642a2a60c9cc9e5330b8c500afd4c052b9f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11567. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-13 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2608.11567 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T05:18:32.475Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).