Uncertainty-Guided Adaptive Local Adversarial Perturbation for Reliable Molecular Property Prediction
Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence. Main Track. Pages 5387-5395.
https://doi.org/10.24963/ijcai.2026/600
Keywords
- Machine Learning: Representation learning
- Machine Learning: Adversarial machine learning
- Multidisciplinary Topics and Applications: Bioinformatics
- Uncertainty in AI: Applications
Abstract
Molecular property prediction is a fundamental task with wide-ranging applications in chemistry, materials science, and drug discovery. Beyond predictive accuracy, the reliability of model predictions, particularly their uncertainty awareness, is critical for high-stakes downstream applications. However, most existing methods predominantly optimize performance metrics while overlooking prediction reliability, often producing results that are both inaccurate and overconfident. To address this challenge, we propose an uncertainty-guided framework that integrates adaptive local adversarial perturbation with evidential deep learning for reliable molecular property prediction. The proposed method identifies sensitive molecular regions through gradient-based sensitivity analysis and applies locally adaptive perturbations whose magnitudes are dynamically modulated by predictive uncertainty. This approach explicitly challenges the model to preserve predictive stability under structure-aware perturbations, thereby enhancing its sensitivity to critical molecular substructures. Furthermore, we introduce an evidential calibration strategy that aligns uncertainty with the prediction discrepancy between clean and adversarial molecular views, enabling the learned evidence to faithfully reflect prediction stability. Extensive experiments on benchmark molecular property prediction datasets demonstrate that our approach achieves state-of-the-art predictive performance while providing more reliable uncertainty estimates than widely used uncertainty quantification methods. These results highlight the potential of the proposed framework as a reliable tool for risk-sensitive virtual screening and molecular decision-making. Our code is available at https://github.com/Ubehind/ugap.
- [Amini et al., 2020] Alexander Amini, Wilko Schwarting, Ava Soleimany, and Daniela Rus. Deep evidential regres- sion. In H. Larochelle, M. Ranzato, R. Hadsell, M.F. Bal- can, and H. Lin, editors, Advances in Neural Information Processing Systems, volume 33, pages 14927-14937.
- [Gal and Ghahramani, 2016] Yarin Gal and Zoubin Ghahra- mani. Dropout as a bayesian approximation: Representing model uncertainty in deep learning. In international con- ference on machine learning, pages 1050-1059. PMLR, 2016.
- [Goodfellow et al., 2014] Ian J Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572, 2014.
- [Han et al., 2023] Shen Han, Haitao Fu, Yuyang Wu, Ganglan Zhao, Zhenyu Song, Feng Huang, Zhongfei Zhang, Shichao Liu, and Wen Zhang. Himgnn: a novel hi- erarchical molecular graph representation learning frame- work for property prediction. Briefings in Bioinformatics, 24(5):bbad305, 2023.
- [Jin et al., 2025] Shuting Jin, Xiangrong Liu, Junlin Xu, Sisi Yuan, Hongxing Xiang, Lian Shen, Chunyan Li, Zhang- ming Niu, and Yinhui Jiang. Adaptive symmetry-based adversarial perturbation augmentation for molecular graph representations with dual-fusion attention information. In- formation Fusion, 120:103062, 2025.
- [Jospin et al., 2022] Laurent Valentin Jospin, Hamid Laga, Farid Boussaid, Wray Buntine, and Mohammed Ben- namoun. Hands-on bayesian neural networks-a tutorial for deep learning users. IEEE Computational Intelligence Magazine, 17(2):29-48, 2022.
- [Kang et al., 2024] Linjia Kang, Songhua Zhou, Shuyan Fang, and Shichao Liu. Adapting differential molec- ular representation with hierarchical prompts for multi- label property prediction. Briefings in Bioinformatics, 25(5):bbae438, 2024.
- [Kong et al., 2022] Kezhi Kong, Guohao Li, Mucong Ding, Zuxuan Wu, Chen Zhu, Bernard Ghanem, Gavin Taylor, and Tom Goldstein. Robust optimization as data aug- mentation for large-scale graphs. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 60-69, 2022.
- [Lakshminarayanan et al., 2017] Balaji Lakshminarayanan, Alexander Pritzel, and Charles Blundell. Simple and scal- able predictive uncertainty estimation using deep ensem- bles. Advances in neural information processing systems, 30, 2017.
- [Li and Qiu, 2021] Linyang Li and Xipeng Qiu. Token- aware virtual adversarial training in natural language un- derstanding. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, pages 8410-8418, 2021.
- [Liu et al., 2021] Shengchao Liu, Hanchen Wang, Weiyang Liu, Joan Lasenby, Hongyu Guo, and Jian Tang. Pre- training molecular graph representation with 3d geometry. arXiv preprint arXiv:2110.07728, 2021.
- [Liu et al., 2025] Ziyang Liu, Chaokun Wang, Shuwen Zheng, Cheng Wu, Hao Feng, Li Xu, Yue Zheng, Liang Rong, and Peng Li. Molecular motif learning as a pre- training objective for molecular property prediction. Na- ture Communications, 2025.
- [Madry et al., 2017] Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu. Towards deep learning models resistant to adversarial attacks. arXiv preprint arXiv:1706.06083, 2017.
- [Qiao et al., 2025] Jianbo Qiao, Junru Jin, Ding Wang, Sai- sai Teng, Junyu Zhang, Xuetong Yang, Yuhang Liu, Yu Wang, Lizhen Cui, Quan Zou, et al. A self- conformation-aware pre-training framework for molecular property prediction with substructure interpretability. Na- ture Communications, 16(1):4382, 2025.
- [Rampášek et al., 2022] Ladislav Rampášek, Michael Galkin, Vijay Prakash Dwivedi, Anh Tuan Luu, Guy Wolf, and Dominique Beaini. Recipe for a general, powerful, scalable graph transformer. Advances in Neural Information Processing Systems, 35:14501-14515, 2022.
- [Rong et al., 2020] Yu Rong, Yatao Bian, Tingyang Xu, Weiyang Xie, Ying Wei, Wenbing Huang, and Junzhou Huang. Self-supervised graph transformer on large-scale molecular data. Advances in neural information process- ing systems, 33:12559-12571, 2020.
- [Sensoy et al., 2018] Murat Sensoy, Lance Kaplan, and Melih Kandemir. Evidential deep learning to quantify classification uncertainty. In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Gar- nett, editors, Advances in Neural Information Processing Systems, volume 31.
- Curran Associates, Inc., 2018.
- [Soleimany et al., 2021] Ava P Soleimany, Alexander Amini, Samuel Goldman, Daniela Rus, Sangeeta N Bhatia, and Connor W Coley. Evidential deep learning for guided molecular property prediction and discovery. ACS central science, 7(8):1356-1367, 2021.
- [Song et al., 2020] Ying Song, Shuangjia Zheng, Zhang- ming Niu, Zhang-Hua Fu, Yutong Lu, and Yuedong Yang. Communicative representation learning on at- tributed molecular graphs. In 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence (IJCAI-PRICAI2020). International Joint Conferences on Artificial Intelligence Organization, 2020. IJCAI
- [Wang et al., 2022] Yuyang Wang, Jianren Wang, Zhonglin Cao, and Amir Barati Farimani. Molecular contrastive learning of representations via graph neural networks. Na- ture Machine Intelligence, 4(3):279-287, 2022.
- [Wu et al., 2018] Zhenqin Wu, Bharath Ramsundar, Evan N Feinberg, Joseph Gomes, Caleb Geniesse, Aneesh S Pappu, Karl Leswing, and Vijay Pande. Moleculenet: a benchmark for molecular machine learning. Chemical sci- ence, 9(2):513-530, 2018.
- [Xie et al., 2020] Cihang Xie, Mingxing Tan, Boqing Gong, Jiang Wang, Alan L Yuille, and Quoc V Le. Adversarial examples improve image recognition. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 819-828, 2020.
- [Xiong et al., 2026] Zhankun Xiong, Ziyan Wang, Feng Huang, Minyao Qiu, Shuyan Fang, Liuqing Yang, Xionghui Zhou, Shichao Liu, Ping Zhang, and Wen Zhang. Multi-to-uni modal knowledge transfer pre- training for molecular representation learning. Nature Communications, 2026.
- [Xu et al., 2018] Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. How powerful are graph neural net- works? arXiv preprint arXiv:1810.00826, 2018.
- [Xue et al., 2021] Haotian Xue, Kaixiong Zhou, Tianlong Chen, Kai Guo, Xia Hu, Yi Chang, and Xin Wang. Cap: Co-adversarial perturbation on weights and features for improving generalization of graph neural networks. arXiv preprint arXiv:2110.14855, 2021.
- [Yu et al., 2022] Jie Yu, Dingyan Wang, and Mingyue Zheng. Uncertainty quantification: Can we trust artificial intelligence in drug discovery? Iscience, 25(8), 2022.
- [Zeng et al., 2022] Xiangxiang Zeng, Hongxin Xiang, Lin- hui Yu, Jianmin Wang, Kenli Li, Ruth Nussinov, and Feix- iong Cheng. Accurate prediction of molecular properties and drug targets using a self-supervised image represen- tation learning framework. Nature Machine Intelligence, 4(11):1004-1016, 2022.
- [Zhang et al., 2024] Haohui Zhang, Juntong Wu, Shichao Liu, and Shen Han. A pre-trained multi-representation fusion network for molecular property prediction. Infor- mation Fusion, 103:102092, 2024.
- [Zhou et al., 2023] Gengmo Zhou, Zhifeng Gao, Qiankun Ding, Hang Zheng, Hongteng Xu, Zhewei Wei, Linfeng Zhang, and Guolin Ke. Uni-mol: A universal 3d molecu- lar representation learning framework. In The eleventh in- ternational conference on learning representations, 2023.
References were extracted automatically from the PDF and may contain errors.
Full text extracted automatically from the PDF; figures, tables and equations may differ. The PDF is the version of record.
1 Introduction
Molecular property prediction is essential for modern drug discovery and materials design. With the rapid development of graph neural networks (GNNs), molecular structures are commonly modeled as graphs, where atoms correspond to nodes and chemical bonds to edges, enabling expressive learning of structure-property relationships [Kang et al., 2024; Xiong et al., 2026]. These models have achieved impressive performance on standard benchmarks. However, despite their empirical success, existing molecular property predictors often suffer from limited generalization ability [Zhang et al., 2024; Han et al., 2023]. In real-world applications, chemical space is vast and sparsely sampled, requiring models to extrapolate to novel compounds or molecular classes that are underrepresented in training data. Under such conditions, prediction errors become difficult to detect, and models tend to produce overconfident outputs even when their predictions are unreliable [Yu et al., 2022]. This mismatch between predictive confidence and actual correctness raises a critical question for practical deployment: when can a model's prediction be trusted? Addressing this question is as important as improving predictive accuracy, particularly in high-stakes scenarios such as virtual screening and early-stage drug discovery.
Adversarial training has been widely explored to improve robustness and generalization in machine learning. Early work in computer vision and natural language processing showed that training on adversarially perturbed samples could enhance model stability under distributional, syntactic, or semantic variations [Xie et al., 2020; Li and Qiu, 2021]. More recently, adversarial training was adapted to graphstructured data [Kong et al., 2022], where perturbations were applied to node features, edges, or latent representations. In molecular property prediction, adversarial perturbations were typically applied to atomic embeddings or learned representations [Jin et al., 2025]. These methods were shown to help GNNs generalize to out-of-distribution samples by encouraging consistent predictions under input variations. However, existing approaches often rely on uniform perturbation strategies, which overlook the heterogeneous importance of different molecular regions and may introduce excessive perturbations to fragile representations. Moreover, multi-step iterative perturbation methods incur substantial computational overhead, limiting their scalability for large molecular datasets.
In parallel, uncertainty quantification has received growing attention as a way to assess the reliability of model predictions. Bayesian neural networks, Monte Carlo dropout, and deep ensembles were proposed to estimate predictive uncertainty by approximating posterior distributions over model parameters [Jospin et al., 2022; Lakshminarayanan et al., 2017; Gal and Ghahramani, 2016]. Despite their effectiveness, these approaches are often computationally expensive and typically require multiple inference passes. Evidential deep learning later emerged as a deterministic alternative that models uncertainty by predicting parameters of evidential distributions [Sensoy et al., 2018; Amini et al., 2020], enabling uncertainty estimation in a single forward pass. This paradigm was successfully applied to regression and classification tasks, including molecular property prediction [Soleimany et al., 2021]. However, existing evidential methods typically rely on implicit assumptions linking confidence to reliability and lack explicit mechanisms to calibrate evidence against prediction stability under perturbations.
To address these challenges, we propose UGAP, an uncertainty-guided adaptive perturbation framework for reliable molecular property prediction. UGAP integrates adversarial training with evidential learning to couple predictive performance with uncertainty estimation. Motivated by the observation that molecular properties are often governed by specific functional groups rather than the entire molecular structure, UGAP identifies salient molecular regions via gradient-based sensitivity analysis and selectively perturbs influential atoms. Furthermore, the perturbation intensity is adaptively modulated by predictive uncertainty: stronger perturbations are applied to high-confidence samples to probe representational robustness, while milder perturbations are used for low-confidence samples whose feature representations are not yet well established. In addition, UGAP introduces a stability-aware evidence calibration strategy that regularizes evidential outputs using discrepancies between clean and perturbed predictions, thereby aligning evidential magnitude with predictive stability. Extensive experiments demonstrate that UGAP consistently outperforms existing baselines in both predictive accuracy and uncertainty reliability, offering an effective pathway toward trustworthy molecular property prediction.
2 Method
Each molecule is represented as a graph G = (V, E), where our goal is to learn a mapping f : G → (ˆ y, u) that produces accurate predictions ˆ y and reliable uncertainty estimates u. To achieve this, we propose UGAP, a framework integrating evidential learning with adaptive perturbations to optimize both generalization and uncertainty fidelity. As illustrated in Figure 1, raw atomic features are first converted into embeddings. UGAP then applies perturbations to salient atoms with intensities dynamically modulated by uncertainty. Finally, a stability-aware calibration module refines uncertainty by regularizing the discrepancy between clean and perturbed predictions. This mechanism aligns evidence magnitude with structural robustness, establishing a reliable safeguard for molecular property prediction.
2.1 Evidential Learning for Regression and Classification
To quantify predictive uncertainty, we adopt Evidential Deep Learning (EDL). Unlike standard networks producing point estimates, EDL outputs the hyperparameters of a prior distribution over the target parameters.
Regression Task
For continuous property prediction, the target y is modeled as a Gaussian distribution with a Normal-Inverse-Gamma (NIG) prior (µ, σ2 ) ∼ NIG(γ, v, α, β) [Amini et al., 2020]. The predicted mean and epistemic uncertainty u are derived from the estimated hyperparameters:
The model was optimized using the negative log-likelihood LNLL:
where Ω = 2β(1 + v). LNLL aims to fit the ground truth by maximizing the marginalized likelihood of the observed data. Furthermore, an auxiliary regularizer LREG was utilized to penalize evidence associated with inaccurate predictions:
The total regression loss was formulated as:
Classification Task
In classification tasks, class probabilities follow a Dirichlet distribution Dir(p|α) [Sensoy et al., 2018]. Evidence ek ≥ 0 for each class defines the concentration parameters αk = ek + 1 and total evidence S = ∑Kk=1 αk. The predicted probability ˆ pk and uncertainty u are:
Training was supervised by the expected cross-entropy loss Lce:
This loss minimizes the prediction error by aligning the multinomial opinions with the categorical ground truth labels. A KL divergence term LKL was incorporated to penalize misleading evidence:
where ˜αk = yk + (1 - yk)αk. The final classification loss was integrated as:

