Auto-generated summary from the source site. Handy as a checklist; the lessons above explain each idea from scratch.
Summary of Core Topics, Concepts, Principles, and Equations
1. Optimization and Critical Points
Gradient and Hessian Matrix: For a function f:Rn→R, the gradient ∇f(x∗)=0 and the Hessian matrix ∇2f(x∗) being positive definite indicate a local minimum.
Quadratic Forms: Understanding positive definiteness, positive semi-definiteness, negative definiteness, and negative semi-definiteness of quadratic forms.
2. Matrix Properties
Positive Definite Matrices: A matrix A is positive definite if xTAx>0 for all non-zero vectors x.
Eigenvalues and Eigenvectors: For a Hermitian matrix, eigenvalues are real, and eigenvectors corresponding to different eigenvalues are orthogonal.
Singular Value Decomposition (SVD): For a matrix A, SVD is given by A=Q1ΣQ2T, where Q1 and Q2 are orthogonal matrices, and Σ is a diagonal matrix of singular values.
3. Principal Component Analysis (PCA)
Covariance Matrix: The sample covariance matrix C is used to find the principal components.
Eigenvalues and Principal Components: The eigenvalues of the covariance matrix represent the variance in the direction of the corresponding eigenvectors (principal components).
4. Gradient Descent
Gradient Descent Algorithm: Iterative method to minimize a function f(x,y) using the update rule xt+1=xt−ηt∇f(xt), where ηt is the learning rate.
5. Distance Minimization
Distance Formula: The distance between two points (x1,y1) and (x2,y2) is given by d=(x2−x1)2+(y2−y1)2.