Most existing methods for multimodal knowledge graph completion, or MMKGC, blend three kinds of information. Structural information encodes the topology of the graph itself, visual information draws on images associated with entities, and textual information draws on natural-language descriptions. The trouble, as a team of researchers led by Songjiang Li and Peng Wang at Changchun University of Science and Technology points out, is that nearly all current approaches quietly assume the text is always there. In reality, textual descriptions are frequently missing, particularly for rare, new, or obscure entities. When that happens, entity representations weaken and the carefully tuned machinery of modern completion models can wobble or collapse.

The researchers propose a framework called MMA-HNS, a missing-text-aware robustness extension of an earlier hierarchical negative sampling method known as DHNS. Negative sampling, the technique of generating plausible but false triples to train against, is notoriously sensitive to the quality of entity representations. If the textual modality vanishes for some entities, the multimodal conditions that hierarchical negative sampling depends on become unstable, and the model can waste capacity on poorly chosen negatives. MMA-HNS is designed to keep the whole pipeline steady even when a substantial fraction of entities have no text at all.

The first component is elegantly simple: a learnable missing-text token. Instead of dropping text-missing entities into a special processing branch, the model gives them a continuous proxy representation, a learned placeholder that stands in for the absent description. This preserves a unified multimodal pathway, so the rest of the architecture never has to special-case the missing entities. The token is trained end to end, meaning it can absorb whatever statistical regularities the model needs to compensate for the absent modality, from typical entity types to the kinds of relations such entities tend to participate in.

A learnable placeholder alone, however, is a blunt instrument. The second component, structure-guided retrieval, adds a more targeted form of compensation. For each entity lacking text, the system searches among structurally similar entities that do have complete descriptions and extracts candidate textual residuals, essentially textual hints drawn from graph neighbors. The key insight, and the key caution, is that structural similarity does not guarantee that the retrieved text is actually relevant to the query at hand. Two entities may sit in similar neighborhoods for entirely different reasons. The researchers therefore treat the retrieved information as potentially useful but uncertain auxiliary evidence rather than as a trustworthy substitute for the missing description.

That caution motivates the third and arguably most important component: a guarded hierarchical probabilistic semantic adaptive calibration strategy, abbreviated HPSAC. Rather than blindly trusting retrieval-enhanced predictions, HPSAC performs validation-guided, group-specific score calibration under explicit safety constraints. Groups of queries are calibrated only when validation evidence is sufficient, and a hierarchical fallback mechanism reverts to the uncalibrated prediction whenever the evidence is weak. In experiments on the MKG-Y dataset, for example, an average of about 59 of 86 calibration groups adopted non-default configurations while roughly 27 retained the conservative fallback, showing that the mechanism applies its adjustments selectively rather than indiscriminately rewriting scores across the board.

The evaluation design is unusually thorough for this field. The researchers constructed multiple controlled missingness scenarios: nested random missingness on the MKG-W benchmark, degree-dependent missingness on MKG-Y, where text was removed from the lowest-degree entities, and relation-dependent missingness on both datasets. Under nested random missingness on MKG-W, MMA-HNS improved the mean reciprocal rank, or MRR, over the DHNS baseline by 1.4, 1.5, and 1.9 percentage points at missing rates of 10, 30, and 50 percent respectively. Under 30 percent relation-dependent missingness, the gains were 1.87 percentage points on MKG-W and 0.35 on MKG-Y. The fact that improvements grow as missingness worsens suggests the framework is doing genuine work precisely where it is needed most.

Perhaps the most scientifically interesting findings come from the ablation analysis, which dissects which components actually drive performance. The team compared a representation-only baseline, retrieval added on top, and the full model with calibration. Strikingly, neither KNN-based retrieval nor random-neighbor retrieval alone consistently improved overall MRR over the baseline, even though the KNN retrieval demonstrably found structurally more relevant neighbors, with markedly higher top-k similarity and relation overlap than random sampling. The performance gains emerged only when the calibration layer was in place. Retrieval, in other words, is informative but noisy, and its value is unlocked by reliability-controlled calibration rather than by direct injection of retrieved features.