2.2 Uncertainty-Guided Adaptive Adversarial Perturbation
Clean Propagation
A clean propagation path was first executed to perform evidential learning. Each molecular graph was initially processed through an embedding layer to convert raw atomic features into atomic embeddings xi. These embeddings were then passed through the graph encoder to obtain representations for computing the evidential learning loss Lclean, which is defined as:
To identify structural components where the model exhibits high sensitivity, we examined the gradient of Lclean with respect to each initial embedding xi. Atoms that play a decisive role in predictions typically exhibit larger gradients. We quantified atomic saliency si by computing the L2 norms of these gradients:
The computed saliency scores provided the basis for targeted perturbations in the subsequent adversarial path.
Perturbation Generation and Adversarial Propagation
Atoms were ranked by saliency scores, and a top-k (recommended k ∈ [0.2, 0.6]) ratio was selected as perturbation targets. An adversarial perturbation mechanism was designed to generate perturbed representations x′i . The perturbation radius ϵ was dynamically adjusted based on normalized batch uncertainty ¯u to calculate the adaptive intensity:
With ϵmax ∈ [0.06, 0.1] recommended, this modulation assigns larger perturbations to high-confidence samples to probe robustness, while applying milder noise to uncertain ones to maintain stability. Following this, adversarial perturbations were applied to generate the perturbed representations:
The resulting x′i were then passed through an adversarial propagation path to calculate the adversarial evidential loss Ladv, defined analogously to Lclean. This dual-loss structure encourages the model to learn robust representations from localized structural variations.
2.3 Stability-Aware Evidence Calibration
We developed a calibration scheme to align predictive evidence with structural robustness. In this framework, the prediction shift ∆ˆ y serves as a metric for structural sensitivity. For regression tasks, ∆ˆ y is defined as the absolute difference |ˆ yclean - ˆ yadv|, while for classification, it is calculated as the Kullback-Leibler divergence between the two predictive probability distributions. Based on this metric, the stabilityaware ranking loss Lrank was employed to ensure that samples exhibiting larger prediction shifts are assigned lower evidence S. Following the parameterization in [Sensoy et al., 2018] and [Amini et al., 2020], the total evidence S is quantified as S = ∑Kk=1 αk for classification and S = 2α + ν for regression:
where P = {(i, j) | ϕi,j ≥ percentile(Φ, 50)} denotes the set of sample pairs whose shift differences ϕi,j = ∆ˆ yi -∆ˆ yj rank in the top 50%. We restricted the calibration to the top 50% of pairs because forcing the model to distinguish between pairs with nearly identical stability yields little useful information and creates minor gradients that dilute stronger signals. By filtering for these clear differences, the ranking objective provided a more effective signal for evidence calibration.
Furthermore, based on the principle of epistemic consistency, we implemented the monotonicity constraint Lmono = max(0, Sadv - Sclean) to ensure that evidence from perturbed passes remains below that of clean passes. In this term, Sclean was detached from the computational graph, forcing the gradient to exclusively penalize overconfident Sadv values. The total calibration loss Lcalib was then defined as Lcalib = Lrank + Lmono.
2.4 Training Objective
To simultaneously account for generalization capability and uncertainty fidelity, the framework was optimized using a multi-objective loss function. The total loss Ltotal integrates the evidential learning losses from both clean and adversarial propagation paths along with the calibration loss:
where λ1 and λ2 are hyperparameters that coordinate adversarial training and evidence calibration. This joint objective ensures that the model maintains robust generalization across molecular structures while producing uncertainty estimates that faithfully reflect structural sensitivity.
3 Experiments
3.1 Experimental Setup
Datasets
We evaluated the framework on eight datasets fromMoleculeNet [Wu et al., 2018]. The classification tasks include BBBP, ClinTox, BACE, Tox21, and SIDER, where ROCAUC is employed as the primary metric. The regression tasks comprise FreeSolv, ESOL, and Lipophilicity, with RMSE used for evaluation. To rigorously assess the model's generalization ability, we adopted a strict scaffold splitting strategy with a ratio of 8:1:1 for training, validation, and testing.
Baselines
We conducted extensive experiments to investigate the performance of the proposed framework on molecular property prediction tasks. To ensure a comprehensive evaluation, we compared our approach against several groups of baselines, focusing on their predictive accuracy and reliability in chemical contexts.
Molecular property prediction models: This category includes fundamental GNN backbones such as GIN [Xu et al.,
2018], GPS [Ramp´aˇsek et al., 2022], and CMPNN [Song et al., 2020]. We integrated our framework into these encoders to validate its versatility in improving molecular representations. Additionally, we considered state-of-the-art pre-trained models, including GraphMVP [Liu et al., 2021], GROVER [Rong et al., 2020], MolCLR [Wang et al., 2022], ImageMol [Zeng et al., 2022], Uni-Mol [Zhou et al., 2023], MotiL [Liu et al., 2025], and SCAGE [Qiao et al., 2025], which serve as strong competitive benchmarks for molecular property prediction.
Adversarial perturbation methods: To evaluate the impact of different perturbation schemes on molecular property prediction, we compared our strategy against classic adversarial training techniques, including FGSM [Goodfellow et al., 2014] and PGD [Madry et al., 2017], as well as graph-specific data augmentation methods such as FLAG [Kong et al., 2022] and CAP [Xue et al., 2021]. These comparisons were performed to evaluate the effectiveness of our uncertainty-guided perturbation in enhancing the generalization performance of molecular property predictors.
Predictive reliability baselines: Given the importance of confidence estimation in drug discovery, we assessed our framework's ability to provide reliable uncertainty. In addition to vanilla EDL [Sensoy et al., 2018; Amini et al., 2020], we included representative uncertainty quantification methods, namely Deep Ensembles [Lakshminarayanan et al., 2017] and MC-Dropout [Gal and Ghahramani, 2016]. These were employed to establish benchmarks for uncertainty estimates, ensuring that the model's confidence aligns with its actual predictive performance on complex chemical structures.
3.2 Performance onMolecular Property Prediction
The results in Table 1 demonstrate that the proposed UGAP framework consistently achieved superior performance across both classification and regression benchmarks. In classification tasks, our method exhibited significant advantages, particularly on the BBBP, ClinTox, and BACE datasets, where it reached the highest ROC-AUC scores of 75.9, 96.2, and 88.2, respectively. Compared to competitive pre-trained baselines such as Uni-Mol and SCAGE, the UGAP+CMPNN model observed a notable margin of improvement. For instance, on the ClinTox dataset, the model yielded a ROC-AUC of 96.2, significantly outperforming the vanilla CMPNN backbone (90.5) and even the second-best model, SCAGE (93.7). Notably, these results indicate that our framework can achieve performance comparable to models pre-trained on large-scale datasets.
In regression tasks, the UGAP framework maintained its superiority by achieving the lowest RMSE on FreeSolv (1.61) and ESOL (0.80). Specifically, on the FreeSolv dataset, our method improved the baseline CMPNN from 1.92 to 1.61, outperforming Uni-Mol's score of 1.72. For the ESOL task, UGAP+CMPNN attained an RMSE of 0.80, which surpassed advanced pre-training methods like MotiL (0.82) and GROVER (0.88). Moreover, the backbone-agnostic nature was validated as UGAP+GIN and UGAP+GPS also showed consistent gains over their respective vanilla versions. Overall, these results demonstrate that the proposed framework effectively enhances the predictive performance and generalization of GNNs on molecular property tasks.
| Methods | Classification (ROC-AUC% ↑) | Regression (RMSE ↓) | ||||||
|---|---|---|---|---|---|---|---|---|
| BBBP | ClinTox | BACE | Tox21 | SIDER | FreeSolv | ESOL | Lipo | |
| GIN | 65.8 ±1.1 | 85.0 ±1.4 | 77.1 ±2.1 | 70.2 ±1.8 | 57.3 ±1.6 | 2.71 ±0.13 | 1.45 ±0.16 | 0.87 ±0.06 |
| GPS | 64.8 ±1.6 | 87.2 ±1.9 | 78.0 ±2.5 | 70.5 ±1.4 | 60.8 ±2.1 | 2.65 ±0.12 | 1.40 ±0.12 | 0.90 ±0.07 |
| CMPNN | 71.3 ±1.1 | 90.5 ±0.9 | 81.3 ±1.0 | 72.0 ±0.8 | 61.6 ±1.0 | 2.15 ±0.10 | 1.19 ±0.07 | 0.85 ±0.06 |
| GraphMVP | 72.4 ±1.0 | 87.1 ±0.8 | 81.2 ±1.2 | 75.9 ±1.0 | 63.9 ±1.1 | 2.15 ±0.10 | 1.03 ±0.09 | 0.75 ±0.05 |
| GROVER | 69.5 ±0.8 | 86.2 ±0.7 | 81.0 ±0.8 | 73.5 ±1.2 | 65.4 ±1.2 | 2.20 ±0.08 | 0.88 ±0.10 | 0.82 ±0.05 |
| MolCLR | 73.0 ±0.7 | 90.4 ±0.7 | 83.5 ±1.0 | 75.7 ±0.6 | 60.7 ±0.8 | 2.79 ±0.09 | 0.84 ±0.08 | 0.74 ±0.06 |
| ImageMol | 70.9 ±1.2 | 89.1 ±1.0 | 83.9 ±1.1 | 73.3 ±0.8 | 66.0 ±0.9 | 2.81 ±0.11 | 1.07 ±0.09 | 0.74 ±0.05 |
| Uni-Mol | 72.8 ±0.6 | 92.9 ±0.9 | 85.7 ±0.9 | 77.9 ± 0.6 | 65.1 ±0.7 | 1.72 ±0.06 | 0.91 ±0.07 | 0.69 ±0.04 |
| MotiL | 73.2 ±1.0 | 92.8 ±0.8 | 86.4 ±0.7 | 74.9 ±0.7 | 66.4 ±0.5 | 1.97 ±0.07 | 0.82 ±0.06 | 0.69 ±0.04 |
| SCAGE | 73.5 ±0.7 | 93.7 ±1.0 | 85.7 ±0.6 | 76.0 ±0.6 | 66.1 ±0.5 | 1.80 ±0.08 | 0.83 ±0.04 | 0.65 ± 0.02 |
| UGAP+GIN | 73.3 ±0.7 | 93.3 ±0.8 | 85.6 ±0.9 | 74.6 ±0.8 | 62.6 ±0.8 | 1.75 ±0.09 | 0.92 ±0.09 | 0.81 ±0.05 |
| UGAP+GPS | 72.0 ±0.8 | 92.2 ±0.9 | 85.2 ±0.7 | 74.9 ±0.7 | 63.4 ±0.7 | 1.90 ±0.10 | 1.05 ±0.07 | 0.84 ±0.05 |
| UGAP+CMPNN | 75.9 ± 0.7 | 96.2 ± 0.6 | 88.2 ± 0.5 | 76.7 ±0.6 | 67.0 ± 0.5 | 1.61 ± 0.05 | 0.80 ± 0.04 | 0.67 ±0.03 |
3.3 Ablation Study
We conducted ablation experiments on eight benchmark datasets to evaluate the contribution of each UGAP component. We compared UGAP against various perturbation baselines and assessed the significance of its core loss functions.
Effectiveness of Perturbation Strategies
The results in Table 2 demonstrated that gradient-based perturbation strategies consistently outperformed the random noise baseline. Compared to global methods like PGD and FLAG, UGAP w/o Adaptive, which applied perturbations only to high-gradient local regions, achieved superior performance across all datasets. For instance, on ClinTox, it reached an ROC-AUC of 95.2, marking a significant improvement over FLAG's 92.1. This suggests that targeting chemically influential atoms is more effective for regularizing molecular representations than uniform perturbations. Furthermore, the full UGAP model, which incorporated uncertainty-guided intensity, attained the best results in most cases, such as an RMSE of 1.61 on FreeSolv. This indicated that adaptively modulating perturbation strength based on model confidence further enhances the model's predictive performance.
Impact of Loss Components
We investigated the necessity of the adversarial loss (Ladv) and the calibration loss (Lcalib). The performance of UGAP w/o Ladv dropped sharply to levels near the vanilla model, which verified that adversarial training is the primary driver for boosting predictive accuracy. In contrast, UGAP w/o Lcalib maintained high accuracy and showed slightly better results on specific datasets like BBBP and Lipo. However, the full UGAP model achieved more consistent performance across the majority of tasks, such as Tox21 (76.7) and ESOL (0.80). This suggested that while Lcalib is primarily designed to enhance uncertainty reliability, it tends to provide a stabilizing regularization effect. The results indicated that incorporating calibration mechanisms does not significantly compromise, and in many cases remains compatible with, the model's overall predictive power.
3.4 Uncertainty-Informed Predictive Performance
To evaluate uncertainty reliability and its relationship with model performance, we conducted an analysis across confidence intervals on both classification (BACE, BBBP) and regression (ESOL, FreeSolv) tasks. As Figure 2 illustrates, we ranked test samples by predicted confidence and evaluated predictive metrics within each interval.
In classification tasks, the ROC-AUC of our proposed strategy (red bars) consistently increased as confidence rose, outperforming vanilla Evidence, Ensemble, and Dropout methods, particularly in high-confidence regions. For instance, on the BACE dataset, our method achieved an ROC-AUC near 1.0 in the top confidence tier, whereas baseline methods exhibited a performance gap or fluctuations.

