IIT M DIPLOMA AN EXAM QDD2 03 Aug - 03 Aug 2025

Concepts this paper tests

Auto-generated summary from the source site. Handy as a checklist; the lessons above explain each idea from scratch.

Summary of Core Topics and Concepts

1. Optimization and Critical Points

• Gradient and Hessian Matrix:

  • Gradient ($\nabla f$): A vector of partial derivatives.
  • Hessian Matrix ($\nabla^2 f$): A matrix of second-order partial derivatives.

• Critical Points:

  • If $\nabla f(x^*) = 0$ and $\nabla^2 f(x^*) > 0$, then $x^*$ is a local minimum.
  • If $\nabla f(x^*) = 0$ and $\nabla^2 f(x^*) < 0$, then $x^*$ is a local maximum.
  • If $\nabla f(x^*) = 0$ and $\nabla^2 f(x^*)$ is indefinite, then $x^*$ is a saddle point.

2. Quadratic Forms and Definiteness

• Quadratic Form: $Q(x, y, z) = x^2 + 2xy - 2xz$

• Definiteness:

  • Positive Definite: $Q > 0$ for all non-zero vectors.
  • Positive Semi-Definite: $Q \geq 0$ for all vectors.
  • Negative Definite: $Q < 0$ for all non-zero vectors.
  • Negative Semi-Definite: $Q \leq 0$ for all vectors.
  • Indefinite: $Q$ can be positive or negative.

3. Matrix Properties

• Positive Definite Matrix: A matrix $A$ is positive definite if $x^T A x > 0$ for all non-zero vectors $x$.

• Singular Value Decomposition (SVD): $A = Q_1 \Sigma Q_2^T$

  • $Q_1$ and $Q_2$ are orthogonal matrices.
  • $\Sigma$ is a diagonal matrix with singular values.

4. Eigenvalues and Eigenvectors

• Eigenvalues: Scalars $\lambda$ such that $A v = \lambda v$ for some non-zero vector $v$.
• Eigenvectors: Non-zero vectors $v$ that satisfy $A v = \lambda v$.

• Properties:

  • For a Hermitian matrix, eigenvalues are real.
  • Eigenvectors corresponding to different eigenvalues are orthogonal.

5. Principal Component Analysis (PCA)

• Covariance Matrix: Measures the covariance between pairs of variables.
• Eigenvalues of Covariance Matrix: Indicate the variance in the direction of the corresponding eigenvector.
• Principal Components: The eigenvectors of the covariance matrix, ordered by the magnitude of their corresponding eigenvalues.

6. Gradient Descent

• Algorithm: Iterative method to find the minimum of a function.

• Update Rule: $x_{k+1} = x_k - \eta \nabla f(x_k)$

  • $\eta$ is the learning rate.
  • $\nabla f(x_k)$ is the gradient of the function at $x_k$.

Important Equations

1. Gradient and Hessian Matrix

2. Quadratic Form

3. Singular Value Decomposition (SVD)

4. Eigenvalue Equation

5. Covariance Matrix

6. Gradient Descent Update Rule

Graph 1: Optimization and Critical Points

Graph 2: Matrix Properties and SVD

Graph 3: Eigenvalues and Eigenvectors

Graph 4: Principal Component Analysis (PCA)

Graph 5: Gradient Descent

These graphs and summaries should help you understand the core topics and their relationships for the exam.