<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Exam on Arshad Siddiqui</title><link>https://arshadhs.github.io/tags/exam/</link><description>Recent content in Exam on Arshad Siddiqui</description><generator>Hugo</generator><language>en-us</language><atom:link href="https://arshadhs.github.io/tags/exam/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>DNN Formula and Numerical Sheet</title><link>https://arshadhs.github.io/docs/ai/deep-learning/900-dnn-exam-formula-and-numerical-sheet/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://arshadhs.github.io/docs/ai/deep-learning/900-dnn-exam-formula-and-numerical-sheet/</guid><description>&lt;h1 id="dnn-formula-and-numerical-sheet">
 DNN Formula and Numerical Sheet
 
 &lt;a class="anchor" href="#dnn-formula-and-numerical-sheet">#&lt;/a>
 
&lt;/h1>
&lt;p>This page consolidates the most useful Deep Neural Networks formulas and numerical patterns for revision.&lt;/p>
&lt;p>It is designed for preparation and should be used together with the topic pages.&lt;/p>
&lt;blockquote class="book-hint info">
&lt;p>&lt;strong>Revision strategy:&lt;/strong>&lt;br>
Do not only memorise formulas.&lt;/p>
&lt;p>For each formula, know:&lt;/p>
&lt;ol>
&lt;li>what each symbol means&lt;/li>
&lt;li>when to apply it&lt;/li>
&lt;li>how to substitute values carefully&lt;/li>
&lt;li>what the output shape or answer represents&lt;/li>
&lt;/ol>
&lt;/blockquote>
&lt;hr>
&lt;h1 id="1-artificial-neuron">
 1. Artificial Neuron
 
 &lt;a class="anchor" href="#1-artificial-neuron">#&lt;/a>
 
&lt;/h1>
&lt;h2 id="weighted-sum-">
 Weighted Sum ☆
 
 &lt;a class="anchor" href="#weighted-sum-">#&lt;/a>
 
&lt;/h2>
&lt;span style="color: blue;">
 &lt;span>
 \[ 
z = \sum_{i=1}^{n} w_i x_i + b
 \]
 &lt;/span>
&lt;/span>
&lt;p>Vector form:&lt;/p></description></item></channel></rss>