The study also probed generalization beyond the training distribution. Models trained with only 10 percent text missingness were evaluated at 30 and 50 percent test-time missingness. All methods degraded as the distribution shift grew, but the retrieval-enhanced variants consistently outperformed the missing-text-token-only model, and the full model achieved the best overall MRR in both cross-rate settings, exceeding the baseline by 2.04 and 3.27 percentage points respectively. Sensitivity analyses showed the calibration threshold had limited effect on results, while the effect of locking missing-text groups against calibration varied by dataset, supporting its role as a conservative safeguard. Seed-level paired t-tests confirmed the improvements were statistically significant at the 0.05 level.

Why does this matter beyond the benchmarks? Knowledge graphs underpin biomedical discovery, enterprise search, and the factual grounding of large language models, and in all of these domains textual descriptions are unevenly available. Long-tail entities, from rare chemicals to newly coined products, are exactly the ones most likely to lack rich descriptions and most likely to be involved in the missing links users care about. A framework that degrades gracefully, and even improves, as text disappears moves the field closer to systems that survive contact with messy real-world data. The authors have released their code, missing-text masks, and full seed-level results in a public repository, an openness that should make replication straightforward. The deeper lesson of the work may be its discipline: when auxiliary evidence is uncertain, the winning strategy is not to trust it more, but to build a safety net that decides, query by query, how much to believe.

Subject of Research: Robust multimodal knowledge graph completion when textual entity descriptions are missing

Article Title: Robust multimodal knowledge graph completion under missing text modality

Article References: Li, S., Li, S., Pan, J., Li, Y., & Wang, P. (2026). Robust multimodal knowledge graph completion under missing text modality. International Journal of Data Science and Analytics, 22(1), Article 338. https://doi.org/10.1007/s41060-026-01315-2

Image Credits: AI Generated

DOI: 10.1007/s41060-026-01315-2

Keywords: knowledge graphs, knowledge graph completion, multimodal learning, missing modality, negative sampling, retrieval-augmented learning, machine learning, link prediction, embeddings, score calibration, MMA-HNS, data science

The research, led by Ronghua Tian and Hong Yu of the Chongqing Key Laboratory of Computational Intelligence at Chongqing University of Posts and Telecommunications, together with Yaogang Geng and Xiaoling Wang of East China Normal University, addresses multimodal knowledge graph completion, abbreviated MMKGC. Unlike classical knowledge graph completion, which relies purely on symbolic triples, multimodal completion also exploits the rich information attached to entities in other forms: images, textual descriptions, and numerical attributes. A knowledge graph describing a famous painting might carry not only the fact that it was created by a particular artist but also a digital image of the canvas and a descriptive paragraph about its style. The premise of multimodal completion is that these additional signals can help a model infer missing links that the structure alone cannot reveal.

There is, however, a catch that the authors identify as a fundamental weakness in the field. Real-world multimodal knowledge graphs are profoundly uneven in how much information they provide for each entity. Some entities are lavishly documented, with high-resolution images and lengthy descriptions, while others may have only a name and a single relation. Existing methods, the paper argues, tend to overlook this imbalance of modal information among entities. The consequence is that models develop an overreliance on the dominant modality, typically the visual one when images are plentiful or the textual one when descriptions dominate. When a model leans too heavily on one channel, the weaker channels contribute little, and for entities whose strong modality is missing or uninformative, completion performance degrades sharply. The imbalance is not a marginal nuisance; it is baked into the structure of the data itself.

To confront this problem, the researchers propose a method called MI-MKGC, which attacks modality imbalance from two complementary directions. The first component is a relation knowledge-guided dynamic modal fusion module. The key insight here is that the type of relation connecting two entities carries prior knowledge about which modality is likely to matter most. Consider a relation such as has image or looks similar to: for these, visual features are clearly decisive. For a relation like was born in or is the author of, textual and structural information carries far more weight. Rather than fusing modalities with fixed weights that apply uniformly across all triples, MI-MKGC dynamically adjusts the weight assigned to each modality depending on the relational type between the entities involved. The relation acts as a guide, telling the fusion mechanism where to look before it decides how to blend the available signals.

This dynamic fusion stands in contrast to a long line of earlier approaches. Foundational embedding models such as TransE, which translated entities through relation-specific vectors in a continuous space, and ComplEx, which extended the idea into complex-valued spaces, established the template of learning purely from graph structure. Later systems incorporated literals and images, and more recent transformer-based architectures such as MEAformer and optimal-transport-based methods like OTKGE pushed multimodal fusion further. But in most of these designs, the fusion weights are either learned globally or computed without reference to the specific relation at hand. MI-MKGC’s use of relational types as priors for modality weighting represents a targeted response to the observation that different relations draw on different kinds of evidence, and that a one-size-fits-all fusion strategy systematically shortchanges entities whose informative modality happens to be the weaker one.

