Syllabus Foundations of Machine Learning CST 312 KTU

Syllabus

Module 1 (LINEAR ALGEBRA )

Systems of Linear Equations – Matrices, Solving Systems of Linear Equations. Vector Spaces - Linear Independence, Basis and Rank, Linear Mappings.

Module 2 (LINEAR ALGEBRA )

Norms - Inner Products, Lengths and Distances, Angles and Orthogonality. Orthonormal Basis, Orthogonal Complement, Orthogonal Projections. Matrix Decompositions -

Eigenvalues and Eigenvectors, Eigen decomposition and Diagonalization.

Module 3 (PROBABILITY AND DISTRIBUTIONS)

Probability Space - Sample Spaces, Probability Measures, Computing Probabilities,Conditional Probability, Baye’s Rule, Independence. Random Variables - Discrete Random

Variables (Bernoulli Random Variables, Binomial Distribution, Geometric and Poisson Distribution, Continuous Random Variables (Exponential Density, Gamma Density, Normal Distribution, Beta Density)

Module 4 (RANDOM VARIABLES)

Functions of a Random Variable. Joint Distributions - Independent Random Variables, Conditional Distributions, Functions of Jointly Distributed Random Variables.

Expected Values - Expected Value of a Random Variable, Expectations of Functions of Random Variables, Expectations of Linear Combinations of Random Variables, Variance and Standard Deviation, Covariance and Correlation, Conditional Expectation

Module 5 (LIMIT THEOREMS)

Moment-Generating Function. Limit Theorems(Proof not expected) - Law of Large Numbers, Convergence in Distribution and the Central Limit Theorem. Distributions derived from the Normal Distribution - Chi-square, t, and F Distributions, Sample Mean and the Sample 
Variance.

Text book:

1. Marc Peter Deisenroth, A. Aldo Faisal, Cheng Soon Ong, Mathematics for Machine Learning, Cambridge University Press (freely available at https://mml – book.github.io)

2. John A. Rice, Mathematical Statistics and Data Analysis, University of California, Berkeley, Third edition, published by Cengage.

Reference books:

1. Gilbert Strang, Linear Algebra and Its Applications, 4th Edition,

2. Axler, Sheldon, Linear Algebra Done Right, 2015 Springer

3. Stephen Boyd and Lieven Vandenberghe, Introduction to Applied Linear Algebra, 2018

published by Cambridge University Press

Comments

Post a Comment

Popular posts from this blog

Foundations of Machine Learning CST 312 KTU CS Elective Notes

  Introduction About Me Syllabus What is Machine Learning ( video) Learn the seven steps in Machine Learning ( video) Overview Of Machine Learning Linear Algebra in Machine Learning Module-1 Linear Algebra 1.Geometry of Linear Equations (video) 2.Elimination with Matrices (video) 3.Solving System of equations using Gauss Elimination Method 4.Row Echelon form and Reduced Row Echelon Form 5.Solving system of equations Python code 6. Practice problems Gauss Elimination ( contact) 7.Finding Inverse using Gauss Jordan Elimination (video) 8.Finding Inverse using Gauss Jordan Elimination-Python code 9.Vector spaces and sub spaces 10.Linear Independence 11.Linear Independence, Basis and Dimension (video) 12.Generating set basis and span 13.Rank of a Matrix 14.Linear Mapping and Matrix Representation of Linear Mapping 15.Basis and Change of basis 16. Transformation Matrix in new Basis 17.Image and Kernel 18.Example Problems ( contact) Module 2: Linear Algebra 1.Vector Norms 2.Inner Product...
Read more

Random Variables- Discrete and Continuous

Image
Discrete Random Variables A random variable is essentially a random number. As motivation for a definition, let us consider an example. A coin is thrown three times, and the sequence of heads and tails is observed; thus, $\Omega= \{hhh, hht, htt, hth, ttt, tth, thh, tht\}$ Examples of random variables defined on $\Omega$ are (1) the total number of heads, (2) the total number of tails, and (3) the number of heads minus the number of tails. Each of these is a real-valued function defined on $\Omega$; that is, each is a rule that assigns a real number to every point $\omega \in \Omega$ . Since the outcome in $\Omega$ is random, the corresponding number is random as well. In general, a random variable is a function from $\Omega$ to the real numbers. Because the outcome of the experiment with sample space $\Omega$ is random, the number produced by the function is random as well. It is conventional to denote random variables by italic uppercase letters from the end of the alphabet...
Read more

Moment Generating Functions

Image
This section develops and applies some of the properties of the moment-generating function. It turns out, despite its unlikely appearance, to be a very useful tool that can dramatically simplify certain calculations. The moment-generating function (mgf) of a random variable $X$ is  $M(t) =E(e^{t X })$  if the expectation is defined. In the discrete case, $M(t) =\sum_x e^{tx} p(x)$ and in the continuous case, $M(t) =\int_{-\infty}^{\infty}e^{tx} f (x) dx$ The expectation, and hence the moment-generating function, may or may not exist for any particular value of $t$. In the continuous case, the existence of the expectation depends on how rapidly the tails of the density decrease; for example, because the tails of the Cauchy density die down at the rate $x^{−2}$, the expectation does not exist for any $t$ and the moment-generating function is undefined. The tails of the normal density die down at the rate $e^{−x^2}$ , so the integral converges for all $t$. The $r $th moment ...
Read more