<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Maths on Arshad Siddiqui</title><link>https://arshadhs.github.io/tags/maths/</link><description>Recent content in Maths on Arshad Siddiqui</description><generator>Hugo</generator><language>en-us</language><atom:link href="https://arshadhs.github.io/tags/maths/index.xml" rel="self" type="application/rss+xml"/><item><title>MFML Lecture to Course Content Map</title><link>https://arshadhs.github.io/docs/ai/maths/mfml-lecture-course-map/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://arshadhs.github.io/docs/ai/maths/mfml-lecture-course-map/</guid><description>&lt;h1 id="mfml-lecture-to-course-content-map">
 MFML Lecture to Course Content Map
 
 &lt;a class="anchor" href="#mfml-lecture-to-course-content-map">#&lt;/a>
 
&lt;/h1>
&lt;p>This file maps the uploaded Maths lecture PDFs and webinar PDFs against the official course handout/contact-session plan.
It is intended as an exam preparation index and as a source map for future Hugo Markdown notes.&lt;/p>
&lt;h2 id="course-identity">
 Course identity
 
 &lt;a class="anchor" href="#course-identity">#&lt;/a>
 
&lt;/h2>
&lt;ul>
&lt;li>Course: &lt;strong>Mathematical Foundations for Machine Learning&lt;/strong>&lt;/li>
&lt;li>Course code: &lt;strong>AIML ZC416&lt;/strong>&lt;/li>
&lt;li>Main areas: linear algebra, vector spaces, matrix decompositions, vector calculus, optimisation, PCA, and SVM.&lt;/li>
&lt;/ul>
&lt;h2 id="official-module-structure">
 Official module structure
 
 &lt;a class="anchor" href="#official-module-structure">#&lt;/a>
 
&lt;/h2>
&lt;table>
 &lt;thead>
 &lt;tr>
 &lt;th>Module&lt;/th>
 &lt;th>Course handout area&lt;/th>
 &lt;th>Main ideas&lt;/th>
 &lt;th>Uploaded lecture coverage&lt;/th>
 &lt;/tr>
 &lt;/thead>
 &lt;tbody>
 &lt;tr>
 &lt;td>M1&lt;/td>
 &lt;td>Solution of linear systems&lt;/td>
 &lt;td>Systems of equations, matrices, solving Ax = b&lt;/td>
 &lt;td>Lecture 1, Webinar 1&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>M2&lt;/td>
 &lt;td>Vector spaces and analytic geometry&lt;/td>
 &lt;td>Vector spaces, linear independence, basis, rank, norms, inner products, angles, orthogonality, orthonormal basis&lt;/td>
 &lt;td>Lecture 2, Lecture 3, Webinar 1&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>M3&lt;/td>
 &lt;td>Matrix decomposition methods&lt;/td>
 &lt;td>Determinant, trace, eigenvalues, eigenvectors, Cholesky, eigendecomposition, diagonalisation, SVD, matrix approximation&lt;/td>
 &lt;td>Lecture 4, Lecture 5, Webinar 1, Webinar 2&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>M4&lt;/td>
 &lt;td>Vector calculus&lt;/td>
 &lt;td>Univariate differentiation, partial derivatives, gradients, matrix gradients, Taylor/Maclaurin series, Hessian, backpropagation, automatic differentiation&lt;/td>
 &lt;td>Lecture 6, Lecture 7, Lecture 8, Webinar 2&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>M5&lt;/td>
 &lt;td>Continuous optimisation&lt;/td>
 &lt;td>Gradient descent, constrained optimisation, Lagrange multipliers, convex optimisation&lt;/td>
 &lt;td>Lecture 9, Lecture 14, Webinar 2, Webinar 3, Webinar 4&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>M6&lt;/td>
 &lt;td>Nonlinear optimisation&lt;/td>
 &lt;td>Learning rate, initialisation, SGD, feature preprocessing, local optima, cliffs/valleys, momentum, AdaGrad, RMSProp, Adam&lt;/td>
 &lt;td>Lecture 10, Lecture 11, Webinar 3&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>M7&lt;/td>
 &lt;td>Dimensionality reduction, PCA, SVM&lt;/td>
 &lt;td>PCA perspectives, low-rank approximation, high-dimensional PCA, practical PCA, SVM preliminaries, primal/dual SVM, kernels&lt;/td>
 &lt;td>Lecture 12, Lecture 13, Lecture 14, Lecture 15, Webinar 4&lt;/td>
 &lt;/tr>
 &lt;/tbody>
