- Throwing darts in latent space ()
- Hamilton–Jacobi–Bellman is just linear duality ()
- The (sometimes rocky) road to a paper ()
- Acorn and the future of (AI?) theorem proving ()
- A lovely counting inequality ()
- Linear algebra over field extensions ()
- A global Picard iteration ()
- There are exponentially many vectors with small inner product ()
- Proving theorems using Julia's types (or, a mini-Lean in Julia) ()
- The minimal amount necessary, but no less ()
- Have we been building blockchains wrong? ()
- A simple proof of Shapley–Folkman ()
- Another short proof of OCO and miscellanea ()
- Online gradient descent has low regret: a one-ish-liner ()
- An update and who knows ()
- A non-counting lower bound for the expected distance of a simple random walk ()
- A note on "Optimal Design of Controlled Environment Agricultural Systems (...)" ()
- Comparisons and information theory: why the worst-case complexity of sorting is n log n ()
- The S-procedure and small covering ellipsoids ()
- Physics, optimization, and impossibility ()
- Markov processes and the second law ()
- Machine learning, information, and tail bounds ()
- PCA as a convex optimization problem ()
- Fast shortest paths for time-varying graphs (Part 4/?) ()
- Proximal gradient for SVM ()
- Optimizers, momentum, and cooling schedules (Part 2/?) ()
- Some thoughts on global path optimization (Part 1/?) ()
- Least-squares and image processing ()
- PID as least squares ()
- This blog is a lie ()