/explore
|
You are here 
|
fabricebaudoin.blog | ||
| | | | |
mathbabe.org
A continuation ofthis, where I take notes on my workshop atHCSSiM. The real numbers are uncountable Today we used Cantor's diagonal argument to prove that the real numbers aren't countable. Namely, we assumed they were, and that we had a bijection $latex f: \mathbb{N} \rightarrow \mathbb{R}$ and then proved it didn't contain the real number... |
|
| | | | | ||
| | | | |
statisticaloddsandends.wordpress.com
Let's say we have a convex, differentiable function $latex f: \mathbb{R}^p \rightarrow \mathbb{R}$ and that we want to minimize it. In this previous post, we saw that a gradient descent step at time $latex t$ (from point $latex \beta^t$) could be viewed as the minimizer of a quadratic approximation of $latex f$ at $latex \beta^t$:... |
|
| | | | | ||
| | | | |
leimao.github.io
Simple Proof to Multivariate Jensen's Inequality |
|
| | | | | ||
| | | | |
jeremykun.com
Hard to believe Sanjeev Arora and his coauthors consider it"a basic tool [that should be] taught to all algorithms students together with divide-and-conquer, dynamic programming, and random sampling."Christos Papadimitriou calls it"so hard to believe that it has been discovered five times and forgotten." It has formed the basis of algorithms inmachine learning, optimization, game theory, |
|
| | | |||
