Skip to main content

Mathematics for Machine Learning- CST 284 - KTU Minor Notes - Dr Binu V P

 Introduction



Linear Algebra in Machine Learning

Module I- Linear Algebra

1.Geometry of Linear Equations(video-Gilbert Strang)
2.Elimination with Matrices(video-Gilbert Strang)
6. Practice problems Gauss Elimination ( contact)


More Example Problems ( contact)

Module-II -Analytic  Geometry and Matrix Decomposition

*Practice Problems ( contact)

Module III -Vector Calculus

4.Practice Problems ( contact)
14.Practice Problems ( contact)

Module IV- Probability and Distributions


Module V- Optimization


Comments

Post a Comment

Popular posts from this blog

1.1 Solving system of equations using Gauss Elimination Method

Elementary Transformations Key to solving a system of linear equations are elementary transformations that keep the solution set the same, but that transform the equation system into a simpler form: Exchange of two equations (rows in the matrix representing the system of equations) Multiplication of an equation (row) with a constant  Addition of two equations (rows) Add a scalar multiple of one row to the other. Row Echelon Form A matrix is in row-echelon form if All rows that contain only zeros are at the bottom of the matrix; correspondingly,all rows that contain at least one nonzero element are on top of rows that contain only zeros. Looking at nonzero rows only, the first nonzero number from the left pivot (also called the pivot or the leading coefficient) is always strictly to the right of the  pivot of the row above it. The row-echelon form is where the leading (first non-zero) entry of each row has only zeroes below it. These leading entries are called...
Post a Comment
Read more

5.1 Optimization using Gradient Descent

Since machine learning algorithms are implemented on a computer, the mathematical formulations are expressed as numerical optimization methods.Training a machine learning model often boils down to finding a good set of parameters. The notion of “good” is determined by the objective function or the probabilistic model. Given an objective function, finding the best value is done using optimization algorithms. There are two main branches of continuous optimization constrained and unconstrained. By convention, most objective functions in machine learning are intended to be minimized, that is, the best value is the minimum value. Intuitively finding the best value is like finding the valleys of the objective function, and the gradients point us uphill. The idea is to move downhill (opposite to the gradient) and hope to find the deepest point. For unconstrained optimization, this is the only concept we need,but there are several design choices. For constrained optimization, we need to intr...
Post a Comment
Read more