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
基金
中国国家自然科学基金;
关键词
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 条
  • [31] Reliability and Cost-Aware Network Upgrade for The Next Generation Mobile Networks
    Msongaleli, Dawson Ladislaus
    Kucuk, Kerem
    2017 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENGINEERING (UBMK), 2017, : 496 - 501
  • [32] QoS and Cost-Aware Protocol Selection for Next Generation Wireless Network
    Meenakshi Munjal
    Niraj Pratap Singh
    Journal of Network and Systems Management, 2019, 27 : 327 - 350
  • [33] α-OMC: Cost-Aware Deep Learning for Mobile Network Resource Orchestration
    Bega, Dario
    Gramaglia, Marco
    Fiore, Marco
    Banchs, Albert
    Costa-Perez, Xavier
    IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (IEEE INFOCOM 2019 WKSHPS), 2019, : 423 - 428
  • [34] Cost-Aware TVM (CAT) Tensorization for Modern Deep Learning Accelerators
    Hu, Yahang
    Wang, Yaohua
    Dan, Xiaoqiang
    Hu, Xiao
    Liu, Fei
    Li, Jinpeng
    2022 IEEE 40TH INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD 2022), 2022, : 352 - 359
  • [35] Elastic Provisioning of Cloud Caches: A Cost-Aware TTL Approach
    Carra, Damiano
    Neglia, Giovanni
    Michiardi, Pietro
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2020, 28 (03) : 1283 - 1296
  • [36] Cost-aware optimization models for communication networks with renewable energy sources
    Betti, Giulio
    Amaldi, Edoardo
    Capone, Antonio
    Ercolani, Giulia
    2013 PROCEEDINGS IEEE INFOCOM, 2013, : 3231 - 3236
  • [37] QoS and Cost-Aware Protocol Selection for Next Generation Wireless Network
    Munjal, Meenakshi
    Singh, Niraj Pratap
    JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT, 2019, 27 (02) : 327 - 350
  • [38] A Multi-objective and Cost-Aware Optimization of Requirements Assignment For Review
    Li, Yan
    Yue, Tao
    Ali, Shaukat
    Zhang, Li
    2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2017, : 89 - 96
  • [39] Cost-aware capacity optimization in dynamic multi-hop WSNs
    Suhonen, Jukka
    Kohvakka, Mikko
    Kuorilehto, Mauri
    Hannikainen, Marko
    Hamalainen, Timo D.
    2007 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, VOLS 1-3, 2007, : 666 - 671
  • [40] Cost-aware ant colony optimization for resource allocation in cloud infrastructure
    Gupta P.
    Goyal U.
    Verma V.
    Recent Advances in Computer Science and Communications, 2020, 13 (03) : 326 - 335