Black-Box Optimization in Machine Learning with Trust Region Based Derivative Free Algorithm
read the original abstract
In this work, we utilize a Trust Region based Derivative Free Optimization (DFO-TR) method to directly maximize the Area Under Receiver Operating Characteristic Curve (AUC), which is a nonsmooth, noisy function. We show that AUC is a smooth function, in expectation, if the distributions of the positive and negative data points obey a jointly normal distribution. The practical performance of this algorithm is compared to three prominent Bayesian optimization methods and random search. The presented numerical results show that DFO-TR surpasses Bayesian optimization and random search on various black-box optimization problem, such as maximizing AUC and hyperparameter tuning.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization
Proposes CLARSTA, a random subspace trust-region algorithm for convex-constrained DFO with new projection-based model class, geometry measure, and concentration-of-measure subspace sampling, proving almost-sure conver...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.