Explore >> Select a destination
|
You are here 
|
nhigham.com | ||
| | | | |
quomodocumque.wordpress.com
|
|
| | | | | I met Mike Freedman last week at CMSA and I learned a great metaphor about an old favorite subject of mine, random walks on groups. The Heisenberg group is the group of upper triangular matrices with 1's on the diagonal: You can take a walk on the integral or Z/pZ points of the Heisenberg group... | |
| | | | |
francisbach.com
|
|
| | | | | [AI summary] This technical blog post explores the mathematical properties of symmetric positive definite matrices, specifically focusing on the Löwner order, matrix monotonicity, and matrix convexity in the context of machine learning and optimization. | |
| | | | |
fa.bianp.net
|
|
| | | | | There's a fascinating link between minimization of quadratic functions and polynomials. A link that goes deep and allows to phrase optimization problems in the language of polynomials and vice versa. Using this connection, we can tap into centuries of research in the theory of polynomials and shed new light on ... | |
| | | | |
poissonisfish.com
|
|
| | | My last entryintroduces principal component analysis (PCA), one of many unsupervised learning tools. I concluded the post with a demonstration of principal component regression (PCR), which essentially is a ordinary least squares (OLS) fit using the first $latex k &s=1$ principal components (PCs) from the predictors. This brings about many advantages: There is virtually no... | ||
