Solving Black-Box Optimization Challenge via Learning Search Space Partition for Local Bayesian Optimization
Black-box optimization is one of the vital tasks in machine learning, since\nit approximates real-world conditions, in that we do not always know all the\nproperties of a given system, up to knowing almost nothing but the results.\nThis paper describes our approach to solving the black-box optimization\nchallenge at NeurIPS 2020 through learning search space partition for local\nBayesian optimization. We describe the task of the challenge as well as our\nalgorithm for low budget optimization that we named \\texttt{SPBOpt}. We\noptimize the hyper-parameters of our algorithm for the competition finals using\nmulti-task Bayesian optimization on results from the first two evaluation\nsettings. Our approach has ranked third in the competition finals.\n