A Global Bayesian Optimization Algorithm and Its Application to Integrated System Design
Increasing levels of system integration pose difficulties in meeting design specifications for high-performance systems. Oftentimes increased complexity, nonlinearity, and multiple tradeoffs need to be handled simultaneously during the design cycle. Since components in such systems are highly correl...
Uloženo v:
| Vydáno v: | IEEE transactions on very large scale integration (VLSI) systems Ročník 26; číslo 4; s. 792 - 802 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.04.2018
|
| Témata: | |
| ISSN: | 1063-8210, 1557-9999 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Increasing levels of system integration pose difficulties in meeting design specifications for high-performance systems. Oftentimes increased complexity, nonlinearity, and multiple tradeoffs need to be handled simultaneously during the design cycle. Since components in such systems are highly correlated with each other, codesign and co-optimization of the complete system are required. Machine learning (ML) provides opportunities for analyzing such systems with multiple control parameters, where techniques based on Bayesian optimization (BO) can be used to meet or exceed design specifications. In this paper, we propose a new BO-based global optimization algorithm titled Two-Stage BO (TSBO). TSBO can be applied to black box optimization problems where the computational time can be reduced through a reduction in the number of simulations required. Empirical analysis on a set of popular challenge functions with several local extrema and dimensions shows TSBO to have a faster convergence rate as compared with other optimization methods. In this paper, TSBO has been applied for clock skew minimization in 3-D integrated circuits and multiobjective co-optimization for maximizing efficiency in integrated voltage regulators. The results show that TSBO is between <inline-formula> <tex-math notation="LaTeX">2\times </tex-math></inline-formula>-<inline-formula> <tex-math notation="LaTeX">4\times </tex-math></inline-formula> faster as compared with previously published BO algorithms and other non-ML-based techniques. |
|---|---|
| ISSN: | 1063-8210 1557-9999 |
| DOI: | 10.1109/TVLSI.2017.2784783 |