Proceedings Article10.1145/3503161.3548388
Relation-enhanced Negative Sampling for Multimodal Knowledge Graph Completion
Derong Xu,Dongming Xu,Shiwei Wu,Jingbo Zhou,Enhong Chen +4 more
- 10 Oct 2022
40
TL;DR: A novel knowledge-guided cross-modal attention mechanism, which provides bi-directional attention for visual & textual features via integrating relation embedding, and an effective contrastive semantic sampler is devised after consolidating the KCA mechanism with contrastive learning.
read more
Abstract: Knowledge Graph Completion (KGC), aiming to infer the missing part of Knowledge Graphs (KGs), has long been treated as a crucial task to support downstream applications of KGs, especially for the multimodal KGs (MKGs) which suffer the incomplete relations due to the insufficient accumulation of multimodal corpus. Though a few research attentions have been paid to the completion task of MKGs, there is still a lack of specially designed negative sampling strategies tailored to MKGs. Meanwhile, though effective negative sampling strategies have been widely regarded as a crucial solution for KGC to alleviate the vanishing gradient problem, we realize that, there is a unique challenge for negative sampling in MKGs about how to model the effect of KG relations during learning the complementary semantics among multiple modalities as an extra context. In this case, traditional negative sampling techniques which only consider the structural knowledge may fail to deal with the multimodal KGC task. To that end, in this paper, we propose a MultiModal Relation-enhanced Negative Sampling (MMRNS) framework for multimodal KGC task. Especially, we design a novel knowledge-guided cross-modal attention (KCA) mechanism, which provides bi-directional attention for visual & textual features via integrating relation embedding. Then, an effective contrastive semantic sampler is devised after consolidating the KCA mechanism with contrastive learning. In this way, a more similar representation of semantic features between positive samples, as well as a more diverse representation between negative samples under different relations could be learned. Afterwards, a masked gumbel-softmax optimization mechanism is utilized for solving the non-differentiability of sampling process, which provides effective parameter optimization compared with traditional sample strategies. Extensive experiments on three multimodal KGs demonstrate that our MMRNS framework could significantly outperform the state-of-the-art baseline methods, which validates the effectiveness of relation guides in multimodal KGC task.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Peer Review
A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multimodal
Kenny Ye Liang,Lingyuan Meng,Meng Liu,Yue Li,Wenxuan Tu,Siwen Wang,Sihang Zhou,Xinwang Liu,Fu Sun +8 more
- 12 Dec 2022
TL;DR: Knowledge graph reasoning (KG) as discussed by the authors aims to deduce new facts from existing facts based on mined logic rules underlying knowledge graphs (KGs), which has become a fast-growing research direction.
A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multi-Modal
Ke Liang,Lingyuan Meng,Meng Li,Yue Liu,Wenxuan Tu,Siwei Wang,Sihang Zhou,Xinwang Liu,Fuchun Sun,Kunlun He +9 more
Knowledge Graph Contrastive Learning Based on Relation-Symmetrical Structure
TL;DR: Zhang et al. as discussed by the authors proposed a knowledge graph contrastive learning framework based on relation-symmetrical structure, which mines symmetrical structure information in KGs to enhance the discriminative ability of KGE models.
•Posted Content
Survey and Open Problems in Privacy Preserving Knowledge Graph: Merging, Query, Representation, Completion and Applications.
TL;DR: The open problems for privacy preserving KG in data isolation setting are summarized from four aspects, i.e., merging, query, representation, and completion, and possible solutions for them are proposed.
23
Evolving to multi-modal knowledge graphs for engineering design: state-of-the-art and future challenges
Xinyu Pan,Xinyu Li,Qi Li,Zhiqiang Hu,Jinsong Bao +4 more
TL;DR: This study reviews 163 papers on Multi-Modal Knowledge Graphs (MMKG) for engineering design, summarizing state-of-the-art techniques for knowledge extraction, fusion, and applications, while identifying challenges and future development potentials for MMKG-enhanced design processes.
11
References
•Proceedings Article
Adam: A Method for Stochastic Optimization
Diederik P. Kingma,Jimmy Ba +1 more
- 01 Jan 2015
TL;DR: This work introduces Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments, and provides a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework.
138.5K
•Posted Content
A Simple Framework for Contrastive Learning of Visual Representations
TL;DR: It is shown that composition of data augmentations plays a critical role in defining effective predictive tasks, and introducing a learnable nonlinear transformation between the representation and the contrastive loss substantially improves the quality of the learned representations, and contrastive learning benefits from larger batch sizes and more training steps compared to supervised learning.
Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks
Nils Reimers,Iryna Gurevych +1 more
- 14 Aug 2019
TL;DR: Sentence-BERT (SBERT), a modification of the pretrained BERT network that use siamese and triplet network structures to derive semantically meaningful sentence embeddings that can be compared using cosine-similarity is presented.
•Proceedings Article
Translating Embeddings for Modeling Multi-relational Data
Antoine Bordes,Nicolas Usunier,Alberto Garcia-Duran,Jason Weston,Oksana Yakhnenko +4 more
- 05 Dec 2013
TL;DR: TransE is proposed, a method which models relationships by interpreting them as translations operating on the low-dimensional embeddings of the entities, which proves to be powerful since extensive experiments show that TransE significantly outperforms state-of-the-art methods in link prediction on two knowledge bases.
•Proceedings Article
Policy Gradient Methods for Reinforcement Learning with Function Approximation
Richard S. Sutton,David McAllester,Satinder Singh,Yishay Mansour +3 more
- 29 Nov 1999
TL;DR: This paper proves for the first time that a version of policy iteration with arbitrary differentiable function approximation is convergent to a locally optimal policy.