Mid-level Track Roadmap

AI: quantization

This course covers quantization of model weights: storing parameters in fewer bits so a model fits on the hardware available. It starts with the memory arithmetic for weights and the KV cache, then compares precision formats such as BF16, FP8, INT8 and INT4. It works through the scale and zero point mapping, explains how outliers break it, and describes methods like GPTQ and AWQ and formats like GGUF. It ends with task-based evaluation in your own language and a procedure for deciding whether and how to self-host.

What you'll learn

  • ✓Calculating whether a model's weights and KV cache fit in memory
  • ✓The differences between FP32, FP16, BF16, FP8, INT8 and INT4
  • ✓Quantizing with a scale and zero point, and how outliers distort the range
  • ✓How GPTQ and AWQ differ, and choosing among GGUF, MLX and GPU checkpoints
  • ✓Evaluating quantized models per task and per language against thresholds set in advance
  • ✓Deciding whether to self-host and serving a local model behind a provider interface
Free preview · Lesson 1 5 min read

The same idea, one level down

You already did this once. The pgvector course stored embeddings as halfvec to halve the index, and as one bit per dimension for a first-pass search. Both traded a little accuracy for a lot of memory.

Read the full lesson free →

Curriculum

7 lessons
Type to start searching...