Pith. sign in

REVIEW 4 cited by

DiffusionCom: Structure-Aware Multimodal Diffusion Model for Multimodal Knowledge Graph Completion

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.06543 v1 pith:NAH7CO4M submitted 2025-04-09 cs.IR

DiffusionCom: Structure-Aware Multimodal Diffusion Model for Multimodal Knowledge Graph Completion

classification cs.IR
keywords diffusioncommultimodalmodelsdiscriminativeknowledgestructuralapproachesgenerative
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Most current MKGC approaches are predominantly based on discriminative models that maximize conditional likelihood. These approaches struggle to efficiently capture the complex connections in real-world knowledge graphs, thereby limiting their overall performance. To address this issue, we propose a structure-aware multimodal Diffusion model for multimodal knowledge graph Completion (DiffusionCom). DiffusionCom innovatively approaches the problem from the perspective of generative models, modeling the association between the $(head, relation)$ pair and candidate tail entities as their joint probability distribution $p((head, relation), (tail))$, and framing the MKGC task as a process of gradually generating the joint probability distribution from noise. Furthermore, to fully leverage the structural information in MKGs, we propose Structure-MKGformer, an adaptive and structure-aware multimodal knowledge representation learning method, as the encoder for DiffusionCom. Structure-MKGformer captures rich structural information through a multimodal graph attention network (MGAT) and adaptively fuses it with entity representations, thereby enhancing the structural awareness of these representations. This design effectively addresses the limitations of existing MKGC methods, particularly those based on multimodal pre-trained models, in utilizing structural information. DiffusionCom is trained using both generative and discriminative losses for the generator, while the feature extractor is optimized exclusively with discriminative loss. This dual approach allows DiffusionCom to harness the strengths of both generative and discriminative models. Extensive experiments on the FB15k-237-IMG and WN18-IMG datasets demonstrate that DiffusionCom outperforms state-of-the-art models.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Conditional Diffusion Guided Knowledge Transfer for Multi-Domain Knowledge Graph Completion

    cs.CL 2026-07 accept novelty 7.0

    Conditional diffusion generates unbiased domain-general entity embeddings from support KGs, lifting multi-domain KG completion by 4.3% average MRR over prior consistency methods.

  2. MGDT: MLLM-Guided Diffusion Transformer with Relation-Adaptive Mixture-of-Experts for Multimodal Knowledge Graph Completion

    cs.AI 2026-07 conditional novelty 6.0

    M2GDT, an align-then-diffuse framework with relation-adaptive routing, MLLM-anchored alignment, and a graph diffusion transformer, improves multimodal knowledge graph completion on MKG-W, MKG-Y, and DB15K over prior s...

  3. RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion

    cs.AI 2026-04 unverdicted novelty 6.0

    RADD decouples retrieval and reranking in multi-modal KGC via a relation-aware KGE retriever and conditional discrete denoiser, reporting state-of-the-art results on three benchmarks.

  4. RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion

    cs.AI 2026-04 conditional novelty 5.0

    A retrieve-then-rerank framework using a KGE shortlist and a discrete diffusion reranker reports SOTA MMKGC scores, but the diffusion mechanism is underspecified and not isolated from a generic reranker.