Adaptive Confidence-weighted Expansion for Trustworthy Multi-Omics Multimodal Fusion

Ali Sekhavati
Alireza Maleki

, Hamid Nasiri


Abstract

Multimodal learning is a robust approach to improve predictive performance in applications such as medical prognosis. However, the clinical applicability of models that use multimodal learning is hampered by their poor performance under noisy or uninformative data streams. Present fusion approaches often lack robust mechanisms for the dynamic assessment of data quality and for the provision of a trustable confidence score on the final prediction. This dissuades their deployment in safety-critical settings. To address these limitations, we introduce Adaptive Confidence-weighted Expansion (ACE), a novel framework to enhance the trustworthiness of multimodal fusion models. ACE first enhances the multimodal space by generating new, complementary modalities from intra-modality correlations. It then employs a dual-level confidence mechanism that (1) adaptively reweighs all modalities by their reliability before fusion and (2) estimates a global trust score over the fused, final decision. To evaluate ACE, we used four challenging multi-omics datasets (BRCA, KIPAN, LGG, and ROSMAP). ACE significantly outperforms existing state-of-the-art algorithms in both classification performance and confidence calibration. Our framework provides a more stable and robust data fusion method that facilitates the use of multimodal learning in addressing high-stakes problems.

1 Introduction↩︎

Multimodal learning integrates heterogeneous data sources, which enables models to leverage complementary information between modalities and boost predictive performance [1]. Multimodal approaches integrate different modalities into a unified representation using neural networks [2]. Many studies have integrated heterogeneous data sources, including imaging, genomic, and clinical data —to improve predictive accuracy. For instance, Huang et al. [3] combined radiomic and genomic features for glioma grading, achieving a 6% improvement in AUC compared to prior studies, while Chaudhary et al. [4] integrated transcriptomic and clinical data for liver cancer survival prediction, demonstrating the potential of multimodal learning in biomedical prognosis. However, current multimodal learning tools face limitations [5]. Existing fusion strategies struggle to assess data accuracy and to produce confidence scores for final predictions. As a result, the deployment of multimodal models is limited in safety-critical scenarios such as computer-aided diagnosis. More reliable fusion tools are needed to safely leverage multimodal learning in these settings.

Several barriers exist to the use of multimodal fusion in medical contexts, including a lack of dynamic assessment tools, a focus on image-based analysis, and the quality of the training data. Traditional multimodal fusion methods aim to obtain a joint representation by concatenating features or designing specific neural architectures. Early fusion integrates modalities directly at the data level [6], intermediate fusion combines modality-specific features through dedicated network layers [7], [8], and decision-level fusion aggregates outputs based on predictive uncertainty [9], [10]. While effective, these approaches struggle to dynamically evaluate the informativeness of features and modalities across different samples, which is essential for trustworthy multimodal classification [11]. Additionally, multimodal learning is typically deployed to assess both images and clinical data. However, little research exists on the use of multimodal learning that does not incorporate imaging. Finally, in medical datasets, uninformative features and noisy modalities are common [12], [13]. These challenges further highlight the need for robust fusion strategies.

To improve fusion stability and explainability, Han et al. [11] proposed Multimodal Dynamics (MM-Dynamics), which jointly models feature-level and modality-level informativeness. Their approach introduces sparse gating to dynamically select informative features and employs true-class probability to capture modality confidence. Extensive experiments on multiple medical classification datasets demonstrated the superiority of MM-Dynamics compared with state-of-the-art methods [7][9], [14]. Although MM-Dynamics represents a significant advancement in multimodal learning, several challenges remain. First, the framework directly relies on the original set of modalities without exploring intra-modality correlations that could enrich representations. Second, while modality confidence is modeled, the framework does not adaptively reweight modality contributions, limiting robustness under uncertain conditions. Third, although the method estimates modality-aware confidence, it does not introduce model-level (global) predictive certainty, leaving end-to-end reliability under-specified . In this paper, we propose Adaptive Confidence-weighted Expansion (ACE), a novel multimodal fusion framework that extends and improves MM-Dynamics by addressing these limitations. Our contributions are as follows:

  1. Correlation-based modality expansion: For datasets with n original modalities (e.g., BRCA [15] and ROSMAP [16]), we generate additional derived modalities by computing intra-modality correlations and applying dot-product transformations with their correlated versions. This process yields 2n modalities derived from the original n, thereby enriching the multimodal feature space and enhancing the overall representation capacity.

  2. Confidence-weighted fusion: At the final fusion stage, where per-view confidence loss is calculated, we introduce an adaptive weighting mechanism. Low-confidence modalities are penalized, while reliable modalities are emphasized, leading to more trustworthy fusion.

  3. Global TCP for fused trust estimation: ACE adds a single global TCP head on the post-fusion representation with the goal of estimating the confidence of the final decision. Trained to predict the fused models true-class probability, this head provides a calibrated sample-level trust signal that captures cross-modal agreement/conflict after fusion, and stabilizes training—especially when individual modalities are noisy or partially missing.

  4. Comprehensive evaluation: We conduct experiments on BRCA [15], ROSMAP [16], KIPAN [14] and LGG [17] datasets, showing that ACE consistently outperforms MM-Dynamics and other state-of-the-art methods in terms of accuracy, stability, and reliability.

2 Literature Review↩︎

The increased application of deep learning (DL) methods in healthcare has ushered in new possibilities for clinical prognostication and disease classification. Traditionally, prognostication using clinical data involves statistical models, which often struggle to efficiently capture high-dimensional non-linear interactions. With the advent of DL architectures, researchers can leverage vast amounts of clinical information to predict disease progression with greater accuracy.

Many DL models for diagnosis and prognosis use medical imaging data, and the use of DL to evaluate images has shown promising results in diagnosing illnesses such as breast cancer.[18] However, deep learning on clinical (non-image) data is increasingly outperforming traditional statistical models of prognosis. Although multimodal fusion (imaging + genomics + clinical) generally boosts accuracy, a focused body of evidence shows that even unimodal clinical deep models can surpass conventional methods; an important practical consideration when imaging is unavailable or cost-prohibitive.

