PulseAugur
EN
LIVE 09:18:18

New Sparse Coverage Framework Enhances Patent Prior-Art Retrieval

Researchers have developed a new framework called Sparse Coverage for patent prior-art retrieval. This unsupervised method maps local span embeddings to a sparse vocabulary of embedding-space centers, which are selected using a coverage-oriented k-center objective. Experiments on the CLEF-IP 2013 dataset indicate that Sparse Coverage achieves comparable or superior document-level recall compared to strong dense patent encoders, while also remaining competitive for passage-level retrieval. AI

IMPACT This new retrieval framework could improve the efficiency and accuracy of searching through complex technical documents like patents.

RANK_REASON The cluster contains an academic paper detailing a new method for information retrieval. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

New Sparse Coverage Framework Enhances Patent Prior-Art Retrieval

COVERAGE [1]

  1. arXiv cs.AI TIER_1 English(EN) · You Zuo (ALMAnaCH), Kim Gerdes (LISN, Qatent, STL), \'Eric de la Clergerie (ALMAnaCH), Beno\^it Sagot (ALMAnaCH) ·

    Sparse Coverage: Semantic Center Representations for Patent Prior-Art Retrieval

    arXiv:2608.16918v1 Announce Type: cross Abstract: Patent prior-art retrieval is a recall-oriented search task over long and highly structured technical documents. Dense retrieval improves semantic matching, but single-vector representations may compress multiple technical compone…