A Global Bayesian Optimization Algorithm and Its Application to Integrated System Design
Autor: | Hakki Mert Torun, Mohamed Lamine Faycal Bellaredj, Madhavan Swaminathan, Anto Kavungal Davis |
---|---|
Rok vydání: | 2018 |
Předmět: |
Mathematical optimization
Optimization problem Computer science Bayesian optimization 020206 networking & telecommunications 02 engineering and technology 020202 computer hardware & architecture Reduction (complexity) Maxima and minima Nonlinear system Rate of convergence Hardware and Architecture Black box 0202 electrical engineering electronic engineering information engineering Systems design Algorithm design Electrical and Electronic Engineering Software |
Zdroj: | IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 26:792-802 |
ISSN: | 1557-9999 1063-8210 |
Popis: | 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 $2\times $ - $4\times $ faster as compared with previously published BO algorithms and other non-ML-based techniques. |
Databáze: | OpenAIRE |
Externí odkaz: |