At the same time, the literature exhibits notable gaps. Much of the available evidence concentrates on multimodal pipelines. Leaving relatively few studies that evaluate ANN, CNN, and RNN architectures using strictly clinical features. These gaps in the existing literature point toward a need for clearer benchmarks: curation and standardization of high-quality, clinical datasets; and transparent reporting of preprocessing, hyperparameters, and training setups to ensure reproducibility. There is a need for methods that exploit clinical signals effectively while remaining robust, interpretable, and evaluation-ready. Recent advancements in precision oncology have emphasized the critical role of classifying cancer into molecular subtypes, as this classification significantly influences early diagnosis and the development of targeted therapies [19]. Accurate identification of these subtypes is essential, and numerous methodologies have been proposed over the past decades to leverage multi-omics data for cancer classification tasks [20].

Data-driven approaches have shown substantial advantages across various domains by utilizing the robust feature extraction capabilities of deep neural networks [21][23]. In the context of multi-omics data integration, existing models predominantly adopt either early fusion or late fusion strategies. Early fusion methods concatenate multi-omics data before feeding them into a deep neural network for feature extraction. In contrast, late fusion approaches involve independent feature extraction from each omic type, followed by the integration of these features for final classification. Given that multiomics data can be treated as multi-modal data, various multi-modal learning models have been introduced for their interpretation, often outperforming single-omics approaches [14], [24]. A fundamental challenge in multi-modal learning is effectively fusing complementary information from different modalities.

Feature-level fusion techniques integrate raw data or extracted features through operations such as concatenation or summation [25]. However, these methods may struggle with heterogeneous or inconsistently scaled data. Decision-level fusion strategies, on the other hand, combine predicted labels from each modality to reach a final decision [14]. More recently, multi-level fusion approaches have been proposed, which combine both feature- and decision-level information to capture low-level and high-level modality characteristics simultaneously [2].

With increasing awareness of data and modality uncertainty, the focus has shifted toward trustworthy multi-modal learning. To address this, Han et al. [11] introduced a dynamic fusion network that incorporates sparse gating to capture within-modality variation and leverages class probability to evaluate modality-wise classification confidence. Similarly, Wang et al. proposed MOGONET, a novel multi-omics integration framework that employs a View Correlation Discovery Network (VCDN) to explore both omics-specific and cross-omics correlations for more effective biomedical classification [14], [26]. Rather than fusing low-level features, MOGONET utilizes VCDN to discover higher-level inter- and intra-modality relationships in the label space to achieve robust classification outcomes.

Further extending the notion of trustworthy learning, Ma et al. [27] proposed the Mixture of Normal-Inverse Gamma (MoNIG) model, which estimates uncertainty in modality data to guide adaptive integration and yield reliable regression results. Han et al. [9], [11], building on Dempster–Shafer theory, introduced a variational Dirichlet framework that characterizes class probability distributions and integrates different modalities at the evidence level, thus ensuring both robustness and reliability against noisy or incomplete data.

Graph-based learning approaches have also been increasingly adopted to exploit the structural properties inherent in omics data. Unlike traditional Euclidean-based methods, Graph Convolutional Networks (GCNs) operate on graph-structured data, where each node represents a sample and edges capture meaningful relationships. Ramirez et al. incorporated intra-omic, protein–protein interaction, and gene co-expression networks into a GCN framework for enhanced feature aggregation [28]. Nevertheless, standard GCNs often capture only local neighborhood information. To address this limitation, Li et al. introduced a parallel GCN model that integrates gene-based prior knowledge graphs for cancer subtype classification [20]. Additionally, Wang et al. developed a GCNbased model that constructs a cell–cell similarity graph using K-Nearest Neighbors (KNN) to classify single-cell sequencing data [21].

Despite significant progress, several challenges persist in multi-omics data classification. The high rate of missing values in multi-omics datasets can distort final feature representations if not properly handled. Also, most deep multimodal learning frameworks rely on simple modality-wise fusion strategies which may not fully exploit the intricate cross-modal relationships within samples. Finally, contrastive learning-based methods often focus solely on aligning sample-level positive and negative pairs while overlooking the underlying cluster structures among different samples.

To address these challenges, we propose a novel framework, ACE, which integrates feature informativeness, modality certainty, and cross-modal sample relationships to produce a more representative and consensus-based embedding for final classification.

3 Methodology↩︎

3.1 Network Architecture↩︎

The proposed ACE framework extends the MM-Dynamics architecture [11] by introducing correlation-based modality expansion, confidence-weighted fusion, a global confidence estimation module, and an input reconstruction layer. The architecture consists of four major components: (1) feature encoding with feature-level gating, (2) modality-specific classification and confidence estimation, (3) confidence-weighted fusion, and (4) global TCP. An overview is illustrated in Figure 1.

Figure 1: Framework of ACE multimodal dynamics. We use a two-modality case for better illustration. The proposed method is mainly composed of the following steps. I. Calculation of correlation, II. Adding the generated views to data, III. Feature Informativeness Estimation, IV. Modality specific classifier, V. Adjusting weighting including the Loss Function and Input Reconstruction, VI. Concatenating Modalities, VII. Global TCP

3.1.1 Summary of Architecture:↩︎

The datasets considered in this study include BRCA (breast cancer), LGG (lowgrade glioma), KIPAN (kidney cancers), and ROSMAP, which comprises longitudinal clinical and cognitive data related to aging and Alzheimer’s disease. To perform classification within BRCA, ROSMAP, KIPAN, and LGG datasets, we adopted a multi-view representation learning approach. For each modality, we first constructed an additional view by computing the Pearson correlation matrix of the features and multiplying it with the corresponding input representation. This step enriched the data by emphasizing inter-feature relationships and provided complementary structural information before model training. To mitigate the issue of insufficient data within the different datasets, we introduced noise and performed input reconstruction on each dataset. The resulting expanded set of views was then fed into a multi-view neural architecture.

