/explore
|
You are here 
|
almostsuremath.com | ||
| | | | |
blog.georgeshakan.com
In this post, I talk about the mathematical foundations of PCA |
|
| | | | | ||
| | | | |
gregorygundersen.com
|
|
| | | | | ||
| | | | |
fa.bianp.net
The Langevin algorithm is a simple and powerful method to sample from a probability distribution. It's a key ingredient of some machine learning methods such as diffusion models and differentially private learning. In this post, I'll derive a simple convergence analysis of this method in the special case when the ... |
|
| | | | | ||
| | | | |
www.jeremykun.com
The singular value decomposition (SVD) of a matrix is a fundamental tool in computer science, data analysis, and statistics. It's used for all kinds of applications from regression to prediction, to finding approximate solutions to optimization problems. In this series of two posts we'll motivate, define, compute, and use the singular value decomposition to analyze some data. (Jump to the second post) I want to spend the first post entirely on motivation and background. |
|
| | | |||
