Learning with Dual-level Noisy Correspondence for Multi-modal Entity Alignment
Haobin Li, Yijie Lin, Peng Hu, Mouxing Yang, Xi Peng
Abstract
Multi-modal entity alignment (MMEA) aims to identify equivalent entities across heterogeneous multi-modal knowledge graphs (MMKGs), where each entity is described by attributes from various modalities. Existing methods typically assume that both intra-entity and inter-graph correspondences are faultless, which is often violated in real-world MMKGs due to the reliance on expert annotations. In this paper, we reveal and study a highly practical yet under-explored problem in MMEA, termed Dual-level Noisy Correspondence (DNC). DNC refers to misalignments in both intra-entity (entity-attribute) and inter-graph (entity-entity and attribute-attribute) correspondences. To address the DNC problem, we propose a robust MMEA framework termed RULE. RULE first estimates the reliability of both intra-entity and inter-graph correspondences via a dedicated two-fold principle. Leveraging the estimated reliabilities, RULE mitigates the negative impact of intra-entity noise during attribute fusion and prevents overfitting to noisy inter-graph correspondences during inter-graph discrepancy elimination. Beyond the training-time designs, RULE further incorporates a correspondence reasoning module that uncovers the underlying attribute-attribute connection across graphs, guaranteeing more accurate equivalent entity identification. Extensive experiments on five benchmarks verify the effectiveness of our method against DNC compared with seven state-of-the-art methods. Code is available at https://github.com/XLearning-SCU/2026-ICLR-RULE.
Proposes framework to handle noisy entity-attribute and inter-graph correspondences in multi-modal entity alignment.
- Identifies and studies dual-level noisy correspondence problem in multi-modal entity alignment
- Estimates reliability of intra-entity and inter-graph correspondences using dedicated two-fold principle
- Incorporates correspondence reasoning module to uncover attribute connections across graphs
- Demonstrates effectiveness across five benchmarks against seven state-of-the-art methods
- Entity alignment
- Knowledge graphs
- Attribute fusion
Authors did not state explicit limitations.
Authors did not state explicit future directions.
Author keywords
- Noisy correspondence; Multi-modal entity alignment.
Related orals
One for Two: A Unified Framework for Imbalanced Graph Classification via Dynamic Balanced Prototype
Unified framework for imbalanced graph classification using dynamic balanced prototypes and prototype load-balancing optimization.
Compactness and Consistency: A Conjoint Framework for Deep Graph Clustering
CoCo framework captures compactness and consistency in graph neural network representations for improved deep graph clustering.
Multi-Domain Riemannian Graph Gluing for Building Graph Foundation Models
GraphGlue uses Riemannian geometry to merge multi-domain graphs into unified manifolds, enabling knowledge transfer across graph domains.
Exchangeability of GNN Representations with Applications to Graph Retrieval
Graph embeddings exhibit exchangeability property, enabling efficient graph retrieval via transport-based similarity approximation with locality-sensitive hashing.
Scaling Laws and Spectra of Shallow Neural Networks in the Feature Learning Regime
Analyzes scaling laws for shallow networks with feature learning via sparse estimation and matrix compression theory.