| Methods | Classification (ROC-AUC% ↑) | Regression (RMSE ↓) | ||||||
|---|---|---|---|---|---|---|---|---|
| BBBP | ClinTox | BACE | Tox21 | SIDER | FreeSolv | ESOL | Lipo | |
| Vanilla (CMPNN) | 71.3 ±1.1 | 90.5 ±0.9 | 81.3 ±1.0 | 72.0 ±0.8 | 61.6 ±1.0 | 2.15 ±0.10 | 1.19 ±0.07 | 0.85 ±0.06 |
| Comparison of Perturbation Strategies | ||||||||
| Random | 71.8 ±1.0 | 90.9 ±0.7 | 81.9 ±1.2 | 72.2 ±0.9 | 61.8 ±0.8 | 2.13 ±0.08 | 1.15 ±0.09 | 0.85 ±0.05 |
| FGSM | 72.5 ±0.9 | 91.8 ±0.8 | 82.8 ±1.0 | 73.1 ±0.7 | 62.3 ±1.0 | 2.07 ±0.09 | 1.09 ±0.08 | 0.83 ±0.06 |
| PGD | 73.4 ±0.5 | 92.7 ±0.7 | 85.0 ±0.5 | 74.5 ±0.8 | 63.8 ±0.6 | 1.93 ±0.07 | 0.92 ±0.04 | 0.79 ±0.05 |
| FLAG | 73.4 ±0.8 | 92.1 ±0.4 | 85.5 ±0.8 | 74.3 ±0.7 | 64.0 ±0.5 | 1.87 ±0.05 | 0.90 ±0.06 | 0.76 ±0.03 |
| CAP | 73.1 ±0.9 | 93.2 ±0.4 | 86.4 ±0.7 | 75.0 ±0.7 | 64.5 ±0.6 | 1.80 ±0.06 | 0.86 ±0.06 | 0.75 ±0.04 |
| UGAP w/o Local | 73.7 ±0.7 | 93.0 ±0.5 | 85.1 ±0.6 | 74.8 ±0.7 | 64.6 ±0.4 | 1.75 ±0.07 | 0.88 ±0.05 | 0.70 ±0.02 |
| UGAP w/o Adaptive | 75.2 ±0.8 | 95.2 ±0.4 | 87.4 ±0.6 | 75.7 ±0.6 | 66.2 ±0.5 | 1.68 ±0.05 | 0.84 ±0.06 | 0.68 ±0.03 |
| Ablation on Loss Functions | ||||||||
| UGAP w/o Ladv | 71.5 ±0.7 | 90.8 ±0.6 | 81.5 ±0.7 | 72.4 ±0.6 | 62.7 ±0.7 | 1.90 ±0.06 | 1.15 ±0.07 | 0.80 ±0.04 |
| UGAP w/o Lcalib | 76.0 ± 0.8 | 95.6 ±0.5 | 87.9 ±0.5 | 75.6 ±0.5 | 67.8 ±0.4 | 1.70 ±0.09 | 0.82 ±0.05 | 0.66 ± 0.02 |
| UGAP (Full) | 75.9 ±0.7 | 96.2 ± 0.6 | 88.2 ± 0.5 | 76.7 ± 0.6 | 67.0 ± 0.5 | 1.61 ± 0.05 | 0.80 ± 0.04 | 0.67 ±0.03 |
Similarly, in regression tasks, the RMSE of our method showed a clear downward trend as confidence increased, indicating that samples with higher confidence are indeed associated with lower predictive errors. Compared to the erratic behavior of MC-Dropout and sub-optimal performance of standard Ensembles, our method provided a more monotonic and dependable relationship between confidence and accuracy. These results validate that our framework enhances predictive performance and ensures that model confidence is a reliable indicator of actual performance, which is crucial for decision-making in drug discovery.
3.5 Mechanism of Evidence Calibration
To elucidate how the perturbation informs uncertainty estimation, we analyzed the relationship between predictive discrepancy ∆ and evidence magnitudes on the BACE and ESOL datasets. Intuitively, a large ∆ indicated that the model's prediction was sensitive to structural perturbations, which should ideally correspond to lower evidence (higher uncertainty). As illustrated in Figure 3, we categorized samples into Low, Mid, and High ∆ regions and observed the distribution of evidence values. In the vanilla evidential model (green boxes), although there was a slight downward trend in evidence as ∆ increased, the distinction between different discrepancy regions was relatively blurred. This suggested that without explicit alignment, standard evidential learning struggles to fully capture the structural instability of molecules. By incorporating our evidential calibration strategy, the UGAP model (red boxes) demonstrated a much more pronounced and monotonic decrease in evidence values as ∆ rose. Specifically, in high-discrepancy regions, the evidence magnitudes were significantly suppressed compared to the vanilla version. This clear correlation confirmed that our framework effectively utilized the predictive discrepancy induced by perturbations to regularize evidence, thereby ensuring that the model's confidence was grounded in its structural robustness.

