0.6B参数模型实现高效精准文档重排序,适合生产部署。
jina-reranker-v3.5: An Efficient Listwise Reranker with Hybrid Attention and Self-Distillation
- 采用混合注意力机制与分阶段自蒸馏,提升效率与鲁棒性。
- 在BEIR上达63.20 nDCG@10,仅用7倍少参数媲美4B模型。
- 对半结构化数据重排序效果提升9.6点,推理延迟降低1.56倍。
列表式重排序器是智能检索管道的核心,但实际部署需兼顾效率、领域鲁棒性及对半结构化数据的流畅处理。本文提出jina-reranker-v3.5,一个0.6B参数的列表式重排序模型,在不牺牲前代模型跨文档对比能力的前提下,同时满足上述需求。该模型保留了jina-reranker-v3的最后非晚(LBNL)交互机制,并从三方面优化:将均匀全局注意力替换为三个滑动窗口层加两个全局层的混合调度,终层固定为全局注意力以满足LBNL读出要求;在涵盖法律、医疗、金融、多语言及结构化检索的多领域精选混合数据集上训练;通过三阶段自蒸馏流程,由全注意力教师模型设定性能上限,稀疏注意力学生模型逐步恢复性能。jina-reranker-v3.5在BEIR上达到63.20 nDCG@10,仅用约7倍少的参数即可匹敌4B模型,且在MIRACL和RTEB上优于前代。其最大增益出现在半结构化检索任务中,相比jina-reranker-v3提升9.6点nDCG@10,领先同规模所有重排序器。混合调度还将列表式推理延迟最多降低1.56倍。模型权重已发布于Hugging Face,非商业用途可使用。
原文摘要 · Abstract (English)
Listwise rerankers are the discriminative core of agentic retrieval pipelines, yet production deployment demands efficiency, domain robustness, and fluency on semi-structured data at the same time. We present jina-reranker-v3.5, a 0.6B-parameter listwise reranker that meets these demands together without sacrificing the cross-document comparison that makes its predecessor jina-reranker-v3 effective. jina-reranker-v3.5 keeps the last-but-not-late (LBNL) interaction of jina-reranker-v3 and reworks it along three axes. It replaces uniform global attention with a hybrid schedule of three sliding-window layers followed by two global layers, pinning the terminal layer to global as LBNL readout requires. It trains on a curated multi-domain mixture that spans legal, medical, financial, multilingual, and structured retrieval. It transfers quality through a three-stage self-distillation recipe in which a full-attention teacher sets an upper bound that a sparse-attention student then recovers under a staged adaptation protocol. jina-reranker-v3.5 reaches 63.20 nDCG@10 on BEIR, matching a 4B model at roughly 7x fewer parameters, and improves over jina-reranker-v3 on MIRACL and RTEB as well. Its largest gains come on semi-structured retrieval, where it lifts nDCG@10 by 9.6 points over jina-reranker-v3 and leads all rerankers of comparable size. The hybrid schedule further cuts listwise inference latency by up to 1.56x. We release the model weights on Hugging Face under a non-commercial license.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。