Abstract
In this paper we consider global optimization problems and methods for solving them. The numerical solution of this class of problems is computationally challenging. The most complex problems are multicriteria problems in which the objective functions are multiextremal and non-differentiable, and, moreover, given in the form of a “black box”, i.e. calculating the objective function at a point is a time-consuming operation. Particularly, we consider an approach to acceleration of the global search using machine learning methods. At the same time, the problem of tuning the hyperparameters of the machine learning methods themselves is very important. The quality of machine learning methods is substantially affected by their hyperparameters, while the evaluation of the quality metrics is a time-consuming operation. We also consider an approach to hyperparameter tuning based on the Lipschitz global optimization. These approaches are implemented in the iOpt open-source framework of intelligent optimization methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.