Cost-aware Graph Generation: A Deep Bayesian Optimization Approach

被引:0
作者
Cui, Jiaxu [1 ,2 ]
Yang, Bo [1 ,2 ]
Sun, Bingyi [1 ,2 ,4 ]
Liu, Jiming [3 ]
机构
[1] Jilin Univ, Coll Comp Sci & Technol, Changchun, Jilin, Peoples R China
[2] Jilin Univ, Minist Educ, Key Lab Symbol Computat & Knowledge Engn, Changchun, Jilin, Peoples R China
[3] Hong Kong Baptist Univ, Dept Comp Sci, Hong Kong, Peoples R China
[4] Natl Univ Def Technol, Natl Lab Parallel & Distributed Proc, Changsha, Hunan, Peoples R China
来源
THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE | 2021年 / 35卷
基金
中国国家自然科学基金;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graph-structured data is ubiquitous throughout the natural and social sciences, ranging from complex drug molecules to artificial neural networks. Evaluating their functional properties, e.g., drug effectiveness and prediction accuracy, is usually costly in terms of time, money, energy, or environment, becoming a bottleneck for the graph generation task. In this work, from the perspective of saving cost, we propose a novel Cost-Aware Graph Generation (CAGG) framework to generate graphs with optimal properties at as low cost as possible. By introducing a robust Bayesian graph neural network as the surrogate model and a goal-oriented training scheme for the generation model, the CAGG can approach the real expensive evaluation function and generate search space close to the optimal property, to avoid unnecessary evaluations. Intensive experiments conducted on two challenging real-world applications, including molecular discovery and neural architecture search, demonstrate its effectiveness and applicability. The results show that it can generate the optimal graphs and reduce the evaluation costs significantly compared to the state-of-the-art.
引用
收藏
页码:7142 / 7150
页数:9
相关论文
共 50 条
[21]   CAT: A Cost-Aware BitTorrent [J].
Yamazaki, Shusuke ;
Tode, Hideki ;
Murakami, Koso .
IEICE TRANSACTIONS ON COMMUNICATIONS, 2008, E91B (12) :3831-3841
[22]   Cost-aware sequential diagnostics [J].
Ganter, Bernhard .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2024, 92 (01) :59-75
[23]   Cost-Aware Replication for Dataflows [J].
Castillo, Claris ;
Tantawi, Asser N. ;
Arroyo, Diana ;
Steinder, Malgorzata .
2012 IEEE NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (NOMS), 2012, :171-178
[24]   Cost-Aware Sequential Bayesian Tasking and Decision-Making for Search and Classification [J].
Wang, Y. ;
Hussein, I. I. ;
Brown, D. R., III ;
Erwin, R. S. .
2010 AMERICAN CONTROL CONFERENCE, 2010, :6423-6428
[25]   A cost-aware IoT application deployment approach in fog computing [J].
Faraji-Mehmandar, Mohammad ;
Ghobaei-Arani, Mostafa ;
Shakarami, Ali .
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2025, 28 (03)
[26]   Cost-Aware VM Placement Across Distributed DCs Using Bayesian Networks [J].
Grygorenko, Dmytro ;
Farokhi, Soodeh ;
Brandic, Ivona .
ECONOMICS OF GRIDS, CLOUDS, SYSTEMS, AND SERVICES, GECON 2015, 2016, 9512 :32-48
[27]   Value at Adversarial Risk: A Graph Defense Strategy against Cost-Aware Attacks [J].
Liao, Junlong ;
Fu, Wenda ;
Wang, Cong ;
Wei, Zhongyu ;
Xu, Jiarong .
THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 12, 2024, :13763-13771
[28]   Cost-Aware Dynamic Bayesian Coalitional Game for Energy Trading among Microgrids [J].
Sadeghi, Mohammad ;
Mollahasani, Shahram ;
Erol-Kantarci, Melike .
2021 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS), 2021,
[29]   Elastic Provisioning of Cloud Caches: a Cost-aware TTL Approach [J].
Carra, Damiano ;
Neglia, Giovanni ;
Michiardi, Pietro .
PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON CLOUD COMPUTING (SOCC '18), 2018, :526-526
[30]   Cost-Aware Cloud Provisioning [J].
Chard, Ryan ;
Chard, Kyle ;
Bubendorfer, Kris ;
Lacinski, Lukasz ;
Madduri, Ravi ;
Foster, Ian .
2015 IEEE 11TH INTERNATIONAL CONFERENCE ON E-SCIENCE, 2015, :136-144