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:2503.23824

Help | Advanced Search

Computer Science > Information Retrieval

arXiv:2503.23824 (cs)
[Submitted on 31 Mar 2025 ]

Title: On the Reproducibility of Learned Sparse Retrieval Adaptations for Long Documents

Title: 关于长文档学习稀疏检索适应的可重复性

Authors:Emmanouil Georgios Lionis, Jia-Huei Ju
Abstract: Document retrieval is one of the most challenging tasks in Information Retrieval. It requires handling longer contexts, often resulting in higher query latency and increased computational overhead. Recently, Learned Sparse Retrieval (LSR) has emerged as a promising approach to address these challenges. Some have proposed adapting the LSR approach to longer documents by aggregating segmented document using different post-hoc methods, including n-grams and proximity scores, adjusting representations, and learning to ensemble all signals. In this study, we aim to reproduce and examine the mechanisms of adapting LSR for long documents. Our reproducibility experiments confirmed the importance of specific segments, with the first segment consistently dominating document retrieval performance. Furthermore, We re-evaluate recently proposed methods -- ExactSDM and SoftSDM -- across varying document lengths, from short (up to 2 segments) to longer (3+ segments). We also designed multiple analyses to probe the reproduced methods and shed light on the impact of global information on adapting LSR to longer contexts. The complete code and implementation for this project is available at: https://github.com/lionisakis/Reproducibilitiy-lsr-long.
Abstract: 文档检索是信息检索中最具挑战性的任务之一。它需要处理更长的上下文,通常会导致更高的查询延迟和计算开销。最近,学习稀疏检索(LSR)作为一种有前景的方法来解决这些挑战。一些研究者提出了通过使用不同的后期方法对LSR方法进行适应以处理更长的文档,包括n-grams和邻近度得分,调整表示,并学习整合所有信号。在本研究中,我们旨在复制并检查适应LSR处理长文档的机制。我们的可重复性实验确认了特定段落的重要性,第一个段落始终主导文档检索性能。此外,我们在不同文档长度上重新评估了最近提出的ExactSDM和SoftSDM方法,从短文档(最多2个段落)到更长的文档(3个以上段落)。我们还设计了多种分析来探究复制的方法,并揭示全局信息对适应LSR处理更长上下文的影响。该项目的完整代码和实现可在以下地址获取:https://github.com/lionisakis/Reproducibilitiy-lsr-long.
Comments: This is a preprint of our paper accepted at ECIR 2025
Subjects: Information Retrieval (cs.IR)
Cite as: arXiv:2503.23824 [cs.IR]
  (or arXiv:2503.23824v1 [cs.IR] for this version)
  https://doi.org/10.48550/arXiv.2503.23824
arXiv-issued DOI via DataCite
Journal reference: ECIR 2025, Part IV, LNCS 15575
Related DOI: https://doi.org/10.1007/978-3-031-88717-8_6
DOI(s) linking to related resources

Submission history

From: Emmanouil Georgios Lionis [view email]
[v1] Mon, 31 Mar 2025 08:19:31 UTC (524 KB)
Full-text links:

Access Paper:

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

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号