In ACE, each view passes through a dedicated encoder that applies feature-level attention, nonlinear transformations, and dropout-based corruption to encourage robust feature learning. Each view is paired with a TCP module, which simultaneously produces class logits and a confidence estimate. These confidence scores serve two purposes: (i) they are used for adaptive weighting, reducing the influence of unreliable views in the loss function, and (ii) they guide feature scaling during fusion. The encoded features from all views are concatenated to form a joint representation, which is fed into a shared classifier for the final prediction. Importantly, this fused representation is also passed through a global TCP layer, providing a data-level confidence estimate for the overall prediction.

3.1.2 Correlation:↩︎

In high-dimensional biological datasets such as gene expression or DNA methylation, features often exhibit complex co-expression patterns . Encoding this structure can help the model better understand intra-modality dependencies. To capture the internal structure of each modality and enhance the representation of individual features, we applied a correlation-based transformation to the input data. For each modality \(X_i\), we computed the pairwise Pearson correlation matrix \(C_i\) using the training samples. This matrix reflects the degree of linear association between features within the same modality.

Let \(X_i \in \mathbb{R}^{n \times d}\) denote the training data matrix for modality \(i\), where \(n\) is the number of samples and \(d\) is the number of features. We transformed the original features by computing the dot product of the input features with their corresponding correlation matrix:

