Non-Negative Least Squares
Why constraining ensemble weights to be non-negative stabilizes them, and how to solve the resulting problem with projected gradient descent and the Lawson-H...
Recent posts
Marching Squares
You have an equation f(x, y) = 0 but no way to draw it. Marching squares fixes that with a surprisingly simple idea.
Loss Spikes in Gradient Descent
Loss spikes aren’t noise. They’re gradient descent briefly exceeding the edge of stability and snapping back. Here’s why.
Fixed Point vs Floating Point: A Numerical Representation Deep Dive
A ground-up look at how floating-point and fixed-point numbers are represented and how arithmetic works for each
Robust Regression Without Gradients
L1 regression is more robust to outliers than least squares, but harder to solve. We walk through four algorithms, each addressing a limitation of the previo...
Golden Section Search for Robust Regression
Golden section search reuses objective evaluations to efficiently minimize 1D functions. Learn how this classical algorithm connects to the golden ratio and ...
Chatterjee’s Xi Coefficient
Detect nonlinear relationships that Pearson and Spearman miss.
Newton-Gregory Interpolation
Interpolate equally-spaced data efficiently and discover its connection to Taylor series.
BKM
Compute logarithms and exponentials without a floating point unit.
CORDIC
Compute sine, cosine, and exponentials using only addition, subtraction, and bit shifts.