Fast p-KGFN generates node candidates from a single EIFN optimization and evaluates the p-KGFN acquisition function on a small discrete set, achieving up to a 16x speedup with competitive optimization quality.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fast Bayesian Optimization of Function Networks with Partial Evaluations
Fast p-KGFN generates node candidates from a single EIFN optimization and evaluates the p-KGFN acquisition function on a small discrete set, achieving up to a 16x speedup with competitive optimization quality.