\[X_i' = X_i \cdot corr(X_i) ,\]

This transformation can be interpreted as a projection of each sample into a space where each feature is re-expressed as a weighted combination of all other features within the same modality, with weights reflecting their pairwise correlations. The objective is to emphasize consistently co-expressed features and reduce the influence of noisy or weakly informative dimensions.

This operation was applied to both the training and test sets. The correlation matrix \(C_i\) was computed exclusively from the training data to avoid information leakage.

Figure 2 illustrates the correlation-based transformation process. As shown in the figure, the pipeline consists of two main steps: (1) calculating the correlation matrix from the training data, and (2) applying the dot product to generate the transformed modalities. This visual representation highlights how the transformation encodes intra-modality dependencies before feeding the data into subsequent modeling stages.

Figure 2: Illustration of Correlation-driven Modality Augmentation.

3.1.3 Noise-Invariant Gating and Encoding:↩︎

To enhance robustness against noise and missing values, each modality input \(X_i\) is deliberately corrupted during training using dropout and additive Gaussian perturbations: \[\tilde{X}_i = \text{Dropout}(X_i, p) + \epsilon, \quad \epsilon \sim \mathcal{N}(0, \alpha^2) ,\] where: \[\hat{X} = \left[ X_1, X_2, \dots, X_M, X_1', X_2', \dots, X_M' \right] ,\] This corruption step encourages the model to learn stable, noise-invariant representations.

Next, a feature-level gating mechanism estimates the relative importance of each feature dimension through a learned sigmoid transformation: \[G_i = \sigma(W_i \tilde{X}_i), \quad Z_i = \tilde{X}_i \odot G_i,\] where \(W_i\) is a trainable projection, \(\sigma(\cdot)\) denotes the sigmoid function, and \(\odot\) the elementwise product. This operation suppresses uninformative or noisy features while preserving salient ones.

The gated features \(Z_i\) are then passed through a modality-specific encoder network \(f_i(\cdot)\): \[h_i = f_i(Z_i), \quad h_i \in \mathbb{R}^{n \times d_h},\] implemented as a fully connected layer with batch normalization, ReLU activations, and dropout.

The resulting latent representations serve as the basis for downstream tasks, including classification, confidence estimation, and reconstruction (detailed in the following subsection). This design ensures that the encoder outputs are both noise-robust and information-preserving across modalities.

3.1.4 Input Reconstruction as Self-Supervised Regularization:↩︎

Deep neural networks trained on limited or imbalanced biological datasets are prone to overfitting. To mitigate this issue, we drew inspiration from recent advances in self-supervised learning, where recovering masked or corrupted inputs has been shown to improve generalization.

In our framework, the corrupted modality inputs \(\tilde{X}_i\) (described in the previous subsection) are passed through a modality-specific encoder–decoder pathway. The encoder produces a latent representation \(h_i = f_{\phi}(\tilde{X}_i)\), and the decoder attempts to reconstruct the original input \(X^{(r)}_i = g_{\theta}(h_i)\). The reconstruction objective is defined as: \[\mathcal{L}_{\text{rec}, i} = \lambda_{\text{rec}} \cdot \| X_i - X^{(r)}_i \|_2^2 ,\]

This reconstruction loss, combined with the classification and confidence calibration objectives, acts as a self-supervised regularizer. It compels the encoder to retain modality-specific structure under corruption, thereby reducing sensitivity to noise or missing values and improving the stability and generalization of multimodal representations.

3.1.5 Adaptive weighting:↩︎

In multimodal learning, different modalities often exhibit varying levels of reliability due to noise, missing values, or modality-specific biases. A naive aggregation that treats all modalities equally may therefore propagate uncertainty from weaker modalities, ultimately degrading predictive performance. To address this challenge, we introduce an adaptive weighting scheme that dynamically adjusts each modality’s contribution to the loss function based on its confidence.

For each modality \(i\), let \(z_i\) denote the classification logits, and let \(\alpha_i \in \mathbb{R}\) represent its scalar confidence score predicted by a modality-specific confidence layer. The per-modality classification loss is then reweighted according to its confidence: \[\mathcal{L}_{\text{aw}, i} =\lambda_{\text{aw}} \cdot \sigma (\alpha_i) \cdot \text{CE}(z_i, y),\] where \(\text{CE}(\cdot)\) shows the cross-entropy loss and \(\sigma (\alpha_i)\) represents a normalized weight for modality \(i\).

The overall adaptive loss across all modalities is defined as: \[\mathcal{L}_{\text{adaptive}} = \frac{1}{m} \sum_{i=1}^{m} \mathcal{L}_{\text{aw}, i},\] with \(m\) denoting the number of modalities.

This formulation ensures that modalities with higher predicted confidence contribute more strongly to the optimization, while uncertain modalities are down-weighted. By allowing the model to learn these weights dynamically during training, the framework achieves a better balance between leveraging strong modalities and mitigating the effect of noisy or unreliable ones.

3.1.6 Modality-Specific TCP:↩︎

Following MM-Dynamics [11], each encoded modality representation \(h_i\) is passed through a modality-specific Trustworthy Calibration Prediction (TCP) module. This module consists of two parallel heads: a classification head and a confidence head.

The classification head is a fully connected layer that maps the encoded features to class logits: \[z_i = W_i^{(\text{cls})} h_i + b_i^{(\text{cls})}, \quad p_i = \text{softmax}(z_i), \quad p_i \in \mathbb{R}^{n \times c},\] where \(c\) is the number of classes and \(p_i\) denotes the calibrated prediction for modality \(M_i\).

The confidence head is a separate linear layer which outputs a scalar confidence score for each sample: \[\alpha_i = \sigma\!\left(W_i^{(\text{conf})} h_i + b_i^{(\text{conf})}\right), \quad \alpha_i \in [0,1]^{n \times 1} ,\] where \(\alpha_i\) reflects the reliability of the modality’s prediction.

After that, the encoded modality representation is then reweighted by its confidence before multimodal fusion: \[\hat{h}_i = \alpha_i \odot h_i ,\]

Thus, each modality contributes both a calibrated class prediction \(p_i\) and a confidence-weighted feature \(\hat{h}_i\) to the subsequent fusion stage.

3.1.7 Global TCP:↩︎

The confidence-weighted representations from all modalities, \(\{\hat{h}_i\}_{i=1}^m\), are concatenated into a joint feature vector \(H\), which is processed by a shared multilayer perceptron to obtain a fused embedding \(u\). This embedding serves as the basis for the final prediction.

To explicitly model uncertainty after fusion, we introduce a Global TCP module. Unlike modality-specific TCPs, which provide per-modality predictions and confidence estimates, the global TCP operates on the fused embedding \(u\) and produces:

\[\begin{gather} p_{\text{global}} = \text{softmax}\!\left(W^{(\text{cls})} u + b^{(\text{cls})}\right), \alpha_{\text{global}} = \sigma\!\left(W^{(\text{conf})} u + b^{(\text{conf})}\right) \end{gather}\]

where \(p_{global} \in \mathbb{R}^{n \times c}\) is the final multimodal prediction and \(\alpha_{global} \in [0,1]^{n \times 1}\) is the associated global confidence score.

This design provides two complementary benefits: (1) modality-specific TCPs ensure that each input stream contributes with calibrated reliability, and (2) the global TCP captures residual uncertainty that emerges only after cross-modal fusion. Together, these mechanisms enable both fine-grained (per-modality) and holistic (global) confidence estimation, which is critical for trustworthy multimodal decision-making.

3.1.8 Loss Function:↩︎

The total training loss integrates multimodal classification, modality-specific classification and confidence calibration (TCP), input reconstruction, adaptive weighting and feature sparsity.

Let \(p_{global}\) denote the global logits and \(\alpha_{global}\) the global confidence score. The global classification loss is: \[\mathcal{L}_{\text{cls}} = \frac{1}{n} \sum_{j=1}^{n} \text{CE}\left( p_{\text{global}_j}, y_j \right),\]

where \(n\) is the minibatch size. The global TCP loss is \[\mathcal{L}_{\text{tcp-global}} = \lambda_{\text{tcp-g}} \cdot \frac{1}{n} \sum_{j=1}^{n} \big\| \alpha_{\text{global}_j} - p_{\text{pred}_j} \big\|_2^2,\] where \(p_{\text{pred}_j}\) is the predicted probability of the correct class. The combined global loss is \[\mathcal{L}_{\text{global}} = \mathcal{L}_{\text{cls}} + \mathcal{L}_{\text{tcp-global}} ,\]

For each modality \(i\), with logits \(z^{(i)}\) and confidence \(c^{(i)}\), the classification and calibration loss is \[\mathcal{L}_{\text{tcp},i} = \lambda_{\text{tcp}} \cdot \Big( \text{CE}(z^{(i)}, y) + \| c^{(i)} - p_{\text{pred}} \|_2^2 \Big),\]

To encourage compact representations, the mean of the gating outputs \(G_i\) is penalized: \[\mathcal{L}_{\text{feat},i} = \lambda_{\text{feat}} \cdot \frac{1}{d} \sum_{k=1}^{d} G_{i,k} ,\] where \(k\) indicates the feature dimensions of modality \(i\). Finally, the full training objective is \[\mathcal{L}_{\text{total}} = \mathcal{L}_{\text{global}} + \sum_{i=1}^{m} \Big( \mathcal{L}_{\text{tcp},i} + \mathcal{L}_{\text{rec}, i} + \mathcal{L}_{\text{aw}, i} + \mathcal{L}_{\text{feat},i} \Big) ,\]

4 Experiments and Results↩︎

In this section, we compare the proposed ACE model with several state-of-the-art classification methods on four real-world multimodal datasets. Extensive experimental results demonstrate the superior performance of our approach relative to existing methods. Additionally, we conduct ablation studies to assess the contribution of individual components within the proposed network. All experiments were conducted on a Linux workstation running Ubuntu 20.04.1, equipped with four NVIDIA GeForce RTX 3080 Ti and an Intel Xeon Gold 6254 CPU (3.10 GHz).

We compared five representative multimodal learning methods—MOGONET [14], TMC [9], CF [7], GMU [8], and Dynamics[11]. MOGONET leverages a Graph Convolutional Network together with a View Correlation Discovery Network to model inter-omics dependencies for classification. TMC performs decision-level fusion by weighting modality-specific predictors according to their estimated confidence. CF implements late fusion by concatenating high-level, modality-specific representations prior to the final classifier. GMU constructs an intermediate joint representation that adaptively combines modalities (via a gated multimodal unit), enabling cross-modal information flow. Finally, MM-Dynamics adopts a dynamic fusion scheme that evaluates both feature-level and modality-level relevance to integrate multimodal evidence. To evaluate the performance of the compared methods, we employ different metrics depending on the classification task. For binary classification datasets, we report accuracy (ACC), \(F_1\)-score (\(F_1\)), and the area under the ROC curve (AUC). For multi-class classification datasets, we use accuracy (ACC), weighted \(F_1\)-score (\(F_1\) weighted), and macro-averaged \(F_1\)-score (\(F_1\) macro). Following prior work [11], [14], each dataset is randomly split into training and testing sets, and experiments are repeated 20 times to mitigate the effects of partition bias. We report the average performance and standard deviation across these runs. Network training is performed using the Adam optimizer with learning rate decay. Each experiment is run for 1200 epochs, after which testing results are recorded. The comparison results are shown in Table  1.

Table 1: Comparison with state-of-the-art methods on multi-omics classification. Bold value indicates the best performance.
Method BRCA KIPAN LGG ROSMAP
2-4 (lr)5-7 (lr)8-10 (lr)11-13 ACC Weighted \(F_1\) Macro \(F_1\) ACC Weighted \(F_1\) Macro \(F_1\) ACC \(F_1\) AUC ACC \(F_1\) AUC
KNN 74.2\(\pm\)2.4 73.0\(\pm\)2.5 68.2\(\pm\)2.5 96.7\(\pm\)1.1 96.7\(\pm\)1.1 96.0\(\pm\)1.4 72.9\(\pm\)3.4 73.8\(\pm\)3.8 79.9\(\pm\)3.8 65.7\(\pm\)3.6 67.1\(\pm\)4.5 70.9\(\pm\)4.5
SVM 72.9\(\pm\)1.8 70.2\(\pm\)1.7 64.0\(\pm\)1.7 99.5\(\pm\)0.3 99.5\(\pm\)0.3 99.4\(\pm\)0.4 75.4\(\pm\)4.6 75.7\(\pm\)4.6 75.4\(\pm\)4.6 77.0\(\pm\)2.4 77.8\(\pm\)2.6 77.0\(\pm\)2.6
LR 73.2\(\pm\)1.2 69.8\(\pm\)2.6 64.2\(\pm\)2.6 97.4\(\pm\)0.2 97.4\(\pm\)0.2 97.2\(\pm\)0.4 76.1\(\pm\)1.8 76.7\(\pm\)2.7 82.3\(\pm\)2.7 69.4\(\pm\)3.7 73.0\(\pm\)3.5 77.0\(\pm\)3.5
RF 75.4\(\pm\)0.9 73.3\(\pm\)1.3 64.9\(\pm\)1.3 98.1\(\pm\)0.6 98.1\(\pm\)0.6 97.5\(\pm\)1.1 74.8\(\pm\)1.2 74.2\(\pm\)1.0 82.3\(\pm\)1.0 72.6\(\pm\)2.9 73.4\(\pm\)1.9 81.1\(\pm\)1.9
NN 75.4\(\pm\)2.8 74.0\(\pm\)4.7 66.8\(\pm\)4.7 99.1\(\pm\)0.5 99.1\(\pm\)0.5 99.1\(\pm\)0.5 73.7\(\pm\)2.3 74.8\(\pm\)3.7 81.0\(\pm\)3.7 75.5\(\pm\)2.1 76.4\(\pm\)2.5 82.7\(\pm\)2.5
GRridge [29] 74.5\(\pm\)1.6 72.6\(\pm\)2.5 65.6\(\pm\)2.5 99.4\(\pm\)0.4 99.4\(\pm\)0.4 99.3\(\pm\)0.4 74.6\(\pm\)3.8 75.6\(\pm\)4.4 82.6\(\pm\)4.4 76.0\(\pm\)3.4 76.9\(\pm\)2.3 84.1\(\pm\)2.3
BPLSDA [30] 64.2\(\pm\)0.9 53.4\(\pm\)1.7 36.9\(\pm\)1.7 93.3\(\pm\)1.3 93.3\(\pm\)1.3 91.9\(\pm\)2.1 75.9\(\pm\)2.5 73.8\(\pm\)2.3 82.5\(\pm\)2.3 74.2\(\pm\)2.4 75.5\(\pm\)2.5 83.0\(\pm\)2.5
BSPLSDA [30] 63.9\(\pm\)0.8 52.2\(\pm\)2.2 35.1\(\pm\)2.2 91.9\(\pm\)1.2 91.8\(\pm\)1.3 89.5\(\pm\)1.4 68.5\(\pm\)2.7 66.2\(\pm\)2.6 73.0\(\pm\)2.6 75.3\(\pm\)3.3 76.4\(\pm\)2.1 83.8\(\pm\)2.1
MOGONET [14] 82.9\(\pm\)1.8 82.5\(\pm\)1.7 77.4\(\pm\)1.7 99.9\(\pm\)0.2 99.9\(\pm\)0.2 99.9\(\pm\)0.2 81.6\(\pm\)1.6 81.4\(\pm\)2.7 84.0\(\pm\)2.7 81.5\(\pm\)2.3 82.1\(\pm\)1.2 87.4\(\pm\)1.2
TMC [9] 84.2\(\pm\)0.5 84.4\(\pm\)0.9 80.6\(\pm\)0.9 99.7\(\pm\)0.3 99.7\(\pm\)0.3 99.4\(\pm\)0.5 81.9\(\pm\)0.8 81.5\(\pm\)0.4 87.1\(\pm\)0.4 82.5\(\pm\)0.9 82.3\(\pm\)0.6 88.5\(\pm\)0.6
CF [7] 81.5\(\pm\)0.8 81.5\(\pm\)0.9 77.1\(\pm\)0.9 99.2\(\pm\)0.5 99.2\(\pm\)0.5 98.8\(\pm\)0.9 81.1\(\pm\)1.2 82.2\(\pm\)0.4 88.1\(\pm\)0.4 78.4\(\pm\)1.1 78.8\(\pm\)0.5 88.0\(\pm\)0.5
GMU [8] 80.0\(\pm\)3.9 79.8\(\pm\)5.8 74.6\(\pm\)5.8 97.7\(\pm\)1.6 97.6\(\pm\)1.7 95.8\(\pm\)3.2 80.3\(\pm\)1.5 80.8\(\pm\)1.2 88.6\(\pm\)1.2 77.6\(\pm\)2.5 78.4\(\pm\)1.6 86.9\(\pm\)1.6
MM-Dynamics [11] 87.7\(\pm\)0.3 88.0\(\pm\)5.5 84.5\(\pm\)0.5 99.9\(\pm\)0.2 99.9\(\pm\)0.2 99.9\(\pm\)0.2 83.1\(\pm\)1.2 83.7\(\pm\)4.0 83.7\(\pm\)4.0 84.2\(\pm\)1.1 84.6\(\pm\)2.4 91.2\(\pm\)0.7
Ours (ACE) 88.1\(\pm\)0.4 88.4\(\pm\)4.4 85.2\(\pm\)0.5 99.9\(\pm\)0.2 99.9\(\pm\)0.2 99.9\(\pm\)0.3 83.3\(\pm\)1.0 85.6\(\pm\)1.7 85.6\(\pm\)1.7 86.7\(\pm\)1.0 86.8\(\pm\)1.0 92.5\(\pm\)0.1
%Improvement (\(\uparrow\)) 0.4 0.4 0.7 - - - 0.7 2.3 -3 2.5 2.2 1.3

4.1 Evaluating Confidence Calibration in the TCP Module↩︎

To further validate the trustworthiness of our multimodal fusion strategy, we evaluate the calibration of the True Class Probability (TCP) module, which dynamically estimates modality-level confidence for reliable decision-making. Proper calibration ensures that predicted confidences accurately reflect the model’s likelihood of being correct, a crucial property for high-stakes applications such as medical diagnosis, where overconfidence can lead to erroneous outcomes [31]. We assess calibration using a suite of established metrics: Mean Squared Error (MSE), Expected Calibration Error (ECE), Maximum Calibration Error (MCE), Adaptive Calibration Error (ACE), Area Under the Precision-Recall Curve for Errors (AUPRC-Error), Area Under the ROC Curve for Errors (AUC-Error), Negative Log Likelihood (NLL), and MSE relative to the Maximum Class Probability baseline (MSE\(_{\text{MCP}}\)). Lower values indicate better performance for all metrics except AUPRC-Error and AUC-Error (where higher is better, though reported inversely for consistency). These metrics are computed over 20 independent runs on the BRCA and ROSMAP datasets.

Table [tab:tcp95improvement] presents a comprehensive comparison. For MM-Dynamics [11], metrics are limited to its three original views, while ACE’s correlation-based expansion enables evaluation across six views, with bold values denoting significant per-view improvements over the baseline. On BRCA, ACE substantially outperforms MM-Dynamics [11] in the comparable views (0–2), reducing MSE by 72% in View 0 (0.1669 to 0.0472) and ECE by 26% (0.3431 to 0.2540), indicating more accurate and aligned confidence estimates. AUC-Error surges by 67% (0.5055 to 0.8430), underscoring superior error flagging. Derived views (3–5) maintain strong performance, with ECE as low as 0.2483 in View 3. Our results confirm TCP’s superiority over MCP across all views, as MSE\(_{\text{MCP}}\) \(<\) MSE.

ROSMAP results echo outperforming MM-Dynamics, with ACE slashing ECE by 30% in View 2 (0.2740 to 0.1910) and NLL by 42% in View 0 (0.9002 to 0.5257). Derived views exhibit consistent calibration, e.g., MCE of 0.2133 in View 5.

ACE’s enhancements yield more reliable confidences than MM-Dynamics [10]. This mitigates overconfidence (lower ECE/MCE/NLL) and boosts error detection (higher AUC/AUPRC-Error), making ACE better suited for clinical reliability. Compared to MM-Dynamics, ACE introduces a modest and largely constant-factor overhead. The correlation-based modality expansion is a one-time CPU preprocessing step that incurs negligible cost and adds no inference overhead. Expanding the modality-specific encoders from \(n\) to \(2n\) increases parameters and runtime by approximately 2×; however, each encoder is implemented as a lightweight linear layer, and all branches can be executed in parallel, resulting in low per-sample inference latency. The global TCP head and adaptive weighting introduce negligible additional computation. The memory footprint increases proportionally due to storing \(2n\) modality views. Overall, ACE trades an approximate 2× increase in computational and memory cost for notable improvements in accuracy and calibration.

To assess the statistical significance of the performance differences between our proposed ACE framework and the MM-Dynamics baseline, we conducted two-tailed Welch’s t-tests on the results from 20 independent runs for each metric across the four datasets (BRCA, ROSMAP, KIPAN, and LGG) shown on Table 2. This test was chosen due to its robustness to unequal variances and sample sizes, comparing the means of ACE and baseline without assuming homoscedasticity. Results indicate that ACE achieves statistically significant improvements (p \(<\) 0.05) over baseline in most cases, particularly in accuracy, weighted \(F_1\), and macro \(F_1\) for BRCA (p-values ranging from 0.0017 to 0.0034); all metrics for ROSMAP (p \(<\) 0.0001); accuracy and weighted \(F_1\) for KIPAN (p = 0.0375); and AUC for LGG (p \(<\) 0.0001). Non-significant differences were observed in KIPAN’s macro \(F_1\) (p = 0.1525) and LGG’s accuracy and \(F_1\)-score (p \(>\) 0.67), where performances were comparable. These findings underscore ACE’s superior reliability and discriminative power, especially in noisy or heterogeneous multimodal settings.

Table 2: Welch’s two-tailed t-test results across datasets. Bold values indicate statistically significant improvements (\(p < 0.05\)).
Dataset & Metric t-statistic Degree of Freedom p-value
BRCA – Accuracy 3.1686 30.82 0.0034
BRCA – F1 Weighted 3.2947 30.85 0.0025
BRCA – F1 Macro 3.4052 34.38 0.0017
ROSMAP – Accuracy 6.4684 36.84 0.0000
ROSMAP – F1 6.4888 36.37 0.0000
ROSMAP – AUC 7.6195 28.85 0.0000
KIPAN – Accuracy 2.2361 19.00 0.0375
KIPAN – F1 Weighted 2.2361 19.00 0.0375
KIPAN – F1 Macro 1.4907 19.00 0.1525
LGG – Accuracy 0.3756 36.83 0.7094
LGG – F1 0.4174 35.24 0.6789
LGG – AUC 22.6997 29.85 0.0000

4.2 Ablation Study↩︎

To assess the contribution of each component in our Adaptive Confidence-weighted Expansion (ACE) framework, we conduct an ablation study by systematically removing individual modules and evaluating the impact on performance. The components examined include: (1) correlation-based modality expansion; (2) adaptive weighting; (3) input reconstruction and noise addition; and (4) the global TCP head. Experiments are performed on the BRCA and ROSMAP datasets over 20 runs, with results reported in Tables  3 and  4 as mean \(\pm\) standard deviation. We compare each ablated variant against the full ACE model, highlighting the role of each innovation in achieving superior accuracy, \(F_1\)-scores, and AUC.

Table 3: Ablation study results on the BRCA dataset. Bold values indicate the full ACE model’s superior performance.
Model Variant Accuracy \(F_1\) Weighted \(F_1\) Macro
ACE (Ours) 0.88118 \(\pm\) 0.00508 0.88434 \(\pm\) 0.00507 0.85155 \(\pm\) 0.00700
No Correlation 0.87567 \(\pm\) 0.00320 0.87911 \(\pm\) 0.00338 0.84340 \(\pm\) 0.00804
No Adaptive Weighting 0.87327 \(\pm\) 0.00272 0.88579 \(\pm\) 0.00271 0.85557 \(\pm\) 0.00422
No Input Reconstruction & Noise 0.85532 \(\pm\) 0.00630 0.85733 \(\pm\) 0.00660 0.82112 \(\pm\) 0.00848
No Global TCP 0.88156 \(\pm\) 0.00301 0.88419 \(\pm\) 0.00329 0.85493 \(\pm\) 0.00399
Table 4: Ablation study results on the ROSMAP dataset. Bold values indicate the full ACE model’s superior performance.
Model Variant Accuracy \(F_1\)-score AUC
ACE (Ours) 0.86651 \(\pm\) 0.01087 0.86837 \(\pm\) 0.00968 0.92549 \(\pm\) 0.00370
No Correlation 0.85755 \(\pm\) 0.00985 0.86062 \(\pm\) 0.00871 0.92164 \(\pm\) 0.00395
No Adaptive Weighting 0.86321 \(\pm\) 0.01136 0.86555 \(\pm\) 0.01019 0.92339 \(\pm\) 0.00292
No Input Reconstruction & Noise 0.79858 \(\pm\) 0.01586 0.80018 \(\pm\) 0.01762 0.88781 \(\pm\) 0.00580
No Global TCP 0.86321 \(\pm\) 0.01012 0.86468 \(\pm\) 0.00878 0.92333 \(\pm\) 0.00380

Ablation studies on BRCA and ROSMAP show that each ACE component is essential for strong multimodal performance. Removing correlation-based expansion or adaptive weighting notably weakens feature robustness and fusion stability, especially in low-sample or imbalanced data. The biggest performance drop occurs without input reconstruction and noise addition, which are crucial for generalization. In contrast, removing the global TCP head has minimal effect on accuracy but reduces calibration quality, indicating its role in reliability refinement. Overall, the results confirm that ACE’s integrated design enhances both accuracy and trustworthiness in clinical classification tasks.

5 Conclusions↩︎

This paper introduced ACE, a novel framework that addresses key challenges in trustworthy multimodal fusion. ACE extends the capabilities of existing models like MMDynamics. The experimental results demonstrated that our proposed method achieves high performance on four challenging clinical datasets, and showed significant improvements in both predictive accuracy and model reliability. Furthermore, ablation studies confirmed that each component of the ACE framework contributes to the model’s superior performance. Future work could focus on applying the ACE framework to other complex data types and exploring its sensitivity to different hyperparameters. Additionally, further research could investigate alternative strategies for addressing data scarcity, as well as adapting the framework to process medical images when available, broadening its applicability across diverse clinical scenarios. The proposed framework represents a meaningful step toward developing more robust and reliable AI for high-stakes clinical decision-making.

6 Acknowledgments↩︎

The authors would like to thank Phoenix Sandrock for carefully reading the manuscript and providing valuable language editing feedback.

7 Data and materials availability statement↩︎

The data and materials that support the findings of this study are available from the corresponding author upon reasonable request.

References↩︎

[1]
X. Xu et al., “A comprehensive review on synergy of multi-modal data and AI technologies in medical diagnosis,” Bioengineering, vol. 11, no. 3, 2024, doi: 10.3390/bioengineering11030219.
[2]
R. Hu and A. Singh, “Unit: Multimodal multitask learning with a unified transformer,” in Proceedings of the IEEE/CVF international conference on computer vision, 2021, pp. 1439–1449.
[3]
S. Huang, B. Song, Y. Yang, et al., “Multimodal data fusion via deep neural networks for glioma grading,” Medical Image Analysis, vol. 80, p. 102484, 2022.
[4]
K. Chaudhary, O. B. Poirion, L. Lu, and L. X. Garmire, “Deep learning-based multi-omics integration robustly predicts survival in liver cancer,” Nature Communications, vol. 9, no. 1, p. 2708, 2018.
[5]
Y. Wang, “Survey on deep multi-modal data analytics: Collaboration, rivalry, and fusion,” ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM), vol. 17, no. 1s, pp. 1–25, 2021.
[6]
S. Poria, E. Cambria, and A. Gelbukh, “Deep convolutional neural network textual features and multiple kernel learning for utterance-level multimodal sentiment analysis,” in Proceedings of the 2015 conference on empirical methods in natural language processing, 2015, pp. 2539–2544.
[7]
D. Hong et al., “More diverse means better: Multimodal deep learning meets remote-sensing imagery classification,” IEEE Transactions on Geoscience and Remote Sensing, vol. 59, no. 5, pp. 4340–4354, 2020.
[8]
J. Arevalo, T. Solorio, M. Montes-y-Gómez, and F. A. González, “Gated multimodal units for information fusion,” arXiv preprint arXiv:1702.01992, 2017.
[9]
Z. Han, C. Zhang, H. Fu, and J. T. Zhou, “Trusted multi-view classification with dynamic evidential fusion,” IEEE transactions on pattern analysis and machine intelligence, vol. 45, no. 2, pp. 2551–2566, 2022.
[10]
P. Natarajan et al., “Multimodal feature fusion for robust event detection in web videos,” in 2012 IEEE conference on computer vision and pattern recognition, 2012, pp. 1298–1305.
[11]
Z. Han, F. Yang, J. Huang, C. Zhang, and J. Yao, “Multimodal dynamics: Dynamical fusion for trustworthy multimodal classification,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2022, pp. 20707–20717.
[12]
R. Argelaguet, A. S. E. Cuomo, O. Stegle, and J. C. Marioni, “Computational principles and challenges in single-cell data integration,” Nature Biotechnology, vol. 39, no. 10, pp. 1202–1215, Oct. 2021, doi: 10.1038/s41587-021-00895-7.
[13]
U. Yelipe, S. Porika, and M. Golla, “An efficient approach for imputation and classification of medical data values using class-based clustering of medical records,” Computers & Electrical Engineering, vol. 66, pp. 487–504, 2018.
[14]
T. Wang et al., “MOGONET integrates multi-omics data using graph convolutional networks allowing patient classification and biomarker identification,” Nature communications, vol. 12, no. 1, p. 3445, 2021.
[15]
T. C. G. A. Networks, “Comprehensive molecular portraits of human breast tumours,” Nature, vol. 490, no. 7418, pp. 61–70, 2012.
[16]
D. A. Bennett, J. A. Schneider, Z. Arvanitakis, and R. S. Wilson, “Overview and findings from the religious orders study,” Current Alzheimer Research, vol. 9, no. 6, pp. 628–645, 2012.
[17]
M. Buda, A. Saha, and M. A. Mazurowski, “Association of genomic subtypes of lower-grade gliomas with shape features automatically extracted by a deep learning algorithm,” Computers in biology and medicine, vol. 109, pp. 218–225, 2019.
[18]
A. Maleki, M. Raahemi, and H. Nasiri, “Breast cancer diagnosis from histopathology images using deep neural network and XGBoost,” Biomedical Signal Processing and Control, vol. 86, p. 105152, 2023.
[19]
J. Mateo et al., “Delivering precision oncology to patients with cancer,” Nature medicine, vol. 28, no. 4, pp. 658–665, 2022.
[20]
B. Li, T. Wang, and S. Nabavi, “Cancer molecular subtype classification by graph convolutional networks on multi-omics data,” in Proceedings of the 12th ACM international conference on bioinformatics, computational biology, and health informatics, 2021, pp. 1–9.
[21]
T. Wang, J. Bai, and S. Nabavi, “Single-cell classification using graph convolutional networks,” BMC bioinformatics, vol. 22, no. 1, p. 364, 2021.
[22]
G. Nicora, F. Vitali, A. Dagliati, N. Geifman, and R. Bellazzi, “Integrated multi-omics analyses in oncology: A review of machine learning methods and tools,” Frontiers in oncology, vol. 10, p. 1030, 2020.
[23]
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” nature, vol. 521, no. 7553, pp. 436–444, 2015.
[24]
Y. H. Chan, C. Wang, W. K. Soh, and J. C. Rajapakse, “Combining neuroimaging and omics datasets for disease classification using graph neural networks,” Frontiers in Neuroscience, vol. 16, p. 866666, 2022.
[25]
M. Dalla Mura, S. Prasad, F. Pacifici, P. Gamba, J. Chanussot, and J. A. Benediktsson, “Challenges and opportunities of multimodality and data fusion in remote sensing,” Proceedings of the IEEE, vol. 103, no. 9, pp. 1585–1601, 2015.
[26]
L. Wang, Z. Ding, Z. Tao, Y. Liu, and Y. Fu, “Generative multi-view human action recognition,” in Proceedings of the IEEE/CVF international conference on computer vision, 2019, pp. 6212–6221.
[27]
H. Ma, Z. Han, C. Zhang, H. Fu, J. T. Zhou, and Q. Hu, “Trustworthy multimodal regression with mixture of normal-inverse gamma distributions,” Advances in Neural Information Processing Systems, vol. 34, pp. 6881–6893, 2021.
[28]
R. Ramirez et al., “Classification of cancer types using graph convolutional neural networks,” Frontiers in physics, vol. 8, p. 203, 2020.
[29]
M. A. Van De Wiel, T. G. Lien, W. Verlaat, W. N. van Wieringen, and S. M. Wilting, “Better prediction by use of co-data: Adaptive group-regularized ridge regression,” Statistics in medicine, vol. 35, no. 3, pp. 368–381, 2016.
[30]
A. Singh et al., “DIABLO: An integrative approach for identifying key molecular drivers from multi-omics assays,” Bioinformatics, vol. 35, no. 17, pp. 3055–3062, 2019.
[31]
J. Moon, J. Kim, Y. Shin, and S. Hwang, “Confidence-aware learning for deep neural networks,” in Proceedings of the 37th international conference on machine learning, 2020, vol. 119, pp. 7034–7044, [Online]. Available: https://proceedings.mlr.press/v119/moon20a.html.