In the last series of posts, we have been trying to explore how to solve the sequential minimal optimization algorithm. In the beginning of this algorithm, we have a vector of lagrange multipliers and our objective is to consistently pick 2 of these lagrange multipliers from the vector and change…

In the previous post, I spoke about the two main steps involved in the implementation of the sequential minimal optimization algorithm, which include first selecting the Lagrange multipliers to optimize and then optimizing the chosen Lagrange multipliers through the implementation of an analytical method. In this post, I would be…

In the previous post, I gave a general overview on what the Sequential Minimal Optimization algorithm was and how it works. In the next subsequent posts, we would be breaking down the concepts regarding the SMO algorithm into manageable chunks that you can easily assimilate, understand and enjoy. …

In the previous posts, we were introduced to the SVM optimization problem, which is demonstrated in Fig. 1 below:

This optimization problem can be solved by using a convex optimization package such as CVXOPT. However, solving this problem with such a package becomes problematic when we are dealing with large…

In the previous post, we had a look at the kernel trick and how it can be applied mathematically to enable us to find an optimum hyperplane that can separate non-linearly separable data points. In this post, we shall be exploring certain types of popular kernels.

**Learning objective:**

Understand some…

In this tutorial, we would be learning about how to directly apply the kernel to help us to find the optimum hyperplane between data points belonging to different classes which are not linearly separable in nature. …

In the last post, I discussed the problem that is involved with transforming every point from one dimension to another dimension just to be able to find the right hyperplane that can separate the points into their respective classes. This is a computationally expensive task to do, especially if there…

In the last couple of lecture posts, we have been talking about how to determine hyperplanes that can optimally separate given datasets. In this the next couple of posts, we will look at the concept of kernels, what they are and how they are so useful in machine learning.

**Learning…**

In the last post, we looked at the idea of “complementary slackness” and how it showcases the relationship between the variables of the primal problem and the constraints of the dual problem and vice versa. …

In this lecture, we will be learning about an open source deep learning framework called PyTorch. PyTorch can be viewed as a library that provides us with packages that we can use to manipulate **tensors.**

A *tensor *is basically a mathematical object that is used to hold multidimensional data. Tensors…