Papers › A penalisation method for batch multi-objective Bayesian optimisation with application...

A penalisation method for batch multi-objective Bayesian optimisation with application in heat exchanger design

27 Jun 2022arXiv:2206.13326archive 2025-07-28

Andrei Paleyes, Henry B. Moss, Victor Picheny, Piotr Zulawski, Felix Newman

We present HIghly Parallelisable Pareto Optimisation (HIPPO) -- a batch acquisition function that enables multi-objective Bayesian optimisation methods to efficiently exploit parallel processing resources. Multi-Objective Bayesian Optimisation (MOBO) is a very efficient tool for tackling expensive black-box problems. However, most MOBO algorithms are designed as purely sequential strategies, and existing batch approaches are prohibitively expensive for all but the smallest of batch sizes. We show that by encouraging batch diversity through penalising evaluations with similar predicted objective values, HIPPO is able to cheaply build large batches of informative points. Our extensive experimental validation demonstrates that HIPPO is at least as efficient as existing alternatives whilst incurring an order of magnitude lower computational overhead and scaling easily to batch sizes considerably higher than currently supported in the literature. Additionally, we demonstrate the application of HIPPO to a challenging heat exchanger design problem, stressing the real-world utility of our highly parallelisable approach to MOBO.

PaperPDFCodeCode Syntology ran

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

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2206.13326")

Code

Syntology Ran 1 of 8 code samples harvested from 1 repository linked to this paper; 7 have no recorded run. Of those that ran: 1 ran · fixture could not drive it.

By repository: official repository: 8 samples from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

apaleyes/hippo officialmentioned in papertfMIT 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.

Code Syntology ran Syntology

8 samples harvested; 1 ran; 0 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · fixture could not drive it
7unverified

Licence: 0 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from apaleyes/hippo. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

heuristic_Controller apaleyes/hippo/experiments/lunar_lander/controller.py official repository ran · fixture could not drive it fingerprinted MIT (permissive) · e9de63bfc89c6e12 · report
demo_heuristic_lander apaleyes/hippo/experiments/lunar_lander/lunar_lander.py official repository unverified MIT (permissive) · d29d29c816b2ad92 · report
demo_heuristic_lander apaleyes/hippo/experiments/lunar_lander/controller.py official repository unverified MIT (permissive) · ca098982c5237ef7 · report
format_point_markers apaleyes/hippo/experiments/trieste_plotting_utils.py official repository unverified MIT (permissive) · cb19393d24269eef · report
get_true_pf apaleyes/hippo/experiments/generate_true_pareto_fronts.py official repository unverified MIT (permissive) · b733f4f0b24787b1 · report
heuristic apaleyes/hippo/experiments/lunar_lander/lunar_lander.py official repository unverified MIT (permissive) · 858e421dc259e10b · report
read_true_pf apaleyes/hippo/experiments/generate_true_pareto_fronts.py official repository unverified MIT (permissive) · 2511c610917767f0 · report
save_true_pf apaleyes/hippo/experiments/generate_true_pareto_fronts.py official repository unverified MIT (permissive) · dc7bbeefb5f5fb84 · report

Tasks

Bayesian OptimisationDiversity

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