Vector search: HNSW in twenty minutes
How approximate nearest-neighbour search gets sub-linear without a space-partitioning tree.
How approximate nearest-neighbour search gets sub-linear without a space-partitioning tree.
Where the bits go, why outliers ruin everything, and the per-channel trick that saves them.
Why DDP feels like magic until you look at the allreduce schedule.
Pin everything, mount data, never bake it. The boring setup that stopped me losing runs.
The cache that makes autoregressive decoding fast also makes it the thing that runs out of memory first.