3.6 Case Study
To evaluate perturbation sites and uncertainty reliability, we visualized representative molecules from the BBBP dataset (Figure 4). The light-red regions indicate the salient substructures targeted by our adaptive perturbation, while blue dashed circles highlight chemically significant groups, such as the sulfonamide group, hydroxyl group, and thioether linkage. In the BBBP task, these groups are pivotal; for instance, polar groups like sulfonamides and hydroxyls typically hinder passive diffusion across the lipid-rich blood-brain barrier, making them critical focal points for model sensitivity. By visualizing these perturbation regions, we revealed the saliency regions of the model's decision-making process. The high alignment between these regions and known chemical pharmacophores demonstrated that UGAP's learning process possesses physicochemical transparency.
Furthermore, the uncertainty estimates u provided crucial insights into predictive reliability. In cases (a) and (c), UGAP yielded high-confidence predictions with low uncertainty, accurately aligning with true labels. For the complex scaffold in case (b), UGAP exhibited a moderate uncertainty increase (u = 0.356), suggesting a more cautious yet correct inference-notably more confident than the Vanilla EDL, which yielded a higher uncertainty (u = 0.474). More importantly, case (d) triggered a significant uncertainty warning (u = 0.774). Despite a marginal prediction error, UGAP effectively flagged this risk with substantially higher uncertainty than the baseline (u = 0.476). This ability of the model to recognize its own cognitive boundaries through faithful uncertainty estimation demonstrates that UGAP provides a robust safeguard for reliable molecular property prediction.

