Domain-Specific Text Embedding Models for Entity Resolution

• URL: http://arxiv.org/abs/2608.16161v1
• Date: Mon, 17 Aug 2026 06:26:05 GMT
• Title: Domain-Specific Text Embedding Models for Entity Resolution
• Abstract summary: This paper investigates whether domain-specific triplet fine-tuning can adapt pretrained embedding models for identity-sensitive retrieval.<n>The results show substantial improvements in separating true matches from highly similar non-matches.
• Score: 0.0
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: General-purpose text embedding models are designed to capture semantic similarity but are not optimised for distinguishing entity records that represent the same real-world business or person. This limitation affects applications such as entity resolution and duplicate record retrieval, where small textual differences may either preserve or change identity. This paper investigates whether domain-specific triplet fine-tuning can adapt pretrained embedding models for identity-sensitive retrieval. A synthetic dataset of business and person records was created with identity-preserving variations and challenging non-matching examples. Two widely used embedding models were evaluated before and after fine-tuning using a margin-based similarity evaluation. The results show substantial improvements in separating true matches from highly similar non-matches, demonstrating that domain-specific triplet training can effectively reshape general-purpose embedding spaces for entity retrieval. These findings suggest that targeted fine-tuning provides a practical approach for improving embedding models in data quality management and information retrieval applications.

Related papers

• Adaptive Hopfield Network: Rethinking Similarities in Associative Memory [25.935774032106256]
  Associative memory models are content-addressable memory systems fundamental to biological intelligence.<n>We develop adaptive similarity, a novel mechanism that learns to approximate this insightful but unknown likelihood from samples.<n>We integrate this mechanism into a novel adaptive Hopfield network (A-Hop), and empirical results show that it achieves state-of-the-art performance across diverse tasks.
  arXiv  Detail & Related papers  (2025-11-25T18:36:47Z)
• RanLayNet: A Dataset for Document Layout Detection used for Domain Adaptation and Generalization [36.973388673687815]
  RanLayNet is a synthetic document dataset enriched with automatically assigned labels. We show that a deep layout identification model trained on our dataset exhibits enhanced performance compared to a model trained solely on actual documents.
  arXiv  Detail & Related papers  (2024-04-15T07:50:15Z)
• Order-preserving Consistency Regularization for Domain Adaptation and Generalization [45.64969000499267]
  Deep learning models fail on cross-domain challenges if the model is oversensitive to domain-specific attributes. We propose the Order-preserving Consistency Regularization (OCR) for cross-domain tasks.
  arXiv  Detail & Related papers  (2023-09-23T04:45:42Z)
• Domain-Expanded ASTE: Rethinking Generalization in Aspect Sentiment Triplet Extraction [67.54420015049732]
  Aspect Sentiment Triplet Extraction (ASTE) is a challenging task in sentiment analysis, aiming to provide fine-grained insights into human sentiments. Existing benchmarks are limited to two domains and do not evaluate model performance on unseen domains. We introduce a domain-expanded benchmark by annotating samples from diverse domains, enabling evaluation of models in both in-domain and out-of-domain settings.
  arXiv  Detail & Related papers  (2023-05-23T18:01:49Z)
• SALUDA: Surface-based Automotive Lidar Unsupervised Domain Adaptation [62.889835139583965]
  We introduce an unsupervised auxiliary task of learning an implicit underlying surface representation simultaneously on source and target data. As both domains share the same latent representation, the model is forced to accommodate discrepancies between the two sources of data. Our experiments demonstrate that our method achieves a better performance than the current state of the art, both in real-to-real and synthetic-to-real scenarios.
  arXiv  Detail & Related papers  (2023-04-06T17:36:23Z)
• Modular Domain Adaptation [31.073814047189742]
  Off-the-shelf models are widely used to measure text, such as sentiment. Without access to source data it is difficult to account for domain shift, which represents a threat to validity. We show how separate model producers and model consumers can cooperate to facilitate more accurate measurements of text.
  arXiv  Detail & Related papers  (2022-04-26T22:08:58Z)
• On Generalization in Coreference Resolution [66.05112218880907]
  We consolidate a set of 8 coreference resolution datasets targeting different domains to evaluate the off-the-shelf performance of models. We then mix three datasets for training; even though their domain, annotation guidelines, and metadata differ, we propose a method for jointly training a single model. We find that in a zero-shot setting, models trained on a single dataset transfer poorly while joint training yields improved overall performance.
  arXiv  Detail & Related papers  (2021-09-20T16:33:22Z)
• Revisiting Mahalanobis Distance for Transformer-Based Out-of-Domain Detection [60.88952532574564]
  This paper conducts a thorough comparison of out-of-domain intent detection methods. We evaluate multiple contextual encoders and methods, proven to be efficient, on three standard datasets for intent classification. Our main findings show that fine-tuning Transformer-based encoders on in-domain data leads to superior results.
  arXiv  Detail & Related papers  (2021-01-11T09:10:58Z)
• Few-Shot Named Entity Recognition: A Comprehensive Study [92.40991050806544]
  We investigate three schemes to improve the model generalization ability for few-shot settings. We perform empirical comparisons on 10 public NER datasets with various proportions of labeled data. We create new state-of-the-art results on both few-shot and training-free settings.
  arXiv  Detail & Related papers  (2020-12-29T23:43:16Z)
• Interpretable Entity Representations through Large-Scale Typing [61.4277527871572]
  We present an approach to creating entity representations that are human readable and achieve high performance out of the box. Our representations are vectors whose values correspond to posterior probabilities over fine-grained entity types. We show that it is possible to reduce the size of our type set in a learning-based way for particular domains.
  arXiv  Detail & Related papers  (2020-04-30T23:58:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.