Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2508.03306v1

Help | Advanced Search

Computer Science > Information Retrieval

arXiv:2508.03306v1 (cs)
[Submitted on 5 Aug 2025 (this version) , latest version 6 Aug 2025 (v2) ]

Title: Reliable Evaluation Protocol for Low-Precision Retrieval

Title: 低精度检索的可靠评估协议

Authors:Kisu Yang, Yoonna Jang, Hwanseok Jang, Kenneth Choi, Isabelle Augenstein, Heuiseok Lim
Abstract: Lowering the numerical precision of model parameters and computations is widely adopted to improve the efficiency of retrieval systems. However, when computing relevance scores between the query and documents in low-precision, we observe spurious ties due to the reduced granularity. This introduces high variability in the results based on tie resolution, making the evaluation less reliable. To address this, we propose a more robust retrieval evaluation protocol designed to reduce score variation. It consists of: (1) High-Precision Scoring (HPS), which upcasts the final scoring step to higher precision to resolve tied candidates with minimal computational cost; and (2) Tie-aware Retrieval Metrics (TRM), which report expected scores, range, and bias to quantify order uncertainty of tied candidates. Our experiments test multiple models with three scoring functions on two retrieval datasets to demonstrate that HPS dramatically reduces tie-induced instability, and TRM accurately recovers expected metric values. This combination enables a more consistent and reliable evaluation system for lower-precision retrievals.
Abstract: 降低模型参数和计算的数值精度被广泛采用以提高检索系统的效率。 然而,在低精度下计算查询与文档之间的相关性得分时,我们观察到由于粒度减少而产生的虚假平局。 这会导致基于平局解决的结果具有较高的变异性,使得评估不够可靠。 为了解决这个问题,我们提出了一种更稳健的检索评估协议,旨在减少得分变化。 它包括:(1) 高精度评分(HPS),将最终评分步骤提升到更高精度,以最低的计算成本解决平局候选;以及 (2) 有意识处理平局的检索指标(TRM),报告期望得分、范围和偏差,以量化平局候选的顺序不确定性。 我们的实验在两个检索数据集上测试了多种模型和三种评分函数,以证明HPS显著减少了由平局引起的不稳定性,而TRM准确恢复了期望的指标值。 这种组合使更低精度的检索评估系统更加一致和可靠。
Comments: 11 pages, 5 figures, submitted to ARR
Subjects: Information Retrieval (cs.IR) ; Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
Cite as: arXiv:2508.03306 [cs.IR]
  (or arXiv:2508.03306v1 [cs.IR] for this version)
  https://doi.org/10.48550/arXiv.2508.03306
arXiv-issued DOI via DataCite

Submission history

From: Kisu Yang [view email]
[v1] Tue, 5 Aug 2025 10:27:57 UTC (1,542 KB)
[v2] Wed, 6 Aug 2025 02:48:59 UTC (10,637 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
license icon view license
Current browse context:
cs.IR
< prev   |   next >
new | recent | 2025-08
Change to browse by:
cs
cs.AI
cs.CL

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号