mlsanityData to 14 Oct 2026

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

arXiv 2608.16918 ↗First posted 31 Jul 2026cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

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 components, functions, and constraints into a single embedding. We propose Sparse Coverage, an unsupervised semantic retrieval framework that maps local span embeddings to a sparse vocabulary of embedding-space centers. The centers are selected with a coverage-oriented k-center objective, and spans activate nearby centers to produce sparse representations compatible with inverted-index retrieval. Experiments on CLEF-IP 2013 show that Sparse Coverage matches or exceeds the document-level recall of strong dense patent encoders in several configurations, while remaining competitive for passage-level retrieval. By combining local semantic evidence with sparse inverted-index search, Sparse Coverage provides an effective first-stage retrieval approach for patent search.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 8 references that are in the map. First posted on arXiv 31 Jul 2026.

Builds on

3 of 8 references.

References · 3

  1. 2021PatentSBERTa: A Deep NLP based Hybrid Model for Patent Distance and Classification using Augmented SBERTcited by 24
  2. 2025PatenTEB: A Comprehensive Benchmark and Model Family for Patent Text Embeddingcited by 4
  3. 2026Citation-Driven Multi-View Training for Patent Embeddings: QaECTER and Sophia-Benchcited by 1

Built on by

Not cited yet.