Explore >> Select a destination
|
You are here 
|
bartwronski.com | ||
| | | | |
francisbach.com
|
|
| | | | | [AI summary] The blog post discusses the spectral properties of kernel matrices, focusing on the analysis of eigenvalues and their estimation using tools like the matrix Bernstein inequality. It also covers the estimation of the number of integer vectors with a given L1 norm and the relationship between these counts and combinatorial structures. The post includes a detailed derivation of bounds for the difference between true and estimated eigenvalues, highlighting the role of the degrees of freedom and the impact of regularization in kernel methods. Additionally, it touches on the importance of spectral analysis in machine learning and its applications in various domains. | |
| | | | |
greydanus.github.io
|
|
| | | | | A blog by Sam Greydanus | |
| | | | |
www.ethanepperly.com
|
|
| | | | | ||
| | | | |
www.jeremykun.com
|
|
| | | Last time we defined and gave some examples of rings. Recapping, a ring is a special kind of group with an additional multiplication operation that "plays nicely" with addition. The important thing to remember is that a ring is intended to remind us arithmetic with integers (though not too much: multiplication in a ring need not be commutative). We proved some basic properties, like zero being unique and negation being well-behaved. | ||
