Pith. sign in

REVIEW 3 cited by

High-Dimensional Bayesian Optimisation with Variational Autoencoders and Deep Metric Learning

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 2106.03609 v3 pith:5YEOH3FL submitted 2021-06-07 cs.LG

High-Dimensional Bayesian Optimisation with Variational Autoencoders and Deep Metric Learning

classification cs.LG
keywords deeplearningmetricautoencodersbayesiandatahigh-dimensionallabelled
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We introduce a method combining variational autoencoders (VAEs) and deep metric learning to perform Bayesian optimisation (BO) over high-dimensional and structured input spaces. By adapting ideas from deep metric learning, we use label guidance from the blackbox function to structure the VAE latent space, facilitating the Gaussian process fit and yielding improved BO performance. Importantly for BO problem settings, our method operates in semi-supervised regimes where only few labelled data points are available. We run experiments on three real-world tasks, achieving state-of-the-art results on the penalised logP molecule generation benchmark using just 3% of the labelled data required by previous approaches. As a theoretical contribution, we present a proof of vanishing regret for VAE BO.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. Regret Analysis of Guided Diffusion for Black-Box Optimization over Structured Inputs

    stat.ML 2026-05 unverdicted novelty 8.0

    A certificate-based regret analysis framework for guided-diffusion black-box optimization is introduced, with mass lift as the central quantity explaining convergence from pretrained generators.

  2. Optimization of time-consuming experimental conditions using pseudo-experimental data guided by adaptive polynomial regression

    cs.LG 2026-07 conditional novelty 6.0

    PolyBO fits a polynomial to the observed experimental data, labels random search-space points with its predictions, and adds them to the Bayesian-optimization surrogate, cutting iterations to a target regret on high-d...

  3. Sample-Efficient Optimisation over the Outputs of Generative Models

    stat.ML 2025-09 unverdicted novelty 6.0

    O3 uses surrogate latent spaces extracted from generative models to perform sample-efficient black-box optimization over their outputs, outperforming direct sampling and original-latent optimization on image and prote...