Pith. sign in

REVIEW 1 cited by

End-to-End Learning of Deep Kernel Acquisition Functions for Bayesian Optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.00639 v1 pith:X2DF3APM submitted 2021-11-01 stat.ML cs.AIcs.LG

classification stat.MLcs.AIcs.LG
keywords neuralacquisitionnetwork-basedtasksdatafunctionskernelslearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

For Bayesian optimization (BO) on high-dimensional data with complex structure, neural network-based kernels for Gaussian processes (GPs) have been used to learn flexible surrogate functions by the high representation power of deep learning. However, existing methods train neural networks by maximizing the marginal likelihood, which do not directly improve the BO performance. In this paper, we propose a meta-learning method for BO with neural network-based kernels that minimizes the expected gap between the true optimum value and the best value found by BO. We model a policy, which takes the current evaluated data points as input and outputs the next data point to be evaluated, by a neural network, where neural network-based kernels, GPs, and mutual information-based acquisition functions are used as its layers. With our model, the neural network-based kernel is trained to be appropriate for the acquisition function by backpropagating the gap through the acquisition function and GP. Our model is trained by a reinforcement learning framework from multiple tasks. Since the neural network is shared across different tasks, we can gather knowledge on BO from multiple training tasks, and use the knowledge for unseen test tasks. In experiments using three text document datasets, we demonstrate that the proposed method achieves better BO performance than the existing methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Monte Carlo Tree Search based Space Transfer for Black-box Optimization

    cs.LG 2024-12 conditional novelty 6.0 of 10

    MCTS-transfer uses Monte Carlo tree search to partition the search space and adaptively reweight source-task data for faster Bayesian optimization on new tasks.

Pith tools