mlsanityData to 7 Oct 2026

Patent Representation Learning via Self-supervision

arXiv 2511.10657 ↗First posted 3 Nov 2025cs.CL cs.AI cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

We study self-supervised patent representation learning with contrastive objectives. A standard baseline constructs positives by encoding the same text twice under independent dropout masks, but applying this recipe to long, structured patent documents requires careful calibration. We show that dropout-only training can be substantially strengthened by tuning temperature and dropout rate, yet its best configuration is evaluation-dependent and does not transfer uniformly from title--abstract retrieval to claim-to-disclosure retrieval. We propose mixed dropout--section positives, a patent-specific view construction strategy in which each positive pair links the title--abstract view of a patent either to a dropout re-encoding of itself or to another section of the same patent, such as claims, summary, background, drawings, or description. This uses patent-internal structure as a training-time signal without IPC labels, citations, or relevance annotations. We evaluate on graded EPO search-report retrieval, DAPFAM, a recently proposed family-level patent retrieval benchmark, and IPC subclass classification. Section-based positives improve over calibrated dropout-only and generic title--abstract augmentation baselines, are competitive with citation-informed patent encoders and a general-purpose embedding model, and perform strongly on the out-of-domain split of DAPFAM. Additional cross-section alignment diagnostics show that section-pair training improves compatibility among abstracts, claims, and descriptions of the same invention. These results indicate that patent sections provide effective self-supervised positive views for learning dense patent representations.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 3 of its 10 references that are in the map. First posted on arXiv 3 Nov 2025.

Builds on

3 of 10 references.

References · 3

  1. 2021PatentSBERTa: A Deep NLP based Hybrid Model for Patent Distance and Classification using Augmented SBERTcited by 22
  2. 2024Length-Induced Embedding Collapse in PLM-based Modelscited by 9
  3. 2023Efficient Document Embeddings via Self-Contrastive Bregman Divergence Learningcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.