Support Vector Regression
Support Vector Regression (SVR) · Also known as: Destek Vektör Regresyonu (SVR), SVR, epsilon-SVR, support vector machine for regression
Support Vector Regression (SVR), described in Smola and Schölkopf's 2004 tutorial, predicts a continuous outcome by fitting a function that stays within an epsilon-wide tube around the data while incurring as little error as possible. It extends the support vector machine idea from classification to regression, using a kernel to capture nonlinear relationships.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use SVR for predicting a continuous (or count) outcome from features when the relationship may be nonlinear and you have at least about 50 observations. Features must be normalised, and the kernel and the C parameter need tuning. With fewer than 50 cases the prediction rests on too few support vectors and becomes unstable, so a ridge or linear regression is preferable.
Strengths & limitations
- The epsilon-insensitive loss makes the fit robust to small deviations and to outliers within the tube.
- Kernels let SVR model nonlinear relationships without explicitly engineering new features.
- Does not require normally distributed data.
- The final model depends only on the support vectors, keeping the prediction compact.
- Needs at least about 50 observations; with fewer, predictions rest on too few support vectors and are unstable.
- Performance hinges on tuning the kernel and the C parameter, which requires enough cross-validation data.
- Features must be normalised beforehand or the kernel distances are distorted.
- Offers no interpretable coefficients.
Frequently asked
What does the epsilon parameter control?
Epsilon sets the half-width of the tolerance tube around the fitted function. Deviations smaller than epsilon are treated as zero error, so a larger epsilon yields a flatter, simpler model with fewer support vectors, while a smaller epsilon fits the data more tightly.
Why must I normalise the features?
SVR relies on distances computed through the kernel. If features are on very different scales those with larger ranges dominate the distances, so the features should be standardised before fitting.
How small a sample is too small?
With fewer than about 50 observations the fit depends on too few support vectors and becomes unstable, and there is not enough data to tune the kernel hyperparameters; a ridge or linear regression is a safer choice.
How does SVR differ from ordinary least squares?
Least squares penalises every residual quadratically, whereas SVR ignores residuals inside the epsilon-tube and penalises only those outside it. Combined with a kernel, this lets SVR capture nonlinear relationships and stay robust to small deviations.
Sources
- Smola, A.J. & Schölkopf, B. (2004). A Tutorial on Support Vector Regression. Statistics and Computing, 14, 199–222. DOI: 10.1023/B:STCO.0000035301.49549.88 ↗
How to cite this page
ScholarGate. (2026, June 1). Support Vector Regression (SVR). ScholarGate. https://scholargate.app/en/machine-learning/svm-regression
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- K-Nearest NeighborsMachine learning↔ compare
- Lasso RegressionMachine learning↔ compare
- Ridge RegressionMachine learning↔ compare
- Support Vector MachineMachine learning↔ compare