# Insensitive Stochastic Gradient Twin Support Vector Machine for Large Scale Problems

arXiv: https://arxiv.org/abs/1704.05596 · HTML: https://mlsanity.com/paper/1704.05596/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 19 Apr 2017.

## Built on by (most cited first, 2 of 2)

- [Comprehensive Review On Twin Support Vector Machines](https://mlsanity.com/paper/2105.00336/) (2021)
- [Generalization-Memorization Machines](https://mlsanity.com/paper/2207.03976/) (2022)

## Abstract (arXiv)

Stochastic gradient descent algorithm has been successfully applied on support vector machines (called PEGASOS) for many classification problems. In this paper, stochastic gradient descent algorithm is investigated to twin support vector machines for classification. Compared with PEGASOS, the proposed stochastic gradient twin support vector machines (SGTSVM) is insensitive on stochastic sampling for stochastic gradient descent algorithm. In theory, we prove the convergence of SGTSVM instead of almost sure convergence of PEGASOS. For uniformly sampling, the approximation between SGTSVM and twin support vector machines is also given, while PEGASOS only has an opportunity to obtain an approximation of support vector machines. In addition, the nonlinear SGTSVM is derived directly from its linear case. Experimental results on both artificial datasets and large scale problems show the stable performance of SGTSVM with a fast learning speed.