Zakaria Laabsi
Notes on AI & mathematics
TurboQuant compresses embeddings aggressively without corpus-specific training. This post covers the algorithm, the turboquant-embed implementation, and the retrieval benchmarks that hold up on BeIR.
TurboQuant achieves near-optimal vector quantization without seeing the data. This post traces the full theory, from random projections and 1-bit quantized JL transforms through polar decompositions to the final distortion bounds, with complete proofs.
Every impartial combinatorial game reduces to a single XOR computation. This post walks through the full theory (from Nim to the Sprague-Grundy theorem) with proofs, examples, and code.