The paper introduces TEMPS, a modular temporal branch that enhances semantic retrievers by adding a temporal scoring component. TEMPS resolves anchored temporal expressions into intervals, matches them to Gaussian distributions, and trains an anchor-date-conditioned encoder using grounding supervision without hand‑labeled data. On three temporal benchmarks, TEMPS improves MRR across all tested backbones and raises R@1 from 19.92 to 25.39 on the TS‑Retriever, surpassing prior temporal state‑of‑the‑art methods.
By Mourad Hassani, Julien Romero, Amel Bouzeghoub, Christian Jacquelinet
The paper investigates how scaling hard‑negative training for rerankers can improve industrial legal retrieval systems once embedding recall saturates. On Chinese legal benchmarks, a pipeline that first uses embedding‑mined negatives and then self‑mined negatives yields the best trade‑off, and a 4B‑parameter Stage2 reranker outperforms the native 4B model on STARD, CSAID, and internal datasets. The study demonstrates that evaluating retrieval and reranking stages separately is beneficial for optimizing industrial retrieval performance.
By Yunhan Li, Mingjie Xie, Zeyang Shi, Gengshen Wu, Min Yang
arXiv:2604. 23336v3 Announce Type: replace-cross Abstract: Unlike traditional fact-based retrieval, rationale-based retrieval typically necessitates cross-encoding of query-document pairs using large language models, incurring substantial computational costs.
By Teng Chen, Sheng Xu, Feixiang Guo, Xiaoyu Wang, Qingqing Gu, Hongyan Li, Luo Ji
The paper investigates which historical examples are most useful for time‑series forecasting by defining predictive relevance as the expected future utility conditioned on inference‑time information. It introduces a two‑stage approach: a normalized‑pattern retriever generates a coarse candidate set, and a lightweight MLP reranks these candidates using future‑supervised relevance while keeping inference strictly past‑only. Experiments on six benchmarks show that this reranker improves pattern retrieval and outperforms a matched‑protocol baseline, revealing that historical relevance is structured, domain‑dependent, and not governed by a single universal retrieval rule.
By Yong-Hoon Choi, Kwang-Hyun Park, Youngjin Cho
arXiv:2606. 01070v1 Announce Type: cross Abstract: Dense retrievers excel at first-stage candidate generation but lack effective reranking in zero-resource settings.
By Shiyan Liu, Yichen Li
CORE improves compositional reasoning in multimodal language models by distilling a cross‑attentive reranker’s fine‑grained judgments into the embedding model. It generates candidate lists across five compositional matching levels and trains with a Rank‑KL objective to replicate the reranker’s ranking. Experiments on COLA, SUGARCREPE++, and NEGBENCH show CORE‑RERANKER‑8B outperforms Jina‑Reranker by 10.7 points, while CORE‑EMBED‑8B achieves the best overall average among evaluated embeddings, with gains also transferring to the MCMR benchmark without harming COCO or Flickr30K retrieval.
By Tingyu Song, Mingxin Li, Yanzhao Zhang, Dingkun Long, Chu Liu, Pengjun Xie, Yilun Zhao, Shu Wu