Explore >> Select a destination
|
You are here 
|
nhigham.com | ||
| | | | |
arkadiusz-jadczyk.eu
|
|
| | | | | ||
| | | | |
djalil.chafai.net
|
|
| | | | | This post is devoted to few convex and compact sets of matrices that I like. The set \( {\mathcal{C}_n} \) of correlation matrices. A real \( {n\times n} \) matrix \( {C} \) is a correlation matrix when \( {C} \) is symmetric, semidefinite positive, with unit diagonal. This means that \[ C_{ii}=1, \quad C_{ji}=C_{ji},\quad \left\geq0 \] for every \(... | |
| | | | |
hadrienj.github.io
|
|
| | | | | In this post, we will see special kinds of matrix and vectors the diagonal and symmetric matrices, the unit vector and the concept of orthogonality. | |
| | | | |
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 ... | ||