&lt;/table>
&lt;h2 id="contact-session-by-lecture">
 Contact session by lecture
 
 &lt;a class="anchor" href="#contact-session-by-lecture">#&lt;/a>
 
&lt;/h2>
&lt;table>
 &lt;thead>
 &lt;tr>
 &lt;th style="text-align: right">Session&lt;/th>
 &lt;th>Course handout topic&lt;/th>
 &lt;th>Uploaded file&lt;/th>
 &lt;th>What the lecture appears to cover&lt;/th>
 &lt;th>Exam relevance&lt;/th>
 &lt;/tr>
 &lt;/thead>
 &lt;tbody>
 &lt;tr>
 &lt;td style="text-align: right">1&lt;/td>
 &lt;td>Solution of linear systems&lt;/td>
 &lt;td>&lt;code>Lecture_1.pdf&lt;/code>&lt;/td>
 &lt;td>Linear algebra introduction, closure, systems of linear equations, matrix representation, solution types: no solution, unique solution, infinite solutions, pivot/free variables, matrix operations, inverse, transpose, compact Ax=b form&lt;/td>
 &lt;td>Very high for Mid-Sem and Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">2&lt;/td>
 &lt;td>Vector spaces, linear independence, basis, rank&lt;/td>
 &lt;td>&lt;code>Lecture_2.pdf&lt;/code>&lt;/td>
 &lt;td>Groups, Abelian groups, vector spaces, vector subspaces, closure tests, linear combinations, span, linear independence, basis, rank, nullspace/column space ideas&lt;/td>
 &lt;td>Very high for Mid-Sem and Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">3&lt;/td>
 &lt;td>Analytic geometry&lt;/td>
 &lt;td>&lt;code>Lecture_3.pdf&lt;/code>&lt;/td>
 &lt;td>Norms, dot product, inner products, bilinear mappings, symmetric positive-definite matrices, lengths, distances, angles, orthogonality, orthonormal basis, Gram-Schmidt ideas&lt;/td>
 &lt;td>Very high for Mid-Sem and Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">4&lt;/td>
 &lt;td>Matrix Decomposition I&lt;/td>
 &lt;td>&lt;code>lecture_4.pdf&lt;/code>&lt;/td>
 &lt;td>Determinant, cofactor formula, determinant behaviour under row operations, rank-det relation, eigenvalues/eigenvectors, Cholesky-related positive definite ideas&lt;/td>
 &lt;td>Very high for Mid-Sem and Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">5&lt;/td>
 &lt;td>Matrix Decomposition II&lt;/td>
 &lt;td>&lt;code>lecture_5.pdf&lt;/code>&lt;/td>
 &lt;td>Diagonal matrices, diagonalisation, eigendecomposition, spectral theorem for symmetric matrices, SVD, matrix approximation&lt;/td>
 &lt;td>Very high for Mid-Sem and Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">6&lt;/td>
 &lt;td>Vector Calculus I&lt;/td>
 &lt;td>&lt;code>lecture_6.pdf&lt;/code>&lt;/td>
 &lt;td>Differentiation of univariate functions, polynomial derivatives, Taylor polynomial/series, partial derivatives, gradients, vector-valued gradients&lt;/td>
 &lt;td>Very high for Mid-Sem and Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">7&lt;/td>
 &lt;td>Vector Calculus II&lt;/td>
 &lt;td>&lt;code>lecture_7_edited.pdf&lt;/code>&lt;/td>
 &lt;td>Matrix gradients, useful gradient identities, backpropagation, automatic differentiation, chain rule through neural-network layers&lt;/td>
 &lt;td>High for Mid-Sem and Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">8&lt;/td>
 &lt;td>Vector Calculus III&lt;/td>
 &lt;td>&lt;code>lecture_8.pdf&lt;/code>&lt;/td>
 &lt;td>Taylor/Maclaurin series theory, remainder term, two-variable Taylor series, Hessian matrix, maxima/minima, unconstrained optimisation preliminaries&lt;/td>
 &lt;td>Very high for Mid-Sem and Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">9&lt;/td>
 &lt;td>Continuous Optimisation&lt;/td>
 &lt;td>&lt;code>Lecture_9.pdf&lt;/code>&lt;/td>
 &lt;td>Gradient descent, negative gradient direction, local minima, step size, line search, convergence intuition, quadratic examples&lt;/td>
 &lt;td>Very high for Comprehensive; likely useful for quizzes/problems&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">10&lt;/td>
 &lt;td>Nonlinear Optimisation I&lt;/td>
 &lt;td>&lt;code>Lecture_10.pdf&lt;/code>&lt;/td>
 &lt;td>Initialisation, objective functions in ML, overfitting, feature processing/preprocessing, SGD and practical optimisation behaviour&lt;/td>
 &lt;td>High for Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">11&lt;/td>
 &lt;td>Nonlinear Optimisation II&lt;/td>
 &lt;td>&lt;code>Lecture_11.pdf&lt;/code>&lt;/td>
 &lt;td>Difficult topologies: cliffs, valleys, flat regions, curvature; momentum, AdaGrad, RMSProp, Adam&lt;/td>
 &lt;td>High for Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">12&lt;/td>
 &lt;td>PCA I&lt;/td>
 &lt;td>&lt;code>Lecture_12.pdf&lt;/code>&lt;/td>
 &lt;td>Dimensionality reduction, PCA problem setting, centred data, covariance, maximum variance perspective, projection perspective&lt;/td>
 &lt;td>Very high for Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">13&lt;/td>
 &lt;td>PCA II&lt;/td>
 &lt;td>&lt;code>Lecture_13.pdf&lt;/code>&lt;/td>
 &lt;td>Practical PCA, eigenvector computation, SVD relationship, low-rank approximation, high-dimensional PCA, key PCA steps&lt;/td>
 &lt;td>Very high for Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">14&lt;/td>
 &lt;td>Mathematical preliminaries for SVM&lt;/td>
 &lt;td>&lt;code>Lecture 14.pdf&lt;/code>&lt;/td>
 &lt;td>Constrained optimisation, Lagrangian, quadratic programming, primal/dual, weak/strong duality, Slater condition, KKT conditions, kernels, linear classifiers&lt;/td>
 &lt;td>Very high for Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">15&lt;/td>
 &lt;td>Primal/dual linear SVM&lt;/td>
 &lt;td>&lt;code>Lecture_15.pdf&lt;/code>&lt;/td>
 &lt;td>SVM primal problem, dual formulation, KKT conditions, support vectors, hinge loss, linear SVM numerical problem, hard/soft-margin direction&lt;/td>
 &lt;td>Very high for Comprehensive&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td style="text-align: right">16&lt;/td>
 &lt;td>Nonlinear SVM / kernels&lt;/td>
 &lt;td>Not clearly uploaded as a separate Lecture 16 PDF&lt;/td>
 &lt;td>Kernel functions, nonlinear SVM examples; likely partly covered in Lecture 14/15 and webinars&lt;/td>
 &lt;td>Very high for Comprehensive; gap to fill if Lecture 16 exists&lt;/td>
 &lt;/tr>
 &lt;/tbody>
