Turns out it generalizes to _every distribution_ using cumulant tensors!
That's higher order variance, skewness, kurtosis, etc.
Turns out it generalizes to _every distribution_ using cumulant tensors!
That's higher order variance, skewness, kurtosis, etc.
Hopefully it can also be a way to help people become familiar with tensor diagrams.
Hopefully it can also be a way to help people become familiar with tensor diagrams.
(n/e)ⁿ√{2π n} ≤ n! ≤ (n/e)ⁿ(√{2π n}+1)
Inspired by the discussion on mathoverflow.net/a/458011/5429. Just had to keep hitting it with logarithmic inequalities...
(n/e)ⁿ√{2π n} ≤ n! ≤ (n/e)ⁿ(√{2π n}+1)
Inspired by the discussion on mathoverflow.net/a/458011/5429. Just had to keep hitting it with logarithmic inequalities...
This is data is considered elsewhere in the search tree to decide how much time to spend considering the move.
Why do this?
2/5
This is data is considered elsewhere in the search tree to decide how much time to spend considering the move.
Why do this?
2/5
By "taking notes" as you read, ypu reduce the complexity from N^3 (N tokens at N^2 cost) to N^3/3 (1+4+9+...+N^2).
By "taking notes" as you read, ypu reduce the complexity from N^3 (N tokens at N^2 cost) to N^3/3 (1+4+9+...+N^2).