Key Takeaways
- Positive definite: for all
- Equivalent to all eigenvalues being positive
- Cholesky decomposition is 2× faster than LU
- Covariance matrices and kernel matrices must be PSD
- Hessian must be PD at a local minimum for optimization
Understand positive definiteness, Cholesky decomposition, and their role in optimization, covariance matrices, and kernel methods.
Advertisement