First Principles
Strip it down until it's true
Bloom Once, Bloom Right
Write it clean the first time
Rain, Tea & Recursion
The paper you skipped has the answer
Batch vs Stochastic Gradient Descent
· ☕ 4 min read · âœī¸ k4i
understand batch gradient descent, stochastic gradient descent, and mini-batch gradient descent.
Batch vs Stochastic Gradient Descent
Forward & Backward Propagation
· ☕ 5 min read · âœī¸ k4i
understand how backward propagation works in gradient descent.
Forward & Backward Propagation
Key Management With GnuPG
· ☕ 11 min read · âœī¸ k4i
learn how to manage you keys with GPG, and use it with ssh and git and pass.
Key Management With GnuPG
DSU on Tree (Sack)
· ☕ 9 min read · âœī¸ k4i
DSU on tree answers subtree queries by keeping the largest child's contribution and rebuilding only the small parts. The trick is not union-find; it is small-to-large merging hidden inside a DFS.
DSU on Tree (Sack)
Shortest Paths Algorithms
· ☕ 3 min read · âœī¸ k4i
compare shortest path algorithms: dijkstra, floyd, bellman-ford
Shortest Paths Algorithms
Tiling WM (i3)
· ☕ 4 min read · âœī¸ k4i
this is my i3 window manager configuration
Tiling WM (i3)
Use Random in C++
· ☕ 1 min read · âœī¸ k4i
introduce randomness into your C++ programs, the right way.
Use Random in C++