Papers › End-to-End Meta-Bayesian Optimisation with Transformer Neural Processes

End-to-End Meta-Bayesian Optimisation with Transformer Neural Processes

25 May 2023NeurIPS 2023 11arXiv:2305.15930archive 2025-07-28

Alexandre Maraval, Matthieu Zimmer, Antoine Grosnit, Haitham Bou Ammar

Meta-Bayesian optimisation (meta-BO) aims to improve the sample efficiency of Bayesian optimisation by leveraging data from related tasks. While previous methods successfully meta-learn either a surrogate model or an acquisition function independently, joint training of both components remains an open challenge. This paper proposes the first end-to-end differentiable meta-BO framework that generalises neural processes to learn acquisition functions via transformer architectures. We enable this end-to-end framework with reinforcement learning (RL) to tackle the lack of labelled acquisition data. Early on, we notice that training transformer-based neural processes from scratch with RL is challenging due to insufficient supervision, especially when rewards are sparse. We formalise this claim with a combinatorial analysis showing that the widely used notion of regret as a reward signal exhibits a logarithmic sparsity pattern in trajectory lengths. To tackle this problem, we augment the RL objective with an auxiliary task that guides part of the architecture to learn a valid probabilistic model as an inductive bias. We demonstrate that our method achieves state-of-the-art regret results against various baselines in experiments on standard hyperparameter optimisation tasks and also outperforms others in the real-world problems of mixed-integer programming tuning, antibody design, and logic synthesis for electronic design automation.

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

huawei-noah/hebo officialmentioned in papermentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Mixture of Attentions For Speculative Decoding (arXiv:2410.03804; that paper's own run record: 4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified) and Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension (arXiv:2605.23473; that paper's own run record: 20 ran (of which 9 constructed an object rather than computing a result; 16 with no instrument failure: 5 honoured, 0 violated, 11 with no contract checked; 4 where Syntology's instrument failed) · 9 unverified); nothing checks that they implement this paper's method. report
huawei-noah/HEBO officialpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Mixture of Attentions For Speculative Decoding (arXiv:2410.03804; that paper's own run record: 4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified) and Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension (arXiv:2605.23473; that paper's own run record: 20 ran (of which 9 constructed an object rather than computing a result; 16 with no instrument failure: 5 honoured, 0 violated, 11 with no contract checked; 4 where Syntology's instrument failed) · 9 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Bayesian OptimisationInductive BiasReinforcement Learning (RL)

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections