Research map / Probabilistic and scientific modeling / Bayesian optimization
Deep Bayesian Optimization on Attributed Graphs
Jiaxu Cui, Bo Yang, Xia Hu
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use DGBO rather than GPs-based BO with graphlet kernels | Synthetics · Synthetics, situations (a)-(d) | objective y: situation (a): 2.815\pm0.002 -> 2.863\pm0.000; situation (b): 2.815\pm0.002 -> 2.863\pm0.000; situation (c): 2.815\pm0.0 | Mixed |
| Use the proposed graph convolution rather than existing graph kernels | Graph Bayesian optimization · Synthetics | objective y | Improved |
| Include node and edge features instead of ignoring edge features (ablation) | DGBO · Delaney | stability of finding the optimum | Improved |
| Add basis regularization to edge-feature convolution (ablation) | DGBO_Rel · ZINC | optimization performance | Improved |
| Use global attributes unrelated to the objective (ablation) | Graph optimization methods · Synthetics, situation (d) | objective y: DGBO_noRel: 2.863\pm0.000; BO_vec: 2.851\pm0.000; BO_Glets: 2.850\pm0.000; BO_dGlets: 2.821\pm0.001; GBO_dGlets: 2.849\p | Hurt |
| Use DGBO rather than VAE+GPs | Molecular optimization · ZINC | evaluations to find optimum as percentage of search space: 1.8% | Improved |
| Use DGBO rather than simulated annealing | Road network design · SiouxFalls | evaluations to find optimum: less than 420 evaluations; SA: ~3250 evaluations; nearly 7.7 times faster | Improved |
Closest papers by meaning
- Cost-aware Graph Generation: A Deep Bayesian Optimization Approach (AAAI 2021 · similarity 0.87)
- Stochastic Deep Gaussian Processes over Graphs (NeurIPS 2020 · similarity 0.86)
- Bayesian Optimisation of Functions on Graphs (NeurIPS 2023 · similarity 0.86)
- Bayesian Optimization of Functions over Node Subsets in Graphs (NeurIPS 2024 · similarity 0.85)
- Graph Posterior Network: Bayesian Predictive Uncertainty for Node Classification (NeurIPS 2021 · similarity 0.85)
- DGCLUSTER: A Neural Framework for Attributed Graph Clustering via Modularity Maximization (AAAI 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