&lt;/table>
&lt;h2 id="webinar-mapping">
 Webinar mapping
 
 &lt;a class="anchor" href="#webinar-mapping">#&lt;/a>
 
&lt;/h2>
&lt;table>
 &lt;thead>
 &lt;tr>
 &lt;th>Webinar file&lt;/th>
 &lt;th>Main role&lt;/th>
 &lt;th>Best linked lectures&lt;/th>
 &lt;th>Exam use&lt;/th>
 &lt;/tr>
 &lt;/thead>
 &lt;tbody>
 &lt;tr>
 &lt;td>&lt;code>Webinar_1.pdf&lt;/code>&lt;/td>
 &lt;td>Problem sheet on linear systems, REF/RREF, column space, nullspace, row independence, subspaces, inner products, Cauchy-Schwarz, Cholesky, eigenvalues&lt;/td>
 &lt;td>Lectures 1-5&lt;/td>
 &lt;td>Excellent for Mid-Sem problem practice&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>&lt;code>Webinar_2.pdf&lt;/code>&lt;/td>
 &lt;td>Worked problems on maxima/minima, eigenvalues/spectral decomposition, gradient-related calculations and PCA-style examples&lt;/td>
 &lt;td>Lectures 4-9, 12-13&lt;/td>
 &lt;td>Excellent for Mid-Sem revision and Comprehensive practice&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>&lt;code>Webinar_3.pdf&lt;/code>&lt;/td>
 &lt;td>Gradient descent algorithm, step-size derivation for quadratic functions, worked gradient descent examples&lt;/td>
 &lt;td>Lectures 8-11&lt;/td>
 &lt;td>Excellent for optimisation exam problems&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>&lt;code>webinar_4.pdf&lt;/code>&lt;/td>
 &lt;td>Appears linked to optimisation/SVM/PCA practice based on uploaded set; use as problem-solving supplement after Lecture 12 onwards&lt;/td>
 &lt;td>Lectures 12-15&lt;/td>
 &lt;td>Comprehensive exam practice&lt;/td>
 &lt;/tr>
 &lt;/tbody>
