Generative adversarial networks (GANs) have garnered considerable attention in molecular discovery for their ability to generate novel and high-quality molecules. To efficiently train a GAN model while preserving data privacy, GraphGANFed has been proposed to incorporate federated learning and graph convolutional networks into GAN. Yet, GraphGANFed cannot produce synthetic molecules that only optimize a user-defined metric(s) to facilitate the new drug discovery process. To address this issue, we introduce a novel extension to GraphGANFed, namely conditional GraphGANFed (cGraphGANFed), by incorporating the critic network to assess generated molecules using user-defined metric(s). The evaluation results from both the critic network and discriminator are integrated into the loss function of the generator, guiding it to generate novel molecules that maintain similar chemical properties to real ones while optimizing user-defined metrics. Extensive simulations are conducted in two scenarios. First, cGraphGANFed endeavors to optimize all seven commonly used metrics, and the results show that cGraphGANFed significantly outperforms GraphGANFed in Validity and LogP, with a slight advantage in QED, across different settings. Second, cGraphGANFed focuses solely on optimizing QED, and the results show that the synthetic molecules produced by cGraphGANFed can achieve more than 10% improvement in QED than GraphGANFed. Also, the results demonstrate cGraphGANFed has enhanced resilience against mode collapses and performance reduction caused by non-IID data.
MolGraphGAN provides a generalizable and experimentally usable pipeline for accelerating target-centric drug discovery in a variety of therapeutics, demonstrating scalability across multiple therapeutic classes, and embeds explainable AI protocols through the presentation of attention maps highlighting substructure hav...
Abdelrahman H. Hussein, Vikram V. Patel, Sudeep Varshney et al.· Journal of Computer-Aided Mo...· 0 citations
This work designs a dual-consistency graph augmentation method that enriches the graph topology to mitigate structural vulnerabilities and presents an adversarial masked autoen-coder to mitigate model overfitting to the perturbed graph.
Qi-Qi Zhang, Chuan-Jin Liu, Gen Liu et al.· Proceedings of the Thirty-Fi...· 0 citations
This work proposes a transferable graph purification scheme, named ProGAP, to bridge adversarial defense knowledge via vulnerability-aware graph prompt learning, and achieves 1%-9% improvement, and reduces the time consumption by up to 2.2x.
Shuo-Min Xue, Jing-Yuan Li, Ju Jia et al.· 0 citations
Various strategies and improvements to enhance GANs stability and performance are examined, including hybrid architectures that integrate GANs with other deep learning models and practical utility in domain‐specific expert systems.
An in-depth and up- to-date overview of the GANs environment, principally highlighting the progress made over 2020 and beyond and proposing the idea of hybrid generative systems in the future while emphasizing the oppositional approach's extraordinary and enduring features.
Zahraa Salah Dhaif, H. Serteep· International Journal of Adv...· 0 citations
Graph Neural Networks (GNNs) have demonstrated superior performance in various graph learning tasks such as node classification and link prediction. However, recent studies have shown that GNNs are highly vulnerable to graph adversarial attacks. To enhance the robustness of GNNs, existing defense strategies have primar...
Xiangchao Wen, Zhen Liu, Yunfei Liu· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.