cVTS: A Constrained Voronoi Tree Search Method for High Dimensional Analog Circuit Synthesis

A constrained Voronoi tree-based domain decomposition method for high-dimensional Bayesian optimization is proposed to solve large scale analog circuit synthesis problems, which can be formulated as high-dimensional heterogeneous black-box optimization. Hierarchical Voronoi tree progressively breaks down the design space into partitions with implicit performance boundaries such that promising regions are efficiently explored. Fast exploitation is ensured in Voronoi nest via local Bayesian optimization with a few observations. A slice-enhanced Gibbs sampling method is proposed to sample acquisition function cMES in irregular polyhedrons with design constraints. Compared with state-of-the-art methods, cVTS achieves significant speed up without loss of accuracy.

[1]  Yuandong Tian,et al.  Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Search , 2020, NeurIPS.

[2]  Leslie Pack Kaelbling,et al.  Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds , 2020, AAAI.

[3]  Cedric Archambeau,et al.  Constrained Bayesian Optimization with Max-Value Entropy Search , 2019, ArXiv.

[4]  Matthias Poloczek,et al.  Scalable Global Optimization via Local Bayesian Optimization , 2019, NeurIPS.

[5]  Matthias Poloczek,et al.  A Framework for Bayesian Optimization in Embedded Subspaces , 2019, ICML.

[6]  Fan Yang,et al.  Batch Bayesian Optimization via Multi-objective Acquisition Ensemble for Automated Analog Circuit Design , 2018, ICML.

[7]  Xuan Zeng,et al.  An Efficient Bayesian Optimization Approach for Automated Optimization of Analog Circuits , 2018, IEEE Transactions on Circuits and Systems I: Regular Papers.

[8]  Xuan Zeng,et al.  Smart-MSP: A Self-Adaptive Multiple Starting Point Optimization Approach for Analog Circuit Synthesis , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Xuan Zeng,et al.  Optimization and Quality Estimation of Circuit Design via Random Region Covering Method , 2017, ACM Trans. Design Autom. Electr. Syst..

[10]  Zi Wang,et al.  Batched Large-scale Bayesian Optimization in High-dimensional Spaces , 2017, AISTATS.

[11]  David B. Dunson,et al.  Ensemble Methods for Convex Regression with Applications to Geometric Programming Based Circuit Design , 2012, ICML.

[12]  Zheng Wang,et al.  Analog circuit optimization system based on hybrid evolutionary algorithms , 2009, Integr..

[13]  Csaba Szepesvári,et al.  Bandit Based Monte-Carlo Planning , 2006, ECML.

[14]  Radford M. Neal,et al.  Pattern recognition and machine learning , 2019, Springer US.

[15]  Petros Koumoutsakos,et al.  Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) , 2003, Evolutionary Computation.

[16]  Tamara G. Kolda,et al.  BFGS with Update Skipping and Varying Memory , 1998, SIAM J. Optim..

[17]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[18]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[19]  Mohamed S. Ebeida,et al.  VPS: VORONOI PIECEWISE SURROGATE MODELS FOR HIGH-DIMENSIONAL DATA FITTING , 2017 .

[20]  Nando de Freitas,et al.  Taking the Human Out of the Loop: A Review of Bayesian Optimization , 2016, Proceedings of the IEEE.

[21]  M. Powell.  The BOBYQA algorithm for bound constrained optimization without derivatives , 2009 .

[22]  Johan H. Huijsing,et al.  Compact low-voltage power-efficient operational amplifier cells for VLSI , 1998, IEEE J. Solid State Circuits.

[23]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .