Microsoft's EigenLI Compresses ColBERT Representations, Beats MUVERA Baseline
_reachsumit · x · 2026-09-09
Microsoft researchers present EigenLI, a training-free spectral method that compresses ColBERT-style late-interaction representations. Key insight: document token embeddings concentrate in a low-dimensional subspace that preserves most retrieval signal, so each document's dominant eigendirections can build a reduced interaction representation. k-EigenLI with k≤32 outperforms k-means and Ward clustering pooling on ColBERTv2 and AnswerAI-ColBERT-small, though GTE-ModernColBERT favors clustering at k=32. The same construction also yields EigenLI-SV, an ANN-compatible single-vector representation that consistently beats MUVERA-like surrogates across datasets and models.
Related event: Microsoft's EigenLI Compresses ColBERT Representations Without Training(2 posts)→
More from Research
- UniAction: unified action conditioning lets one world model handle mixed action types — ZeYanjie · 2026-10-27
- Artificial Analysis breaks down all sub-evaluations in Intelligence Index v4.3.2 — ArtificialAnlys · 2026-10-27
- Infini-AI Lab open-sources Hermit, a framework for agent harness evolution and continual learning — BeidiChen · 2026-10-27
- Meta FAIR's Self-Direction turns agent failures into reusable LoRA skills, +13.8pp on Terminal-Bench — karen_ullrich · 2026-10-27
- DONIC hits 86.79% on bimanual dexterous tracking, crushing prior SOTA's 9.43% — liuziwei7 · 2026-10-27
- Why don't more LLMs ship 10M-token context? A researcher asks about attention tradeoffs — agarwl_ · 2026-10-27