For KVzip, we use dense scoring and compare shared selection rules that balance importance across heads.
For Attention Matching, we compare HAK and OMP selection, then fit per-head biases and shared latent values against GLM’s sparse attention. We fit one layer at a time, accounting for changes introduced by earlier compression.