&lt;/table>
&lt;h2 id="mid-sem-focus">
 Mid-Sem focus
 
 &lt;a class="anchor" href="#mid-sem-focus">#&lt;/a>
 
&lt;/h2>
&lt;p>The course handout states that the &lt;strong>Mid-Semester Test&lt;/strong> covers &lt;strong>Weeks 1-8&lt;/strong>.
So for Mid-Sem, focus on:&lt;/p></description></item><item><title>MFML Exam Revision Index</title><link>https://arshadhs.github.io/docs/ai/maths/mfml-exam-revision-index/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://arshadhs.github.io/docs/ai/maths/mfml-exam-revision-index/</guid><description>&lt;h1 id="mfml-exam-revision-index">
 MFML Exam Revision Index
 
 &lt;a class="anchor" href="#mfml-exam-revision-index">#&lt;/a>
 
&lt;/h1>
&lt;p>This is a practical revision index for the uploaded Mathematical Foundations for Machine Learning material.&lt;/p>
&lt;h2 id="exam-split">
 Exam split
 
 &lt;a class="anchor" href="#exam-split">#&lt;/a>
 
&lt;/h2>
&lt;table>
 &lt;thead>
 &lt;tr>
 &lt;th>Exam&lt;/th>
 &lt;th>Coverage&lt;/th>
 &lt;th>Main files&lt;/th>
 &lt;/tr>
 &lt;/thead>
 &lt;tbody>
 &lt;tr>
 &lt;td>Mid-Semester&lt;/td>
 &lt;td>Weeks/Sessions 1-8&lt;/td>
 &lt;td>Lecture 1 to Lecture 8, Webinar 1, Webinar 2&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Comprehensive&lt;/td>
 &lt;td>Sessions 1-16&lt;/td>
 &lt;td>Lecture 1 to Lecture 15, webinars, and any missing Lecture 16/kernel material&lt;/td>
 &lt;/tr>
 &lt;/tbody>
&lt;/table>
&lt;h2 id="high-priority-concept-checklist">
 High-priority concept checklist
 
 &lt;a class="anchor" href="#high-priority-concept-checklist">#&lt;/a>
 
&lt;/h2>
&lt;h3 id="linear-systems-and-matrices">
 Linear systems and matrices
 
 &lt;a class="anchor" href="#linear-systems-and-matrices">#&lt;/a>
 
&lt;/h3>
&lt;ul>
&lt;li>Convert equations into matrix form &lt;code>Ax = b&lt;/code>&lt;/li>
&lt;li>Understand solution types: no solution, unique solution, infinite solutions&lt;/li>
&lt;li>Identify pivot and free variables&lt;/li>
&lt;li>Understand row operations, REF/RREF, rank, nullity&lt;/li>
&lt;li>Know matrix inverse and transpose properties&lt;/li>
&lt;/ul>
&lt;h3 id="vector-spaces">
 Vector spaces
 
 &lt;a class="anchor" href="#vector-spaces">#&lt;/a>
 
&lt;/h3>
&lt;ul>
&lt;li>Definition of vector space and subspace&lt;/li>
&lt;li>Closure under addition and scalar multiplication&lt;/li>
&lt;li>Span, linear combination, linear independence&lt;/li>
&lt;li>Basis, dimension, rank&lt;/li>
&lt;li>Column space, row space, nullspace&lt;/li>
&lt;/ul>
&lt;h3 id="analytic-geometry">
 Analytic geometry
 
 &lt;a class="anchor" href="#analytic-geometry">#&lt;/a>
 
&lt;/h3>
&lt;ul>
&lt;li>Norm properties&lt;/li>
&lt;li>Manhattan norm and Euclidean norm&lt;/li>
&lt;li>Inner product definition&lt;/li>
&lt;li>Symmetric positive-definite matrices&lt;/li>
&lt;li>Distance, angle, orthogonality&lt;/li>
&lt;li>Orthonormal basis and Gram-Schmidt&lt;/li>
&lt;/ul>
&lt;h3 id="matrix-decompositions">
 Matrix decompositions
 
 &lt;a class="anchor" href="#matrix-decompositions">#&lt;/a>
 