3.7 Hyperparameter Analysis
We investigated the sensitivity of UGAP to the adversarial loss coefficient λ1 and the evidential calibration coefficient λ2 on the BACE and ESOL datasets (Figure 5).
Experimental results on 3D performance surfaces revealed that λ1 served as a primary driver for predictive accuracy. Within a range centered around 1.0, increasing λ1 consistently improved the ROC-AUC for BACE and reduced the RMSE for ESOL, which validated the efficacy of our structural-aware perturbations in enhancing generalization. Compared to λ1, λ2 showed a marginal impact on accuracy, allowing for uncertainty calibration with minimal loss in predictive performance.
The role of λ2 was further evaluated for uncertainty quantification. Notably, when λ2 = 0, the framework approximates standard evidential learning. For classification, we assessed calibration by calculating the signed calibration bias

(the difference between accuracy and confidence). It was observed that lower λ2 often led to overconfidence, while excessively high values resulted in underconfidence. For regression, we evaluated calibration by constructing two-sided confidence intervals [ˆ y ± zpσ] across a range of theoretical confidence levels p ∈ [0, 1]. We then measured the empirical coverage by calculating the actual proportion of ground-truth values falling within these predicted intervals. As illustrated in the reliability curves, adjusting λ2 effectively shifted the model between underconfident (above the diagonal) and overconfident (below the diagonal) states. This mechanism helped align observed and expected confidence levels, thereby improving the reliability of uncertainty estimates.
4 Conclusion
In this paper, we presented UGAP, an uncertainty-guided adaptive perturbation framework designed for molecular property prediction. By selectively applying perturbations to chemically influential regions of a molecule, our approach improved the model's generalization capabilities across various chemical domains. Extensive experiments demonstrated that UGAP consistently enhanced the predictive performance of diverse GNN backbones. Furthermore, the integrated evidential calibration mechanism improved the reliability of confidence estimates for molecular property predictions. By leveraging prediction discrepancy under perturbation, this mechanism facilitated a better alignment between estimated uncertainty and actual prediction errors. These findings suggest that UGAP offers a practical solution for uncertaintyaware molecular modeling, supporting more informed and trustworthy decision-making in the drug discovery process.
Acknowledgments
This work was supported by the National Natural Science Foundation of China (62472191, 62372204); Huazhong Agricultural University Scientific & Technological Selfinnovation Foundation and Fundamental Research Funds for the Central Universities (2662024SZ006).
@inproceedings{ijcai2026p600,
title = {Uncertainty-Guided Adaptive Local Adversarial Perturbation for Reliable Molecular Property Prediction},
author = {Zhao, Xuxin and Zhang, Wen and Liu, Shichao},
booktitle = {Proceedings of the Thirty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-26}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Diego Calvanese},
pages = {5387--5395},
year = {2026},
month = {8},
note = {Main Track},
doi = {10.24963/ijcai.2026/600},
url = {https://doi.org/10.24963/ijcai.2026/600},
}
TY - CPAPER TI - Uncertainty-Guided Adaptive Local Adversarial Perturbation for Reliable Molecular Property Prediction AU - Zhao, Xuxin AU - Zhang, Wen AU - Liu, Shichao T2 - Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-26 PB - International Joint Conferences on Artificial Intelligence Organization PY - 2026 SP - 5387 EP - 5395 DO - 10.24963/ijcai.2026/600 UR - https://doi.org/10.24963/ijcai.2026/600 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: