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 条
[41]   Cost-aware optimization models for communication networks with renewable energy sources [J].
Betti, Giulio ;
Amaldi, Edoardo ;
Capone, Antonio ;
Ercolani, Giulia .
2013 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2013, :25-30
[42]   Cost-aware edge server placement [J].
Zhang, Qiyang ;
Wang, Shangguang ;
Zhou, Ao ;
Ma, Xiao .
INTERNATIONAL JOURNAL OF WEB AND GRID SERVICES, 2022, 18 (01) :83-98
[43]   Cost-Aware Mobile Web Browsing [J].
Chava, Sindhura ;
Ennaji, Rachid ;
Chen, Jay ;
Subramanian, Lakshminarayanan .
IEEE PERVASIVE COMPUTING, 2012, 11 (03) :34-42
[44]   Towards Cost-Aware Multipath Routing [J].
Araujo, Joao Taveira ;
Rio, Miguel ;
Pavlou, George .
SCALABILITY OF NETWORKS AND SERVICES, PROCEEDINGS, 2009, 5637 :207-210
[45]   Cost-Aware Bayesian Sequential Decision-Making for Domain Search and Object Classification [J].
Wang, Y. ;
Hussein, I. I. ;
Brown, D. R., III ;
Erwin, R. S. .
49TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2010, :7196-7201
[46]   Cost-aware process modeling in multiclouds [J].
Ritter, Daniel .
INFORMATION SYSTEMS, 2022, 108
[47]   Cost-Aware Automatic Program Repair [J].
Samanta, Roopsha ;
Olivo, Oswaldo ;
Emerson, E. Allen .
STATIC ANALYSIS (SAS 2014), 2014, 8723 :268-284
[48]   Kingfisher: Cost-aware Elasticity in the Cloud [J].
Sharma, Upendra ;
Shenoy, Prashant ;
Sahu, Sambit ;
Shaikh, Anees .
2011 PROCEEDINGS IEEE INFOCOM, 2011, :206-210
[49]   An Access Cost-Aware Approach for Object Retrieval over Multiple Sources [J].
Arai, Benjamin ;
Das, Gautam ;
Gunopulos, Dimitrios ;
Hristidis, Vagelis ;
Koudas, Nick .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2010, 3 (01) :1125-1136
[50]   A metalanguage for cost-aware denotational semantics [J].
Niu, Yue ;
Harper, Robert .
2023 38TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS, 2023,