mlsanityData to 14 Oct 2026

An Efficient Asynchronous Batch Bayesian Optimization Approach for Analog Circuit Synthesis

arXiv 2106.14683 ↗First posted 28 Jun 2021eess.SY cs.SYcited by 5

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose EasyBO, an Efficient ASYnchronous Batch Bayesian Optimization approach for analog circuit synthesis. In this proposed approach, instead of waiting for the slowest simulations in the batch to finish, we accelerate the optimization procedure by asynchronously issuing the next query points whenever there is an idle worker. We introduce a new acquisition function that can better explore the design space for asynchronous batch Bayesian optimization. A new strategy is proposed to better balance the exploration and exploitation and guarantee the diversity of the query points. And a penalization scheme is proposed to further avoid redundant queries during the asynchronous batch optimization. The efficiency of optimization can thus be further improved. Compared with the state-of-the-art batch Bayesian optimization algorithm, EasyBO achieves up to 7.35 times speed-up without sacrificing the optimization results.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 28 Jun 2021.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 0; 2025: 0; 2026: 2.

5 papers.