Support Vector Machine (SVM)

Note: This is an alpha version of the documentation.

Introduction

In machine learning, support vector machines are supervised learning models with associated learning algorithms that analyze data used for classification and regression analysis. Given a set of training examples, each marked as belonging to one or the other of two categories, an SVM training algorithm builds a model that assigns new examples to one category or the other.

H2O’s implementation of support vector machine follows the PSVM:Parallelizing Support Vector Machineson Distributed Computers specification and can be used to solve binary classification problems only.

MOJO Support

SVM currently does not support MOJOs.

Defining an SVM Model

  • model_id: (Optional) Specify a custom name for the model to use as a reference. By default, H2O automatically generates a destination key.

  • training_frame: (Required) Specify the dataset used to build the model. NOTE: In Flow, if you click the Build a model button from the Parse cell, the training frame is entered automatically.

  • validation_frame: (Optional) Specify the dataset used to evaluate the accuracy of the model.

  • y: (Required) Specify the column to use as the dependent variable. The data can be numeric or categorical.

  • ignored_columns: (Optional, Python and Flow only) Specify the column or columns to be excluded from the model. In Flow, click the checkbox next to a column name to add it to the list of columns excluded from the model. To add all columns, click the All button. To remove a column from the list of ignored columns, click the X next to the column name. To remove all columns from the list of ignored columns, click the None button. To search for a specific column, type the column name in the Search field above the column list. To only show columns with a specific percentage of missing values, specify the percentage in the Only show columns with more than 0% missing values field. To change the selections for the hidden columns, use the Select Visible or Deselect Visible buttons.

  • ignore_const_cols: Specify whether to ignore constant training columns, since no information can be gained from them. This option is enabled by default.

  • hyper_param: Specify the penalty parameter C of the error term. This value defaults to 1.

  • kernel_type: Specify the type of kernel to use. Note that currently only gaussian is supported.

  • gamma: Specify the coefficient of the kernel. This value defaults to -1.

  • rank_ratio: Specify the desired rank of the Incomplete Cholesky Facorization (ICF) matrix expressed as an ration of number of input rows. This value defaults to -1.

  • positive_weight: Specify the weight of the positive (+1) class of observations. This value defaults to 1.

  • negative_weight: Specify the weight of the negative (-1) class of observations. This value defaults to 1.

  • sv_threshold: Specify the threshold for accepting a candidate observation into the set of support vectors. This value defaults to 0.0001.

  • fact_threshold: Specify the convergence threshold of the Incomplete Cholesky Facorization (ICF). This value defaults to 1e-05.

  • feasible_threshold: Specify the convergence threshold for primal-dual residuals in the Interior Point Method (IPM) iteration. This value defaults to 0.001.

  • surrogate_gap_threshold: Specify the feasibility criterion of the surrogate duality gap (eta). This value defaults to 0.001.

  • mu_factor: Specify to increase the mean value by this factor. This value defaults to 10.

  • max_iterations: Specify the maximum number of iteration of the algorithm. This value defaults to 200.

  • seed: Specify the random number generator (RNG) seed for algorithm components dependent on randomization. The seed is consistent for each H2O instance so that you can create models with the same starting conditions in alternative configurations. This value defaults to -1 (time-based random number).

SVM Algorithm

As mentioned previously, H2O’s implementation of support vector machine follows the PSVM algorithm specified by Edward Y. Chang and others. This implementation can be used to solve binary classification problems. In this configuration, SVM can be formulated as a quadratic optimization problem:

\(\min{\frac{1}{2}\|\mathbf{w}\|^2 + C\sum_{i=1}^n\xi_i}\) s.t. \(1 - y_i(\mathbf{w}^T\phi(\mathbf{x}_i) + b) \leq \xi_i, \xi_i > 0\)

where \(C\) is a regularization hyperparameter, and \(\phi(\cdot)\) is a basis function that maps each observation \(\mathbf{x}_i\) to a Reproducing Kernel Hilbert Space. The solution of the problem is a vector of weights \(w\) and a threshold \(b\) that defines a separating hyperplane with the largest separation, or margin, between the two classes in the RKHS space. As a result, the decision function of a SVM classifier is \(f(\mathbf{x}) = \mathbf{w}^T\phi(\mathbf{x})+b\).

Due to the difficulty of solving this formulation of the problem, the duality principle is used to formulate a dual problem using the method of Lagrangian multipliers:

\(\min{\frac{1}{2}\alpha^T\mathbf{Q}\alpha - \alpha^T\mathbf{1}}\) s.t. \(\mathbf{0} \leq \alpha \leq \mathbf{C}, \mathbf{y}^T\alpha = 0\)

Matrix \(\mathbf{Q}\) is defined as \(\mathbf{Q}_{ij} = y_{i}y_{j}K(\mathbf{x}_i,\mathbf{x}_j)\), where \(K\) is a Kernel function. In our setting, this problem represents a convex Quadratic Programming problem with linear constraints. This problem can be solved by Interior-Point method (IPM): https://en.wikipedia.org/wiki/Interior-point_method.

The main idea of the SVM algorithm is to approximate the (potentially very large) matrix \(\mathbf{Q}\) using row-based Incomplete Cholesky Factorization (\(\mathbf{Q} \approx \mathbf{H}\mathbf{H}^T\)). The row-based nature of the factorization algorithm allows for paralellization that can be implemented in the distributed environment of the H2O platform. The quality of the approximation is measured by \(trace(\mathbf{Q} - \mathbf{H}\mathbf{H}^T)\), and the algorithm stops when the value of the trace is within a user provided threshold, or when the configured maximum rank of the ICF matrix is reached.

An approximation of the \(\mathbf{Q}\) matrix is used in the IPM algorithm in order to speed up the bottleneck of the Newton step and leverage the parallel execution environment.

Examples

Below is a simple example showing how to build a Support Vector Machine model.

R

Python

library(h2o)
h2o.init()

# Import the splice dataset into H2O:
splice <- h2o.importFile("https://s3.amazonaws.com/h2o-public-test-data/smalldata/splice/splice.svm")

# Build and train the model:
svm_model <- h2o.psvm(gamma = 0.01,
                      rank_ratio = 0.1,
                      y = "C1",
                      training_frame = splice,
                      disable_training_metrics = FALSE)

# Eval performance:
perf <- h2o.performance(svm_model)

import h2o
from h2o.estimators import H2OSupportVectorMachineEstimator
h2o.init()

# Import the splice dataset into H2O:
splice = h2o.import_file("http://h2o-public-test-data.s3.amazonaws.com/smalldata/splice/splice.svm")

# Build and train the model:
svm_model = H2OSupportVectorMachineEstimator(gamma=0.01,
                                             rank_ratio = 0.1,
                                             disable_training_metrics = False)
svm_model.train(y = "C1", training_frame = splice)

# Eval performance:
perf = svm_model.model_performance()

# Generate predictions (if necessary):
pred = svm_model.predict(splice)

References

E.Y. Chang, K. Zhu, H. Wang, H. Bai, J. Li, Z. Qiu, H. Cui, Parallelizing support vector machines on distributed computers, in Proceedings of NIPS, 2007 Google Scholar