# ksopyla/svm_mnist_digit_classification

MNIST digit classification with scikit-learn and Support Vector Machine (SVM) algorithm.
Latest commit ae0367c Dec 17, 2018
Type Name Latest commit message Commit time
Failed to load latest commit information.
mldata Mar 23, 2016
.gitignore Mar 23, 2016
Pipfile Dec 11, 2018
mnist_helpers.py Dec 17, 2018
requirements.txt Mar 18, 2017
svm_mnist_classification.py Nov 30, 2018
svm_mnist_embedings.py Mar 23, 2016
svm_mnist_grid_search.py Dec 17, 2018
svm_mnist_random_search.py Dec 17, 2018

# SVM MNIST digit classification in python using scikit-learn

The project presents the well-known problem of MNIST handwritten digit classification. For the purpose of this tutorial, I will use Support Vector Machine (SVM) the algorithm with raw pixel features. The solution is written in python with use of scikit-learn easy to use machine learning library.

The goal of this project is not to achieve the state of the art performance, rather teach you how to train SVM classifier on image data with use of SVM from sklearn. Although the solution isn't optimized for high accuracy, the results are quite good (see table below).

If you want to hit the top performance, this two resources will show you current state of the art solutions:

The table below shows some results in comparison with other models:

Random forest 0.937
Simple one-layer neural network 0.926
Simple 2 layer convolutional network 0.981
SVM RBF 0.9852 C=5, gamma=0.05
Linear SVM + Nystroem kernel approximation
Linear SVM + Fourier kernel approximation

## Solution

In this tutorial, I use two approaches to SVM learning. First, uses classical SVM with RBF kernel. The drawback of this solution is rather long training on big datasets, although the accuracy with good parameters is high. The second, use Linear SVM, which allows for training in O(n) time. In order to achieve high accuracy, we use some trick. We approximate RBF kernel in a high dimensional space by embeddings. The theory behind is quite complicated, however sklearn has ready to use classes for kernel approximation. We will use:

• Nystroem kernel approximation
• Fourier kernel approximation

The code was tested with python 3.6.

## How the project is organized

Project consist of three files:

• mnist_helpers.py - contains some visualization functions: MNIST digits visualization and confusion matrix
• svm_mnist_classification.py - script for SVM with RBF kernel classification
• svm_mnist_embedings.py - script for linear SVM with embedings

### SVM with RBF kernel

The svm_mnist_classification.py script downloads the MNIST database and visualizes some random digits. Next, it standardizes the data (mean=0, std=1) and launch grid search with cross-validation for finding the best parameters.

1. MNIST SVM kernel RBF Param search C=[0.1,0.5,1,5], gamma=[0.01,0.0.05,0.1,0.5].

Grid search was done for params C and gamma, where C=[0.1,0.5,1,5], gamma=[0.01,0.0.05,0.1,0.5]. I have examined only 4x4 different param pairs with 3 fold cross validation so far (4x4x3=48 models), this procedure takes 3687.2min :) (2 days, 13:56:42.531223 exactly) on one core CPU.

Param space was generated with numpy logspace and outer matrix multiplication.

``````C_range = np.outer(np.logspace(-1, 0, 2),np.array([1,5]))
# flatten matrix, change to 1D numpy array
C_range = C_range.flatten()

gamma_range = np.outer(np.logspace(-2, -1, 2),np.array([1,5]))
gamma_range = gamma_range.flatten()

``````

Of course, you can broaden the range of parameters, but this will increase the computation time.

Grid search is very time consuming process, so you can use my best parameters (from the range c=[0.1,5], gamma=[0.01,0.05]):

• C = 5
• gamma = 0.05
• accuracy = 0.9852
``````Confusion matrix:
[[1014    0    2    0    0    2    2    0    1    3]
[   0 1177    2    1    1    0    1    0    2    1]
[   2    2 1037    2    0    0    0    2    5    1]
[   0    0    3 1035    0    5    0    6    6    2]
[   0    0    1    0  957    0    1    2    0    3]
[   1    1    0    4    1  947    4    0    5    1]
[   2    0    1    0    2    0 1076    0    4    0]
[   1    1    8    1    1    0    0 1110    2    4]
[   0    4    2    4    1    6    0    1 1018    1]
[   3    1    0    7    5    2    0    4    9  974]]
Accuracy=0.985238095238
``````
1. MNIST SVM kernel RBF Param search C=[0.1,0.5,1,5, 10, 50], gamma=[0.001, 0.005, 0.01,0.0.05,0.1,0.5].

This much broaden search 6x8 params with 3 fold cross validation gives 6x8x3=144 models, this procedure takes 13024.3min (9 days, 1:33:58.999782 exactly) on one core CPU.

Best parameters:

• C = 5
• gamma = 0.05
• accuracy = 0.9852

### Linear SVM with different embeddings

Linear SVM's (SVM with linear kernels) have this advantages that there are many O(n) training algorithms. They are really fast in comparison with other nonlinear SVM (where most of them are O(n^2)). This technique is really useful if you want to train on big data.

Linear SVM algortihtms examples(papers and software):

Unfortunately, linear SVM isn't powerful enough to classify data with accuracy comparable to RBF SVM.

Learning SVM with RBF kernel could be time-consuming. In order to be more expressive, we try to approximate nonlinear kernel, map vectors into higher dimensional space explicitly and use fast linear SVM in this new space. This works extremely well!

The script svm_mnist_embedings.py presents accuracy summary and training times for full RBF kernel, linear SVC, and linear SVC with two kernel approximation Nystroem and Fourier.

## Further improvements

• Augmenting the training set with artificial samples
• Using Randomized param search