Papers › qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal...

qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling

24 Oct 2023arXiv:2310.15788archive 2025-07-28

Ashwin Renganathan, Kade E. Carlson

Classical evolutionary approaches for multiobjective optimization are quite accurate but incur a lot of queries to the objectives; this can be prohibitive when objectives are expensive oracles. A sample-efficient approach to solving multiobjective optimization is via Gaussian process (GP) surrogates and Bayesian optimization (BO). Multiobjective Bayesian optimization (MOBO) involves the construction of an acquisition function which is optimized to acquire new observation candidates sequentially. This ``inner'' optimization can be hard due to various reasons: acquisition functions being nonconvex, nondifferentiable and/or unavailable in analytical form; batch sampling usually exacerbates these problems and the success of MOBO heavily relies on this inner optimization. This, ultimately, affects their sample efficiency. To overcome these challenges, we propose a Thompson sampling (TS) based approach (qPOTS). Whereas TS chooses candidates according to the probability that they are optimal, qPOTS chooses candidates according to the probability that they are Pareto optimal. Instead of a hard acquisition function optimization, qPOTS solves a cheap multiobjective optimization on the GP posteriors with evolutionary approaches. This way we get the best of both worlds: accuracy of evolutionary approaches and sample-efficiency of MOBO. New candidates are chosen on the posterior GP Pareto frontier according to a maximin distance criterion. qPOTS is endowed with theoretical guarantees, a natural exploration-exploitation trade-off, and superior empirical performance.

PaperPDFCode

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

csdlpsu/qpots officialmentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Multi-Objective Bayesian Optimization via Adaptive ε-Constraints Decomposition (arXiv:2604.15959; that paper's own run record: 5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 4 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 OptimizationComputational EfficiencyMultiobjective OptimizationThompson Sampling

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Gaussian ProcessSET

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