&lt;/h3>
&lt;ul>
&lt;li>Determinant and trace&lt;/li>
&lt;li>Cofactor expansion&lt;/li>
&lt;li>Row operation effect on determinant&lt;/li>
&lt;li>Eigenvalue equation &lt;code>Av = λv&lt;/code>&lt;/li>
&lt;li>Characteristic equation &lt;code>det(A - λI) = 0&lt;/code>&lt;/li>
&lt;li>Diagonalisation &lt;code>A = PDP^{-1}&lt;/code>&lt;/li>
&lt;li>Spectral theorem for symmetric matrices&lt;/li>
&lt;li>Cholesky decomposition&lt;/li>
&lt;li>SVD &lt;code>A = UΣV^T&lt;/code>&lt;/li>
&lt;li>Low-rank approximation&lt;/li>
&lt;/ul>
&lt;h3 id="vector-calculus">
 Vector calculus
 
 &lt;a class="anchor" href="#vector-calculus">#&lt;/a>
 
&lt;/h3>
&lt;ul>
&lt;li>Derivative from first principles&lt;/li>
&lt;li>Partial derivatives&lt;/li>
&lt;li>Gradient as direction of steepest ascent&lt;/li>
&lt;li>Gradient of vector-valued functions&lt;/li>
&lt;li>Matrix-gradient identities&lt;/li>
&lt;li>Chain rule&lt;/li>
&lt;li>Backpropagation and automatic differentiation&lt;/li>
&lt;/ul>
&lt;h3 id="taylor-series-and-hessian">
 Taylor series and Hessian
 
 &lt;a class="anchor" href="#taylor-series-and-hessian">#&lt;/a>
 
&lt;/h3>
&lt;ul>
&lt;li>Taylor polynomial&lt;/li>
&lt;li>Taylor series and Maclaurin series&lt;/li>
&lt;li>Remainder term&lt;/li>
&lt;li>Taylor series in two variables&lt;/li>
&lt;li>Hessian matrix&lt;/li>
&lt;li>First derivative and second derivative tests&lt;/li>
&lt;li>Maxima, minima and saddle points&lt;/li>
&lt;/ul>
&lt;h3 id="gradient-descent-and-optimisation">
 Gradient descent and optimisation
 
 &lt;a class="anchor" href="#gradient-descent-and-optimisation">#&lt;/a>
 
&lt;/h3>
&lt;ul>
&lt;li>Negative gradient direction&lt;/li>
&lt;li>Learning rate/step size&lt;/li>
&lt;li>Line search&lt;/li>
&lt;li>Convergence and local minima&lt;/li>
&lt;li>Constrained vs unconstrained optimisation&lt;/li>
&lt;li>Lagrange multipliers&lt;/li>
&lt;li>Convex optimisation&lt;/li>
&lt;li>SGD and optimisation in ML&lt;/li>
&lt;li>Feature preprocessing and scaling&lt;/li>
&lt;li>Overfitting in optimisation examples&lt;/li>
&lt;/ul>
&lt;h3 id="nonlinear-optimisation-algorithms">
 Nonlinear optimisation algorithms
 
 &lt;a class="anchor" href="#nonlinear-optimisation-algorithms">#&lt;/a>
 
&lt;/h3>
&lt;ul>
&lt;li>Difficult surfaces: cliffs, valleys, flat regions&lt;/li>
&lt;li>Curvature and why first-order methods can struggle&lt;/li>
&lt;li>Momentum update and intuition&lt;/li>
&lt;li>AdaGrad&lt;/li>
&lt;li>RMSProp&lt;/li>
&lt;li>Adam&lt;/li>
&lt;li>Learning rate decay&lt;/li>
&lt;/ul>
&lt;h3 id="pca">
 PCA
 
 &lt;a class="anchor" href="#pca">#&lt;/a>
 
&lt;/h3>
&lt;ul>
&lt;li>Dimensionality reduction problem&lt;/li>
&lt;li>Centred data and covariance matrix&lt;/li>
&lt;li>Maximum variance view&lt;/li>
&lt;li>Projection/reconstruction view&lt;/li>
&lt;li>Principal components as eigenvectors of covariance matrix&lt;/li>
&lt;li>SVD relation to PCA&lt;/li>
&lt;li>Low-rank approximation and Eckart-Young theorem&lt;/li>
&lt;li>PCA in high dimensions&lt;/li>
&lt;li>Practical PCA steps&lt;/li>
&lt;/ul>
&lt;h3 id="svm">
 SVM
 
 &lt;a class="anchor" href="#svm">#&lt;/a>
 
&lt;/h3>
&lt;ul>
&lt;li>Linear classifiers&lt;/li>
&lt;li>Margin and support vectors&lt;/li>
&lt;li>Hard-margin SVM primal formulation&lt;/li>
&lt;li>Lagrangian for SVM&lt;/li>
&lt;li>KKT conditions&lt;/li>
&lt;li>Primal vs dual perspective&lt;/li>
&lt;li>Role of inner products&lt;/li>
&lt;li>Kernel trick&lt;/li>
&lt;li>Hinge loss&lt;/li>
&lt;li>Soft-margin SVM&lt;/li>
&lt;/ul>
&lt;h2 id="suggested-revision-order">
 Suggested revision order
 
 &lt;a class="anchor" href="#suggested-revision-order">#&lt;/a>
 
&lt;/h2>
&lt;h3 id="phase-1-foundations">
 Phase 1: Foundations
 
 &lt;a class="anchor" href="#phase-1-foundations">#&lt;/a>
 
&lt;/h3>
&lt;ol>
&lt;li>Lecture 1&lt;/li>
&lt;li>Lecture 2&lt;/li>
&lt;li>Lecture 3&lt;/li>
&lt;li>Webinar 1 problems related to REF, nullspace, column space and subspaces&lt;/li>
&lt;/ol>
&lt;h3 id="phase-2-matrix-decompositions">
 Phase 2: Matrix decompositions
 
 &lt;a class="anchor" href="#phase-2-matrix-decompositions">#&lt;/a>
 
&lt;/h3>
&lt;ol>
&lt;li>Lecture 4&lt;/li>
&lt;li>Lecture 5&lt;/li>
&lt;li>Webinar 1 and Webinar 2 eigenvalue/eigendecomposition problems&lt;/li>
&lt;/ol>
&lt;h3 id="phase-3-calculus-and-optimisation-foundations">
 Phase 3: Calculus and optimisation foundations
 
 &lt;a class="anchor" href="#phase-3-calculus-and-optimisation-foundations">#&lt;/a>
 
&lt;/h3>
&lt;ol>
&lt;li>Lecture 6&lt;/li>
&lt;li>Lecture 7&lt;/li>
&lt;li>Lecture 8&lt;/li>
&lt;li>Webinar 2 maxima/minima and Hessian problems&lt;/li>
&lt;/ol>
&lt;h3 id="phase-4-optimisation-for-ml">
 Phase 4: Optimisation for ML
 
 &lt;a class="anchor" href="#phase-4-optimisation-for-ml">#&lt;/a>
 
&lt;/h3>
&lt;ol>
&lt;li>Lecture 9&lt;/li>
&lt;li>Lecture 10&lt;/li>
&lt;li>Lecture 11&lt;/li>
&lt;li>Webinar 3 gradient-descent step-size problems&lt;/li>
&lt;/ol>
&lt;h3 id="phase-5-pca-and-svm">
 Phase 5: PCA and SVM
 
 &lt;a class="anchor" href="#phase-5-pca-and-svm">#&lt;/a>
 
&lt;/h3>
&lt;ol>
&lt;li>Lecture 12&lt;/li>
&lt;li>Lecture 13&lt;/li>
&lt;li>Lecture 14&lt;/li>
&lt;li>Lecture 15&lt;/li>
&lt;li>Webinar 4 / SVM problems&lt;/li>
&lt;/ol>
&lt;h2 id="what-to-ask-me-next">
 What to ask me next
 
 &lt;a class="anchor" href="#what-to-ask-me-next">#&lt;/a>
 
&lt;/h2>
&lt;p>Use these prompts when generating Hugo pages:&lt;/p></description></item><item><title>MFML Topic to Source Index</title><link>https://arshadhs.github.io/docs/ai/maths/mfml-topic-to-source-index/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://arshadhs.github.io/docs/ai/maths/mfml-topic-to-source-index/</guid><description>&lt;h1 id="mfml-topic-to-source-index">
 MFML Topic to Source Index
 
 &lt;a class="anchor" href="#mfml-topic-to-source-index">#&lt;/a>
 