The second component of the method is a joint modality adversarial training module, which addresses the imbalance from the data side rather than the fusion side. Inspired by generative adversarial networks, a framework introduced by Goodfellow and colleagues in 2014, this module generates negative samples specifically designed to enhance weak modality information. In adversarial training, a generator produces challenging examples while a discriminator learns to distinguish them from genuine data, and the two improve in tandem. Here, the generator crafts negative triples that are hard to reject, with a particular focus on strengthening the representations of modalities that are underrepresented in the training signal. By forcing the model to grapple with adversarially constructed examples that probe its weak channels, the training process gradually amplifies the contribution of those channels, reducing the dominance of the strong modality and producing more balanced entity representations.

The choice of adversarial training is grounded in a substantial body of prior work. Wasserstein generative adversarial networks and their improved variants provided more stable training dynamics for generative models, and adversarial techniques have already been applied to knowledge graph settings, for instance in KBGAN, which used adversarially generated negative samples to sharpen knowledge graph embeddings, and in GAN-based approaches to text classification and information retrieval. MI-MKGC adapts this lineage to the specific problem of modality imbalance, using the adversarial game not merely to improve discrimination between true and false triples but to deliberately rebalance the informational diet of the model across modalities.

The empirical evaluation is notably thorough. The authors tested MI-MKGC on three public multimodal knowledge graph datasets against sixteen state-of-the-art baseline methods, spanning the range from purely structural embedding models to the latest multimodal fusion architectures. The results showed consistent advantages, with the most striking gain appearing in the Hit@1 metric, which measures the proportion of cases where the model’s top-ranked prediction is exactly correct. On this metric, MI-MKGC improved by up to 5.2 percent over the best existing compared method. In a field where incremental gains of fractions of a percent are common, an improvement of that magnitude on the strictest ranking metric is a meaningful advance, and it suggests that directly modeling modality imbalance, rather than treating it as background noise, unlocks performance that fusion tweaks alone cannot reach.

The practical implications extend well beyond benchmark datasets. Multimodal knowledge graphs underpin question answering systems that combine language models with structured knowledge, recommendation engines that blend product images with user behavior, and video captioning systems that must reconcile visual and textual evidence. In all of these applications, the entities involved vary enormously in how well documented they are, and a system that silently favors well-illustrated or well-described entities will perform unevenly across the long tail of less prominent items. By dynamically reweighting modalities according to relational context and actively training up weak channels through adversarial sampling, MI-MKGC offers a blueprint for more equitable and robust multimodal reasoning, particularly for the rare entities where completion is hardest and most valuable.

The team has released its implementation code publicly on GitHub, lowering the barrier for other researchers to build on the approach. The work was supported in part by the National Natural Science Foundation of China, and the authors report no conflicts of interest. As knowledge graphs continue to expand into multimodal territory, absorbing images, text, and structured facts at scale, the problem of imbalance will only grow more pronounced, since no curation process can guarantee uniform coverage across billions of entities. What this study demonstrates is that the solution lies not in richer data alone but in algorithms that recognize, at the level of individual relations and individual entities, which signals to trust and which to strengthen. In teaching models to listen to their quietest channels, the researchers may have pointed the way toward knowledge systems that are not only more accurate but fundamentally fairer in how they represent the world.

Subject of Research: Multimodal knowledge graph completion using relation-guided fusion and adversarial training to address imbalanced modality information

Article Title: Multimodal knowledge graph completion method for addressing imbalance of modal information

Article References: Tian, R., Yu, H., Geng, Y., & Wang, X. (2026). Multimodal knowledge graph completion method for addressing imbalance of modal information. Data Mining and Knowledge Discovery, 40(6), Article 106. https://doi.org/10.1007/s10618-026-01272-1

Image Credits: AI Generated

DOI: 10.1007/s10618-026-01272-1

Keywords: knowledge graph completion, multimodal learning, modality imbalance, adversarial training, knowledge graph embeddings, generative adversarial networks, link prediction, dynamic modal fusion, negative sampling, data mining, machine learning, representation learning