Principled Representation Learning for Entity Alignment

• URL: http://arxiv.org/abs/2110.10871v1
• Date: Thu, 21 Oct 2021 03:21:58 GMT
• Title: Principled Representation Learning for Entity Alignment
• Authors: Lingbing Guo, Zequn Sun, Mingyang Chen, Wei Hu, Qiang Zhang, Huajun Chen
• Abstract summary: We investigate the rationality of the assumption that a small number of pre-aligned entities can serve as anchors connecting the embedding spaces of two KGs. We propose a new approach, named NeoEA, to explicitly learn KG-invariant and principled entity embeddings. Our experiments demonstrate consistent and significant improvement in performance against the best-performing EEA methods.
• Score: 21.41091991132512
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Embedding-based entity alignment (EEA) has recently received great attention. Despite significant performance improvement, few efforts have been paid to facilitate understanding of EEA methods. Most existing studies rest on the assumption that a small number of pre-aligned entities can serve as anchors connecting the embedding spaces of two KGs. Nevertheless, no one investigates the rationality of such an assumption. To fill the research gap, we define a typical paradigm abstracted from existing EEA methods and analyze how the embedding discrepancy between two potentially aligned entities is implicitly bounded by a predefined margin in the scoring function. Further, we find that such a bound cannot guarantee to be tight enough for alignment learning. We mitigate this problem by proposing a new approach, named NeoEA, to explicitly learn KG-invariant and principled entity embeddings. In this sense, an EEA model not only pursues the closeness of aligned entities based on geometric distance, but also aligns the neural ontologies of two KGs by eliminating the discrepancy in embedding distribution and underlying ontology knowledge. Our experiments demonstrate consistent and significant improvement in performance against the best-performing EEA methods.

Related papers

• Attr-Int: A Simple and Effective Entity Alignment Framework for Heterogeneous Knowledge Graphs [9.725601872648566]
  Entity alignment (EA) refers to linking entities in different knowledge graphs (KGs) In this paper, we investigate and tackle the problem of entity alignment between heterogeneous KGs. We propose a simple and effective entity alignment framework called Attr-Int, in which innovative attribute information interaction methods can be seamlessly integrated with any embedding encoder.
  arXiv  Detail & Related papers  (2024-10-17T10:16:56Z)
• Rethinking State Disentanglement in Causal Reinforcement Learning [78.12976579620165]
  Causality provides rigorous theoretical support for ensuring that the underlying states can be uniquely recovered through identifiability. We revisit this research line and find that incorporating RL-specific context can reduce unnecessary assumptions in previous identifiability analyses for latent states. We propose a novel approach for general partially observable Markov Decision Processes (POMDPs) by replacing the complicated structural constraints in previous methods with two simple constraints for transition and reward preservation.
  arXiv  Detail & Related papers  (2024-08-24T06:49:13Z)
• Small Object Detection via Coarse-to-fine Proposal Generation and Imitation Learning [52.06176253457522]
  We propose a two-stage framework tailored for small object detection based on the Coarse-to-fine pipeline and Feature Imitation learning. CFINet achieves state-of-the-art performance on the large-scale small object detection benchmarks, SODA-D and SODA-A.
  arXiv  Detail & Related papers  (2023-08-18T13:13:09Z)
• Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learning [79.83792914684985]
  We prove a new identifiability result that provides conditions under which maximally sparse base-predictors yield disentangled representations. Motivated by this theoretical result, we propose a practical approach to learn disentangled representations based on a sparsity-promoting bi-level optimization problem.
  arXiv  Detail & Related papers  (2022-11-26T21:02:09Z)
• Rethinking Clustering-Based Pseudo-Labeling for Unsupervised Meta-Learning [146.11600461034746]
  Method for unsupervised meta-learning, CACTUs, is a clustering-based approach with pseudo-labeling. This approach is model-agnostic and can be combined with supervised algorithms to learn from unlabeled data. We prove that the core reason for this is lack of a clustering-friendly property in the embedding space.
  arXiv  Detail & Related papers  (2022-09-27T19:04:36Z)
• Deep Reinforcement Learning for Entity Alignment [25.78510840144251]
  We propose a reinforcement learning (RL)-based entity alignment framework. It can be flexibly adapted to most embedding-based entity alignment methods. It consistently advances the performance of several state-of-the-art methods, with a maximum improvement of 31.1% on Hits@1.
  arXiv  Detail & Related papers  (2022-03-07T11:49:40Z)
• Regularizing Variational Autoencoder with Diversity and Uncertainty Awareness [61.827054365139645]
  Variational Autoencoder (VAE) approximates the posterior of latent variables based on amortized variational inference. We propose an alternative model, DU-VAE, for learning a more Diverse and less Uncertain latent space.
  arXiv  Detail & Related papers  (2021-10-24T07:58:13Z)
• Artificial Intelligence Algorithms for Natural Language Processing and the Semantic Web Ontology Learning [0.76146285961466]
  A new evolutionary clustering algorithm star (ECA*) is proposed. Experiments were conducted to evaluate ECA* against five state-of-the-art approaches. The results indicate that ECA* overcomes its competitive techniques in terms of the ability to find the right clusters.
  arXiv  Detail & Related papers  (2021-08-31T11:57:41Z)
• A Low Rank Promoting Prior for Unsupervised Contrastive Learning [108.91406719395417]
  We construct a novel probabilistic graphical model that effectively incorporates the low rank promoting prior into the framework of contrastive learning. Our hypothesis explicitly requires that all the samples belonging to the same instance class lie on the same subspace with small dimension. Empirical evidences show that the proposed algorithm clearly surpasses the state-of-the-art approaches on multiple benchmarks.
  arXiv  Detail & Related papers  (2021-08-05T15:58:25Z)
• Reinforcement Learning based Collective Entity Alignment with Adaptive Features [35.04861875266298]
  We propose a reinforcement learning (RL) based model to align entities collectively. Under the RL framework, we devise the coherence and exclusiveness constraints to characterize the interdependence and collective alignment. Our proposal is evaluated on both cross-lingual and mono-lingual EA benchmarks and compared against state-of-the-art solutions.
  arXiv  Detail & Related papers  (2021-01-05T05:04:09Z)

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.