&lt;/h1>
&lt;p>This index tells you where to look when you want to create future notes or revise a topic.&lt;/p>
&lt;table>
 &lt;thead>
 &lt;tr>
 &lt;th>Topic&lt;/th>
 &lt;th>Primary source PDFs&lt;/th>
 &lt;th>Supporting source PDFs&lt;/th>
 &lt;th>Future Hugo page&lt;/th>
 &lt;/tr>
 &lt;/thead>
 &lt;tbody>
 &lt;tr>
 &lt;td>Linear systems&lt;/td>
 &lt;td>Lecture 1&lt;/td>
 &lt;td>Webinar 1&lt;/td>
 &lt;td>&lt;code>01-linear-systems-and-matrices.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Matrix operations&lt;/td>
 &lt;td>Lecture 1&lt;/td>
 &lt;td>Webinar 1&lt;/td>
 &lt;td>&lt;code>01-linear-systems-and-matrices.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Vector spaces&lt;/td>
 &lt;td>Lecture 2&lt;/td>
 &lt;td>Webinar 1&lt;/td>
 &lt;td>&lt;code>02-vector-spaces-subspaces-basis-rank.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Subspaces&lt;/td>
 &lt;td>Lecture 2&lt;/td>
 &lt;td>Webinar 1&lt;/td>
 &lt;td>&lt;code>02-vector-spaces-subspaces-basis-rank.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Linear independence, span, basis&lt;/td>
 &lt;td>Lecture 2&lt;/td>
 &lt;td>Webinar 1&lt;/td>
 &lt;td>&lt;code>02-vector-spaces-subspaces-basis-rank.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Rank and nullity&lt;/td>
 &lt;td>Lecture 2&lt;/td>
 &lt;td>Webinar 1&lt;/td>
 &lt;td>&lt;code>02-vector-spaces-subspaces-basis-rank.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Norms and distances&lt;/td>
 &lt;td>Lecture 3&lt;/td>
 &lt;td>Webinar 1&lt;/td>
 &lt;td>&lt;code>03-analytic-geometry-norms-inner-products.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Inner products&lt;/td>
 &lt;td>Lecture 3&lt;/td>
 &lt;td>Webinar 1&lt;/td>
 &lt;td>&lt;code>03-analytic-geometry-norms-inner-products.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Orthogonality and Gram-Schmidt&lt;/td>
 &lt;td>Lecture 3&lt;/td>
 &lt;td>Webinar 1&lt;/td>
 &lt;td>&lt;code>03-analytic-geometry-norms-inner-products.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Determinant and trace&lt;/td>
 &lt;td>Lecture 4&lt;/td>
 &lt;td>Webinar 1&lt;/td>
 &lt;td>&lt;code>04-determinants-trace-eigenvalues.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Eigenvalues/eigenvectors&lt;/td>
 &lt;td>Lecture 4&lt;/td>
 &lt;td>Webinar 1, Webinar 2&lt;/td>
 &lt;td>&lt;code>04-determinants-trace-eigenvalues.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Cholesky&lt;/td>
 &lt;td>Lecture 4&lt;/td>
 &lt;td>Webinar 1&lt;/td>
 &lt;td>&lt;code>04-determinants-trace-eigenvalues.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Diagonalisation&lt;/td>
 &lt;td>Lecture 5&lt;/td>
 &lt;td>Webinar 2&lt;/td>
 &lt;td>&lt;code>05-eigendecomposition-svd-matrix-approximation.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Eigendecomposition&lt;/td>
 &lt;td>Lecture 5&lt;/td>
 &lt;td>Webinar 2&lt;/td>
 &lt;td>&lt;code>05-eigendecomposition-svd-matrix-approximation.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>SVD&lt;/td>
 &lt;td>Lecture 5&lt;/td>
 &lt;td>Lecture 13, Webinar 1&lt;/td>
 &lt;td>&lt;code>05-eigendecomposition-svd-matrix-approximation.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Differentiation&lt;/td>
 &lt;td>Lecture 6&lt;/td>
 &lt;td>Webinar 2&lt;/td>
 &lt;td>&lt;code>06-vector-calculus-gradients.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Gradients&lt;/td>
 &lt;td>Lecture 6, Lecture 7&lt;/td>
 &lt;td>Webinar 2, Webinar 3&lt;/td>
 &lt;td>&lt;code>06-vector-calculus-gradients.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Backpropagation&lt;/td>
 &lt;td>Lecture 7&lt;/td>
 &lt;td>—&lt;/td>
 &lt;td>&lt;code>07-backpropagation-automatic-differentiation.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Automatic differentiation&lt;/td>
 &lt;td>Lecture 7&lt;/td>
 &lt;td>—&lt;/td>
 &lt;td>&lt;code>07-backpropagation-automatic-differentiation.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Taylor/Maclaurin series&lt;/td>
 &lt;td>Lecture 6, Lecture 8&lt;/td>
 &lt;td>Webinar 2&lt;/td>
 &lt;td>&lt;code>08-taylor-series-hessian-maxima-minima.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Hessian&lt;/td>
 &lt;td>Lecture 8&lt;/td>
 &lt;td>Webinar 2&lt;/td>
 &lt;td>&lt;code>08-taylor-series-hessian-maxima-minima.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Maxima/minima&lt;/td>
 &lt;td>Lecture 8&lt;/td>
 &lt;td>Webinar 2&lt;/td>
 &lt;td>&lt;code>08-taylor-series-hessian-maxima-minima.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Gradient descent&lt;/td>
 &lt;td>Lecture 9&lt;/td>
 &lt;td>Webinar 3&lt;/td>
 &lt;td>&lt;code>09-gradient-descent-continuous-optimisation.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Step size / line search&lt;/td>
 &lt;td>Lecture 9&lt;/td>
 &lt;td>Webinar 3&lt;/td>
 &lt;td>&lt;code>09-gradient-descent-continuous-optimisation.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Constrained optimisation&lt;/td>
 &lt;td>Lecture 9, Lecture 14&lt;/td>
 &lt;td>Webinar 4&lt;/td>
 &lt;td>&lt;code>14-lagrangian-duality-kkt.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Lagrange multipliers&lt;/td>
 &lt;td>Lecture 14&lt;/td>
 &lt;td>Webinar 4&lt;/td>
 &lt;td>&lt;code>14-lagrangian-duality-kkt.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>KKT conditions&lt;/td>
 &lt;td>Lecture 14, Lecture 15&lt;/td>
 &lt;td>Webinar 4&lt;/td>
 &lt;td>&lt;code>14-lagrangian-duality-kkt.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Feature preprocessing&lt;/td>
 &lt;td>Lecture 10&lt;/td>
 &lt;td>—&lt;/td>
 &lt;td>&lt;code>10-nonlinear-optimisation-sgd-feature-preprocessing.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Overfitting&lt;/td>
 &lt;td>Lecture 10&lt;/td>
 &lt;td>—&lt;/td>
 &lt;td>&lt;code>10-nonlinear-optimisation-sgd-feature-preprocessing.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>SGD&lt;/td>
 &lt;td>Lecture 10&lt;/td>
 &lt;td>Webinar 3&lt;/td>
 &lt;td>&lt;code>10-nonlinear-optimisation-sgd-feature-preprocessing.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Cliffs and valleys&lt;/td>
 &lt;td>Lecture 11&lt;/td>
 &lt;td>—&lt;/td>
 &lt;td>&lt;code>11-momentum-adagrad-rmsprop-adam.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Momentum&lt;/td>
 &lt;td>Lecture 11&lt;/td>
 &lt;td>Webinar 3&lt;/td>
 &lt;td>&lt;code>11-momentum-adagrad-rmsprop-adam.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>AdaGrad, RMSProp, Adam&lt;/td>
 &lt;td>Lecture 11&lt;/td>
 &lt;td>—&lt;/td>
 &lt;td>&lt;code>11-momentum-adagrad-rmsprop-adam.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>PCA foundations&lt;/td>
 &lt;td>Lecture 12&lt;/td>
 &lt;td>Webinar 4&lt;/td>
 &lt;td>&lt;code>12-pca-foundations.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>PCA computation&lt;/td>
 &lt;td>Lecture 13&lt;/td>
 &lt;td>Webinar 4&lt;/td>
 &lt;td>&lt;code>13-pca-practical-computation-svd.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Low-rank PCA&lt;/td>
 &lt;td>Lecture 13&lt;/td>
 &lt;td>Lecture 5&lt;/td>
 &lt;td>&lt;code>13-pca-practical-computation-svd.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>SVM preliminaries&lt;/td>
 &lt;td>Lecture 14&lt;/td>
 &lt;td>Webinar 4&lt;/td>
 &lt;td>&lt;code>15-support-vector-machines.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Linear SVM&lt;/td>
 &lt;td>Lecture 15&lt;/td>
 &lt;td>Webinar 4&lt;/td>
 &lt;td>&lt;code>15-support-vector-machines.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Hinge loss&lt;/td>
 &lt;td>Lecture 15&lt;/td>
 &lt;td>Webinar 4&lt;/td>
 &lt;td>&lt;code>15-support-vector-machines.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Kernels / nonlinear SVM&lt;/td>
 &lt;td>Lecture 14/15, possibly missing Lecture 16&lt;/td>
 &lt;td>Webinar 4&lt;/td>
 &lt;td>&lt;code>16-nonlinear-svm-kernels.md&lt;/code>&lt;/td>
 &lt;/tr>
 &lt;/tbody>
&lt;/table></description></item></channel></rss>