arXiv AI By 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

Read the original on arXiv AI →

Sparse Coverage is an unsupervised semantic retrieval framework designed for patent prior‑art search. It maps local span embeddings to a sparse vocabulary of embedding‑space centers chosen via a coverage‑oriented k‑center objective, allowing spans to activate nearby centers and produce sparse representations that work with inverted‑index retrieval. Experiments on CLEF‑IP 2013 demonstrate that Sparse Coverage matches or surpasses dense patent encoders in document‑level recall while remaining competitive at the passage level, making it an effective first‑stage retrieval approach for patent search.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Computation and Language
Sep 22

ChemCLIR-Bench: Benchmarking Cross-Lingual Information Retrieval in Multilingual Chemical Patents

arXiv:2609.23231v1 Announce Type: new Abstract: Cross-lingual information retrieval (CLIR) is increasingly important in multi-national industries, where critical technical evidence may exist in a dif...

By Mahdi Astaraki, Mohammad Khodadad, Reza Namazi, Mohammad Arshi Saloot, Amir Reza Behzad Moghadam, Hamidreza Mahyar, Soheila Samiee
arXiv AI
Jul 1

RARE: Redundancy-Aware Retrieval Evaluation Framework for High-Similarity Corpora

arXiv:2604. 19047v2 Announce Type: replace-cross Abstract: Existing QA benchmarks typically assume distinct documents with minimal overlap, yet real-world retrieval-augmented generation (RAG) systems operate on corpora such as financial reports, legal codes, and patents, where information is highly redundant and documents exhibit strong inter-document similarity.

By Hanjun Cho, Jay-Yoon Lee
arXiv AI
Oct 12

Benchmarking Embedding Geometries and Clustering Algorithms for Unsupervised Patent Claim Classification

The paper evaluates unsupervised embedding geometries for patent claim classification, comparing hyperbolic and Euclidean Variational Autoencoders trained on 45,000 US patents. Hyperbolic embeddings retrieve cross-category prior art 52% more often than Euclidean embeddings (18.76% vs. 12.34% of top‑10 results across 3,000 queries). The study also links classification breadth and patents per subgroup to model performance, offering a practical signal for when the method is most useful.

By Sujith Subramanian, P N Bhargav Teja, Susen Sarkar, Rajasekhara Reddy Duvvuru Muni