Nov 2026· Proceedings of the 35th ACM International Conference on Information and Knowledge Management· 0 citations· 19 references
TL;DR
The conclusion is not that LLM rerankers are robust, but that negative distributions are part of the retriever-reranker interface and should be checked before deployment.
Abstract
Cross-encoder rerankers are often treated as safe, drop-in quality boosts once a first-stage retriever has recalled a candidate pool. The hidden assumption is simple: if the gold document is present, the reranker should still pick it out from whatever negatives the retriever supplies. We test that assumption with a recall-controlled stress test that keeps recall at 100% and varies only the distractor distribution. Under this protocol, a small cross-encoder's NDCG@10 falls by up to 50% when negatives shift from random documents to retriever-mined hard negatives. The collapse repeats across four rerankers spanning 4M-278M parameters and two training families, so it is not one weak model. We then ask whether zero-shot LLM rerankers fail in the same way. A listwise language-model reranker, with gpt-4o-mini as the strongest case, is less sensitive to BM25 hard negatives across three BEIR corpora, but the controls complicate the story. On nfcorpus, the advantage relies on the BM25-seeded listwise order. On fiqa and scifact, it survives pointwise scoring and shuffled-order controls, indicating intrinsic model robustness. Dense hard negatives still hurt all rerankers. The conclusion is therefore not that ''LLMs are robust,'' but that negative distributions are part of the retriever-reranker interface and should be checked before deployment. We end with a no-new-label diagnostic.
In-context learning (ICL) can be amortized into latent objects (task vectors, function vectors, context vectors) that recover few-shot behavior at zero-shot inference cost, but recent theory shows a static vector acts as a single synthetic demonstration and must fail on high-rank mappings such as word-level bijections....
LLM-based sequential recommenders increasingly train user/item encoders with in-batch InfoNCE negatives inherited from contrastive learning—convenient, but it silently caps the negative pool at batch size rather than catalog size whenever encoder cost bounds the batch. We report an early finding: a 15-negative in-batch...
Younggue Bae· Proceedings of the 20th ACM...· 0 citations
We are the first to give a certified rule for whether unseen data belong in a pretrained model's context or its weights, built on an exact law for their information value. That value, the code length saved on held-out queries, equals in expectation the bits stored about the query, plus a prior repair, minus a decoding...
An image is rarely described only once. Retrieval benchmarks and many collections attach several captions to each picture, yet dual encoders still judge every image-caption pair in isolation. We ask what these neighboring captions contribute when a frozen encoder consults them at inference time. Fusing image similarity...
Why do language models fail on long inputs? The common answer is length. We show that, for retrieval, length is cheap and competition is not. On five open models (0.5B to 3B parameters, four families), neutral filler costs nothing: accuracy stays at 0.97 to 1.00, up to 32K tokens on Qwen2.5-1.5B. Statements in the form...
Deep learning detectors for online misinformation report near-perfect in-domain accuracy, yet deployment faces distribution shift. This study asks whether such scores reflect a transferable ability to separate true from false content, auditing across three public corpora needing no social-media interface: LIAR statemen...
R. Raman, S. Salman, Babasaheb Jadhav et al.· International Journal on Sem...· 0 citations