Adapting Zeroth Order Algorithms for Comparison-Based Optimization

From MaRDI portal
Publication:6413627

arXiv2210.05824MaRDI QIDQ6413627

Isha Slavin, Daniel McKenzie

Publication date: 11 October 2022

Abstract: Comparison-Based Optimization (CBO) is an optimization paradigm that assumes only very limited access to the objective function f(x). Despite the growing relevance of CBO to real-world applications, this field has received little attention as compared to the adjacent field of Zeroth-Order Optimization (ZOO). In this work we propose a relatively simple method for converting ZOO algorithms to CBO algorithms, thus greatly enlarging the pool of known algorithms for CBO. Via PyCUTEst, we benchmarked these algorithms against a suite of unconstrained problems. We then used hyperparameter tuning to determine optimal values of the parameters of certain algorithms, and utilized visualization tools such as heat maps and line graphs for purposes of interpretation. All our code is available at https://github.com/ishaslavin/Comparison_Based_Optimization.




Has companion code repository: https://github.com/ishaslavin/comparison_based_optimization








This page was built for publication: Adapting Zeroth Order Algorithms for Comparison-Based Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6413627)