Recent Progress on Information Retrieval
Reading across a selection of papers from ICLR 2026 (plus one arXiv preprint), a single argument emerges: 2026 information retrieval work is converging on a shared strategy of pushing cost off the query and online path. Whether the lever is data (Revela trains with far less of it), query-time compute (LightRetriever shrinks the query encoder), index footprint (MILCO and CSRv2 attack representation cost from opposite ends), or model size (the Transformer-SSM hybrid prunes attention to a retrieval-critical core), the recurring move is to relocate expense to where it is cheapest to absorb (offline indexing, fewer labels, or a smaller serving model) rather than to make retrieval itself fundamentally smarter.
The papers below navigate this shared goal from different angles. The table groups them by theme and names the tradeoff each one accepts in exchange for its efficiency gains.
| Theme | Papers | Where cost is moved | Tradeoff accepted |
|---|---|---|---|
| Cheaper supervision | Revela | From labeled pairs to an unsupervised language-modeling signal | Caps out at unsupervised quality; no annotated relevance signal |
| Cheaper query-time compute | LightRetriever | From the online query encoder to offline document encoding | Roughly 5% quality gap; out-of-domain behavior less characterized |
| Cheaper sparse representations | CSRv2, MILCO | CSRv2 to ultra-sparse dimensions; MILCO to a shared English lexical space | CSRv2 degrades at the lowest sparsity; MILCO inherits English-pivot bias |
| Cheaper indexing units | SPLARE, DISCo | SPLARE to SAE latents (also yielding language-agnostic representations); DISCo to submodular subset coverage | SPLARE depends on pretrained SAE quality; DISCo adds formulation complexity |
| Cheaper serving model | Transformer-SSM hybrid | From full attention to a retrieval-critical head subset plus SSMs | Validated only at small scale and short context |