Pith. sign in

REVIEW 3 cited by

Transfer Learning for Bayesian Optimization: A Survey

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 2302.05927 v1 pith:OPBXTMPM submitted 2023-02-12 cs.LG cs.AI

classification cs.LGcs.AI
keywords optimizationbayesiandesignlearningtransferaccelerateblack-boxissue
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A wide spectrum of design and decision problems, including parameter tuning, A/B testing and drug design, intrinsically are instances of black-box optimization. Bayesian optimization (BO) is a powerful tool that models and optimizes such expensive "black-box" functions. However, at the beginning of optimization, vanilla Bayesian optimization methods often suffer from slow convergence issue due to inaccurate modeling based on few trials. To address this issue, researchers in the BO community propose to incorporate the spirit of transfer learning to accelerate optimization process, which could borrow strength from the past tasks (source tasks) to accelerate the current optimization problem (target task). This survey paper first summarizes transfer learning methods for Bayesian optimization from four perspectives: initial points design, search space design, surrogate model, and acquisition function. Then it highlights its methodological aspects and technical details for each approach. Finally, it showcases a wide range of applications and proposes promising future directions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 18 citations worldwide. Full citation record

  1. Efficient Visual Appearance Optimization by Learning from Prior Preferences

    cs.HC 2025-07 conditional novelty 6.0 of 10

    Meta-PO transfers prior users' preference models through weighted Bayesian optimization, helping new users find desired image or lighting appearances in about 4 to 8 iterations instead of 7 to 10.

  2. Are encoders able to learn landmarkers for warm-starting of Hyperparameter Optimization?

    cs.LG 2025-07 conditional novelty 5.0 of 10

    Encoders trained to reproduce landmarker distances capture that structure, but the resulting representations do not significantly improve warm-starting of Bayesian hyperparameter optimization.

  3. Towards Universal Offline Black-Box Optimization via Learning Language Model Embeddings

    cs.LG 2025-06 conditional novelty 5.0 of 10

    A string-based, metadata-guided language model framework for universal offline black-box optimization, with two variants and two embedding regularizations.

Pith tools