/explore
|
You are here 
|
gowers.wordpress.com | ||
| | | | |
gilkalai.wordpress.com
A geometric graph is a set of points in the plane (vertices) and a set of line segments between certain pairs of points (edges). A geometric graph is simple if the intersection of two edges is empty or a vertex of both. A geometric graph is convex if the vertices are in convex position. A... |
|
| | | | | ||
| | | | |
francisbach.com
[AI summary] This mathematical post explores the geometry of positive semi-definite matrices using the von Neumann entropy and related Bregman divergences to derive concentration inequalities for random matrices. |
|
| | | | | ||
| | | | |
windowsontheory.org
Previous post: ML theory with bad drawings Next post: What do neural networks learn and when do they learn it, see also all seminar posts and course webpage. Lecture video (starts in slide 2 since I hit record button 30 seconds too late - sorry!) - slides (pdf) - slides (Powerpoint with ink and animation)... |
|
| | | | | ||
| | | | |
possiblywrong.wordpress.com
Introduction Let's play a game: I will repeatedly flip a fair coin, showing you the result of each flip, until you say to stop, at which point you win an amount equal to the fraction of observed flips that were heads. What is your strategy for deciding when to stop? This weekend 6/28 is "Two-Pi... |
|
| | | |||
