Proceedings of the 56th Annual Design Automation Conference 2019 2019
DOI: 10.1145/3316781.3317765
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Multi-fidelity Bayesian Optimization Approach for Analog Circuit Synthesis

Abstract: This paper presents an efficient multi-fidelity Bayesian optimization approach for analog circuit synthesis. The proposed method can significantly reduce the overall computational cost by fusing the simple but potentially inaccurate low-fidelity model and a few accurate but expensive high-fidelity data. Gaussian Process (GP) models are employed to model the low-and high-fidelity blackbox functions separately. The nonlinear map between the lowfidelity model and high-fidelity model is also modelled as a Gaussian… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 45 publications
(12 citation statements)
references
References 22 publications
0
12
0
Order By: Relevance
“…The PF function can help to prioritize data points when the predictive means of all constraints satisfy design specifications and the expected constraint violation value is zero. To achieve a more extensive coverage over the Pareto front of exploration and exploitation, we also introduce the naive constraint violation measurement in equation (12) to encourage exploration. In other words, we select query points by sampling B data points from the Pareto front of the following equation:…”
Section: A Seek the First Feasible Pointmentioning
confidence: 99%
“…The PF function can help to prioritize data points when the predictive means of all constraints satisfy design specifications and the expected constraint violation value is zero. To achieve a more extensive coverage over the Pareto front of exploration and exploitation, we also introduce the naive constraint violation measurement in equation (12) to encourage exploration. In other words, we select query points by sampling B data points from the Pareto front of the following equation:…”
Section: A Seek the First Feasible Pointmentioning
confidence: 99%
“…By carefully choosing the covariance function one can embed the model with prior knowledge about the objective function to improve the predicting accuracy of the model [34]. A regression GP model is built from a training set D(X, y) where X = {x 1 , x 2 , ..., x N } denotes the input vectors with N observations, and y represents the corresponding outputs [34,35].…”
Section: Gaussian-processes-based Regression Modelsmentioning
confidence: 99%
“…Moreover, with the increase in AMS circuits complexity, increasing nonlinearity stands out as major factor limiting the capabilities of performance modeling and optimization. Hence, performance optimization techniques relying on nonparametric surrogate models and Bayesian optimization frameworks have been recently proposed [31,83]. These surrogate models are typically Gaussian Processes, and Bayesian optimization is used to find optimal values given a black-box function.…”
Section: Performance Optimizationmentioning
confidence: 99%
“…The new data collected at each step augments the training dataset to retrain a probabilistic surrogate model that approximates the black-box function. Such iterative sampling scheme contributes directly to the accuracy of the surrogate model and guides the iterative global optimization process [31,83].…”
Section: Performance Optimizationmentioning
confidence: 99%