D EEP R ANKING E NSEMBLES FOR H YPERPARAMETER O PTIMIZATION
Anonymous authors
Paper under double-blind review
A BSTRACT
Automatically optimizing the hyperparameters of Machine Learning algorithms is one of the primary open questions in AI.
Existing work in Hyperparameter Optimization (HPO) trains surrogate models for approximating the response surface of hyperparameters as a regression task.
In contrast, we hypothesize that the optimal strategy for training surrogates is to preserve the ranks of the performances of hyperparameter configurations as a Learning to Rank problem.
As a result, we present a novel method that meta-learns neural network surrogates optimized for ranking the configurations’ performances while modeling their uncertainty via ensembling.
In a large-scale experimental protocol comprising 12 baselines, 16 HPO search spaces and 86 datasets/tasks, we demonstrate that our method achieves new state-of-the-art results in HPO.
I NTRODUCTION
Hyperparameter Optimization (HPO) is a crucial ingredient in training state-of-the-art Machine
Learning (ML) algorithms.
The three popular families of HPO techniques are Bayesian Optimization (Hutter et al., 2019), Evolutionary Algorithms (Awad et al., 2021a), and Reinforcement Learning (Wu & Frazier, 2019; Jomaa et al., 2019).
Among these paradigms, Bayesian Optimization (BO) stands out as the most popular approach to guide the HPO search.
At its core, BO fits a parametric function (called a surrogate) to estimate the evaluated performances (e.g. validation error rates) of a set of hyperparameter configurations.
The task of fitting the surrogate to the observed data points is treated as a probabilistic regression, where the common choice for the surrogate is Gaussian Processes (GP) (Snoek et al., 2012).
Consequently, BO uses the probabilistic predictions of the configurations’ performances for exploring the search space of hyperparameters.
For an introduction to BO, we refer the interested reader to Hutter et al.
In this paper, we highlight that the current BO approach of training surrogates through a regression task is sub-optimal.
We furthermore hypothesize that fitting a surrogate to evaluated configurations is instead a learning-to-rank (L2R) problem (Burges et al., 2005).
The evaluation criterion for HPO is the performance of the top-ranked configuration.
In contrast, the regression loss measures the surrogate’s ability to estimate all observed performances and does not pay any special consideration to the top-performing configuration(s).
We propose that BO surrogates must be learned to estimate the ranks of the configurations with a special emphasis on correctly predicting the ranks of the top-performing configurations.
Unfortunately, the current BO machinery cannot be naively extended for L2R, because Gaussian
Processes (GP) are not directly applicable to ranking.
In this paper, we propose a novel paradigm to train probabilistic surrogates for learning to rank in HPO with neural network ensembles 1 .
Our networks are learned to minimize L2R listwise losses (Cao et al., 2007), and the ensemble’s uncertainty estimation is modeled by training diverse networks via the Deep Ensemble paradigm (Lakshminarayanan et al., 2017).
While there have been a few HPO-related works using flavors of basic ranking losses (Bardenet et al., 2013; Wistuba & Pedapati, 2020; ¨Ozt¨urk et al., 2022), ours is the first systematic treatment of HPO through a methodologically-principled L2R formulation.
To achieve state-of-the-art HPO results, we follow the established practice of transfer-learning the ranking surrogates from evaluations on previous datasets (Wistuba & Grabocka, 2021).
Furthermore, we boost the transfer quality by using dataset meta-features as an extra source of information (Jomaa et al., 2021a).
We conducted large-scale experiments using HPO-B (Pineda Arango et al., 2021), the largest public
HPO benchmark and compared against 12 state-of-the-art HPO baselines.
We ultimately demonstrate that our method Deep Ranking Ensembles (DRE) sets the new state-of-the-art in HPO by a statistically-significant margin.
This paper introduces three main technical contributions:
• We introduce a novel neural network BO surrogate (named Deep Ranking Ensembles) optimized with Learning-to-Rank (L2R) losses; • We propose a new technique for meta-learning our ensemble surrogate from large-scale public meta-datasets; • Deep Ranking Ensembles achieve the new state-of-the-art in HPO, demonstrated through a very large-scale experimental protocol.
R ELATED W ORK
Hyperparameter Optimization (HPO) is a problem that has been well elaborated on during the last decade.
The mainstream HPO strategies are Reinforcement Learning (RL) (Wu & Frazier, 2019), evolutionary search (Awad et al., 2021b), and Bayesian optimization (BO) (Hutter et al., 2019).
The latter comprises two main components: a surrogate function that approximates the response function given some observations, and an acquisition function that leverages the probabilistic output of the surrogate to explore the search space, ultimately deciding which point to observe next.
Previous work covers various choices for the surrogate model family, including Gaussian Processes (Snoek et al., 2012), and Bayesian Neural Networks (Springenberg et al., 2016a).
Other authors report the advantages of using ensembles as a surrogate, such as Random Forests Hutter et al.
(2011), or ensembles of neural networks White et al.
In contrast, we train BO surrogates using a learning-to-rank problem definition (Cao et al., 2007).
Transfer HPO refers to the problem definition of speeding up HPO by transferring knowledge from evaluations of hyperparameter configurations on other auxiliary datasets (Wistuba & Grabocka, 2021; Feurer et al., 2015; 2018).
For example, the hyper-parameters of a Gaussian Process can be meta-learned on previous datasets and then transferred to new tasks (Wang et al., 2021).
Similarly, a deep GP’s kernel parameters can also be meta-learned across auxiliary tasks (Wistuba &
Grabocka, 2021).
Another method trains ensembles of GPs weighted proportionally to the similarity between the new task and the auxiliary ones (Wistuba et al., 2016).
When performing transfer
HPO, it is useful to embed additional information about the dataset.
Some approaches use dataset meta-features to warm-initialize the HPO (Feurer et al., 2015; Wistuba et al., 2015), or to condition the surrogate during pre-training (Bardenet et al., 2013).
Recent works propose an attention mechanism to train dataset-aware surrogates (Wei et al., 2019), or utilizing deep sets to extract metafeatures (Jomaa et al., 2021b).
In complement to the prior work, we meta-learn ranking surrogates with meta-features.
Learning to Rank (L2R) is a problem definition that demands estimating the rank (a.k.a. relevance, or importance) of an instance in a set (Burges et al., 2005).
The primary application domain for
L2R is information retrieval (ranking websites in a search engine) (Ai et al., 2018), or e-commerce systems (ranking recommended products or advertisements) (Tang & Wang, 2018; Wu et al., 2018).
However, L2R is applicable in diverse applications, from learning distance functions among images in computer vision (Cakir et al., 2019), up to ranking financial events (Feng et al., 2021).
In this paper, we emphasize the link between HPO and L2R and train
neural surrogates for BO with L2R.
Learning to Rank for HPO is a strategy for conducting HPO with an L2R optimization approach.
There exist some literature on transfer-learning HPO methods that employ ranking objective within their transfer mechanisms.
SCoT uses a surrogate-based ranking mechanism for transferring hyperparameter configurations across datasets (Bardenet et al., 2013).
On the other hand, Feurer et al.
(2018) use a weighted ensemble of Gaussian Processes with one GP per auxiliary dataset, while the ensemble weights are learned with a pairwise ranking-based loss.
Modeling the ranks of the learning curves also helps estimate the performance of configurations in a multi-fidelity transfer setup (Wistuba & Pedapati, 2020).
Recent work has demonstrated that pair-wise ranking losses can be used for transfer-learning surrogates in a zero-shot HPO protocol ( ¨Ozt¨urk et al., 2022).
However, none of these approaches extensively study the core HPO problem with L2R, nor do they analyze which ranking loss types enable us to learn accurate BO surrogates.
D EEP R ANKING E NSEMBLES (DRE) 3. P RELIMINARIES
Hyperparameter Optimization is defined as the problem of tuning the hyperparameters x ∈ X of a ML algorithm to minimize the validation error achieved on a dataset D as arg min x ∈X
L
Val ( x, D ) .
The mainstream approach for tuning hyperparameters is Bayesian Optimization (BO), an introduction of which is offered by Hutter et al.
BO relies on fitting a surrogate function for approximating the validation error on evaluated hyperparameter configurations.
Consider having evaluated
N configurations on a dataset and their respective validation errors as H = { ( x i , y i ) } Ni =1 , where y i =
L Val ( x, D ) .
We train a surrogate function ˆ y ( x i ) =
f ( x i ; θ ) , typically a Gaussian Process, to estimate the observed y as arg max θ E ( x i ,y i ) ∼ p
H log p ( y i | x i , H/ { ( x i , y i ) } ; θ ) .
Learning to Rank (L2R) differs from a standard supervised regression because instead of directly estimating the target variable it learns to estimate the rank of the target values.
In the context of
HPO, we define the rank of a configuration as r ( x i , { y 1 , . . .
, y N } ) :
= (cid:80) Nj =1 1 y j ≤ y i .
The core of a typical L2R method (Burges et al., 2005) includes training a parametric ranker ˆ r ( x i ) :
= f
( x i ; θ ) that correctly estimates the ranks of observed configurations’ validation errors.
Instead of naively estimating the ranks as a direct regression task, i.e. arg max θ E ( x i ,r i ) ∼ p
H log p ( r i | x i ; θ ) , L2R techniques prioritize estimating the ranks of top-performing configurations more than bottomperforming ones (Cao et al., 2007).
In general ranking losses can be defined on the basis of single objects ( point-wise approach ), pairs of objects ( pair-wise approach ) or the whole list of objects ( list-wise approach )
(Chen et al., 2009).
3. D EEP R ANKING E NSEMBLE (DRE) S URROGATE
In this paper, we introduce a novel ranking model based on an ensemble of diverse neural networks optimized for L2R. We aim to learn neural networks that output the ranking score of a hyperparameter configuration s : X → R .
The ranks of the estimated scores should match the true ranks (cid:80) Nj =1 1 y j ≤ y i ≈ (cid:80) Nj =
1 1 s ( x j ; θ ) ≥ s ( x i ; θ ) , however, with a higher priority in approximating the ranks of the top-performing configurations using a weighted list-wise L2R loss (Cao et al., 2007).
First of all, we define the indices of the ranked/ordered configurations as π : { 1 , . . .
, N } → { 1 , . . .
, N } .
Concretely, the ℓ -th observed configuration is the k -th ranked configuration π ( ℓ ) =
k if k = (cid:80) Nj =1 1 y j ≤ y ℓ .
Ultimately, we train the scoring network using the following loss:
[Equation]
i =
[Equation]
( x i , y i , y, θ ) , where L ( x i , y i , y, θ ) = w (
[Equation]
( i
[Equation]
The weighting function w : { 1 , . . .
, N } → R + is defined as w ( π ( i ))
= 1 log( π ( i )+1) and is used to assign a higher penalty to the top-performing hyper-parameter configurations, whose correct rank is more important in HPO (Chen et al., 2017).
After having trained the scoring model of Equationwe estimate the rank of an unobserved configuration as ˆ r ( x ; θ ) =
(cid:80) Nj =1 1 s ( x j ; θ ) ≥ s ( x ; θ ) .
Furthermore, Bayesian Optimization (BO) needs uncertainty estimates to be able to explore the search space (Hutter et al., 2019).
As a result, we model uncertainty by training M diverse neural scorers s 1 ( x, θ 1 ) , . . .
, s M ( x, θ M ) with stochastic gradient descent.
The diversity of the ensemble scorers is ensured through the established mechanism of applying different per-scorer seeds for sampling mini-batches of hyperparameter configurations (Lakshminarayanan et al., 2017).
Finally, the posterior mean and variance of the estimated ranks is computed trivially as µ ( x ) =
1 N (cid:80) Ni
=
ˆ r ( x ; θ i ) and σ 2 ( x ) = 1 N (cid:80) Ni
=1 (ˆ r ( x ; θ i ) − µ ( x )) 2 .
The BO pseudo-code and the details for using our Deep
Rankers in HPO are explained in Appendix A.
3. M ETA - LEARNING THE D EEP R ANKING E NSEMBLES
HPO is a very challenging problem due to the limited number of evaluated hyperparameter configurations.
As a result, the current best practice in HPO relies on transfer-learning the knowledge of hyperparameters 2 from evaluations on previous datasets (Wistuba & Grabocka, 2021; Wistuba et al., 2016; Salinas et al., 2020).
In this paper, we meta-learn our ranker from K datasets assuming we have a set of observations H ( k ) :
= (cid:110)(cid:16)
[Equation]
[Equation] [Equation]
=
[Equation]
, K with N k evaluated hyperparameter configurations on the k -th dataset.
We meta-learn our ensemble of M
Deep Rankers with the meta-learning objective in Equation 2, where we learn to estimate the ranks of all observations on all evaluations for all the previous datasets using the loss of Equation 1.
[Equation]
Transfer-learning for HPO suffers from the negative-transfer phenomenon, where the distribution of the validation errors given hyperparameters changes across datasets.
In such cases, using dataset meta-features helps condition the transfer only from evaluations on similar datasets (Rakotoarison et al., 2022; Jomaa et al., 2021a).
We use the meta-features of Jomaa et al.
(2021a) which are based on a deep set formulation (Zaheer et al., 2017) of the pairwise interactions between hyperparameters and their validation errors.
The meta-feature network with parameter ϕ takes a history of evaluations
H = { ( x i , y i ) } Ni =1 as its input and outputs a L -dimensional representation of the history as z ( H, ϕ ) :
( X × R ) N → R L .
Afterward, the scorer function becomes s ( x, z ( H ; ϕ ); θ ) :
X × R L → R .
In other words, the dataset meta-features are additional features to the scorers.
A graphical depiction of our architecture is shown in Figure 1.
We update all the scorer networks of the ensemble independently using the loss of Equation 1.
The pseudo-code of Algorithm 1 draws an evaluation set (called a query set) which is used as the training batch for updating the parameters of the sampled scorer network.
We also meta-learn the metafeature network (Jomaa et al., 2021a), however, by using a different batch of evaluations (called a support set).
We do not meta-learn both the scorer and the meta-feature networks using the same batch of evaluations in order to promote generalization.
E XPERIMENTS AND R ESULTS 4. M OTIVATING E XAMPLE
We demonstrate our DRE with 10 base models on a simple sinusoid function y = sin( x + π 2 ) for x ∈ [ − 10 , 10] sampled with a step size of 0 . 1 in equally spaced intervals.
Further details on the architecture are explained in Section B.
In Figure 2, we conduct BO with a variant of DRE without meta-learning, and we start the HPO with 3 initial random observations.
We observe that a BO procedure with the Expected Improvement acquisition reaches an optimum after 8 observations.
[Figure] [Figure]
Furthermore [Figure] we plot the scorers’ and rankers’ outputs of the second BO step in Figure 3.
The analysis illustrates that the distributions of the scorers’ outputs have different ranges because the loss function in Equation 1 models only the target rank, but not the scale of the target.
However, the outputs of the rankers display similar distributions in the rank space, which is more adequate for
[Figure]
computing the ranks’ uncertainties.
Moreover, the rank distributions differ in certain regions of the search space, enabling BO to conduct exploration.
To showcase the power of transfer-learning, we meta-learn DRE on 5 auxiliary tasks, corresponding to different sinusoidal functions y = sin( x + π 2 + β ) with varying β ∈ { 11 , .., 15 } , as illustrated in
Figure 4 (left).
Subsequently, we deploy a meta-learned DRE surrogate on a test task (blue line with β = 8 ) which was not part of the meta-training set.
Figure 4 reveals that DRE directly discovers a global optimum within one BO step (4 total observations).
The success is attributed to the fact that the surrogate has been meta-learned to recognize sinusoidal shapes given the 3 initial observations in green, as is clearly shown by the acquisition in Figure 4 (right).
4. D ATASETS AND B ASELINES
We base our experiments on HPO-B (Pineda Arango et al., 2021), the largest public benchmark for HPO.
It contains 16 search spaces, each of which comprises a meta-train, meta-test, and metavalidation split.
Every split is a set of datasets, and for every dataset, the benchmark contains the validation errors of evaluated hyperparameter configurations.
The benchmark also includes the results of several HPO methods run in those datasets, including transfer and non-transfer algorithms 3 .
Moreover, we generated new results for three additional state-of-the-art baselines (GCP, HEBO, and
DKLM) that are not released by
HPO-B.
The benchmark provides 5 sets of 5 initial random seeds for every task in the meta-test split (86 in total).
We use the meta-test datasets to compare the performance of the Deep Ranker Ensembles against the baselines.
Specifically, our non-transfer HPO baselines are listed below:
• Random Search (RS) (Bergstra & Bengio, 2012) is a simple yet strong baseline that selects a random configuration at every step.
• Gaussian Processes (GP) (Snoek et al., 2012) model the response function by computing the posterior distribution of functions induced by the observed data.
• DNGO (Snoek et al., 2015) uses a neural network that models the uncertainty with a Bayesian linear regression on the last network layer.
• BOHAMIANN (Springenberg et al., 2016b) is also a Bayesian neural network that performs Bayesian inference via Hamiltonian Monte Carlo.
• Deep-Kernel Gaussian Processes (DKGP) (Wilson et al., 2016) learn a latent representation of the features that are fed to a GP kernel function.
• HEBO (Cowen-Rivers et al., 2020) is a state-of-the-art Bayesian optimization method.
It combines input and output transformations and a multi-objective acquisition function.
We use the implementation contained in the original repository.
Transfer HPO methods use the evaluations of the tasks included in the meta-train split to meta-learn surrogates, that are subsequently applied for HPO on the meta-test tasks within the same search space.
We consider the following baselines:
• TST (Wistuba et al., 2016) constructs an ensemble of Gaussian Processes aggregated with a kernel-weighted average.
Alternatively, TAF builds an ensemble of acquisition functions.
• RGPE (Feurer et al., 2018) trains a Gaussian Process per each meta-train task and then combines for a new task through a weighting scheme, which accounts for the ranking performance of every base GP model.
• FSBO (Wistuba & Grabocka, 2021) pre-trains a Deep Kernel Gaussian Process using metatrain tasks and then fine-tunes the parameters when observations for new tasks are available.
• GCP (Salinas et al., 2020) pre-trains a neural network to predict the residual performance on the auxiliary tasks and applies Gaussian Copulas to combine results for a new task.
• DKLM (Jomaa et al., 2021b) adds a Deep Set as task contextualization on top of FSBO.
We use the same hyperparameters as suggested in the original paper
4. DRE-E XPERIMENTAL S ETUP
The meta-feature extractor z is based on the Deep Set architecture proposed by Jomaa et al.
(2021a) with five hidden layers and 32 neurons per layer.
The ensemble of scorers is composed of 10 MLPs with identical architectures: four layers and 32 nuerons that we selected using the meta-validation split from
HPO-B.
We meta-learn DRE for 5000 epochs with Adam optimizer, learning rate 0.
and batch size 100.
Every element of the batch is a list of 100 elements.
We select 20% of the samples in each list as input to the meta-feature extractor.
During meta-test in every BO iteration, we update the pre-trained weights for 1000 epochs.
For DRE-RI, we initialize randomly the scorers and train them for 1000 epochs using Adam Optimizer with learning rate 0.02.
Every epoch, we use 20% of the observations to feed the meta-feature extractor.
4. R ESEARCH H YPOTHESIS AND E XPERIMENTAL R ESULTS
[Figure]
[Figure]
DKGPBOHA.
DNGORandom
Hypothesis 1.
Deep Ranking Ensembles (DRE) achieve state-of-the-art results in transfer HPO.
We compare against the transfer HPO baselines listed in Section 4.2 and report the average ranks across all the tasks in the meta-test split of all the HPO-B search spaces.
Our protocol uses 5 initial configurations plus 100 BO iterations across 16 search spaces (the default HPO-B protocol).
Our method uses meta-features (Jomaa et al., 2021a) and the scorer parameters are fine-tuned after each
BO observation.
Figure 5 (left) shows that DRE clearly outperforms all baselines over 100 BO iterations based on the rank among the HPO methods averaged among 86 datasets and 5 runs.
We compute the critical
[Figure]
A v e r ag e
R a n k
ListW-List
PairPoint
Reg
[Figure]
Number of Evaluations 2 .2 .3 .
[Figure]
[Figure]
A v e r ag e
R a n k
F,M
[Figure]
TF,M
F,TM,T
T (
[Figure]
Acquisition
[Figure]
[Figure]
Number of Evaluations
[Figure]
[Figure]
A v e r ag e
R a n k
AvgEI UCB Random difference diagram (Dem ˇ sar, 2006) for 25, 50, and 100 iterations, and show the statistical significance of the results in Figure 9a (Appendix E). HEBO is not a transfer HPO method but is presented as reference.
These results demonstrate the advantage of training neural ensembles with L2R since our method outperforms other rivals which also meta-train neural networks (FSBO, DKLM), or ensembles of neural networks (TST, TAF, RGPE).
DRE also attains competitive results in individual search space, as shown in Figure 13, at Appendix E.
Hypothesis 2.
The randomly-initialized DRE performs competitively in non-transfer HPO.
We test the hypothesis by comparing the performance of DRE against the non-transfer baselines mentioned in Section 4.2.
Similar to Experiment 1, we compute the average rank over 100 BO iterations, aggregating across all the meta-test tasks of all the search spaces in HPO-B.
The results of Figure 5 (right) show that a random initialized DRE (i.e. non meta-learned) is still a competitive surrogate for HPO.
It exhibits good performance for up to 30 iterations compared to the other baselines and is second only to HEBO (notice our meta-learned DRE actually outperforms
HEBO, Figure 5 (left)).
This demonstrates the usefulness of deep ensembles with L2R as generalpurpose HPO surrogates.
Interestingly, DRE outperforms other surrogates using neural networks, such as BOHAMIANN, DNGO, and DKGP.
We present the statistical significance of the results after 25, 50, and 100 BO iterations in Figure 9b.
Hypothesis 3.
A weighted list-wise ranking loss is the best L2R strategy for DRE.
We test DRE (meta-learned) with three different L2R losses: point-wise, pair-wise, and list-wise (weighted and non-weighted) ranking losses.
Additionally, we compare to a surrogate predicting the performance in the original scale using Mean Squared Error as loss, i.e. a regression.
Moreover, we compare the performance to a DRE trained with a regression loss.
We omit the meta-features from all variants to avoid confounding factors from the analysis and use Expected Improvement as the acquisition function.
The results in Figures 6a and 11a (Appendix E) show the advantage of the list-wise ranking losses over the other type of ranking losses.
Moreover, the results highlight the advantage of list-weighted ranking losses, as it attained the best performance over the average rank among 100 BO iterations.
Additionally, we observe that pairwise-losses also give a boost in performance compared to pointwise estimations.
The message is: ”Any L2R loss is better than the regression one”.
Hypothesis 4.
Meta-features help the transfer HPO performance of DRE.
We evaluate DRE with and without the meta-features extracted by the DeepSet module (Jomaa et al., 2021a), ablating the scenarios with and without meta-learning.
Again we use all the 16 search spaces from HPO-B for 100 BO iterations, starting with 5 random initial configurations.
DRE uses the weighted list-wise loss, and Expected Improvement as the acquisition.
Figure 6b shows the performance obtained with meta-features (F) considering meta-learning (M) and fine-tuning (T).
A missing capital letter in the label stands for an experiment without that aspect (e.g. no M means no meta-learning, etc).
The results indicate that the meta-features help DRE achieve better performance, both with and without meta-learning.
The results also highlight that fine-tuning (i.e. updating the scorer network’s parameters on the target tasks after each BO step) the meta-learned surrogate is important for achieving the best HPO performance.
Further evidence of the significance of these results is showcased in Figure 11b (Appendix E).
Hypothesis 5.
Expected Improvement is the best acquisition function for BO with DRE.
We run experiments to address how DRE performs with different acquisition functions, which use
DRE’s estimated rank uncertainty to explore the search space with Bayesian Optimization.
Concretely, we ablate the Upper Confidence Bound (UCB) and Expected Improvement (EI) acquisitions.
Additionally, we added Average Rank (Avg) which simply recommends the configuration with the highest estimated average rank, without using the posterior variance of the rank.
We also add Random Search as a reference baseline.
Further details on how we apply acquisitions in the BO loop are discussed in Appendix A.
In this experiment, we use meta-features and weighted list-wise ranking losses.
The results on Figures 6c and 10b (Appendix E) demonstrate that EI is the best choice for the acquisition function.
As UCB and EI attained overall better performances than the simple average rank (no uncertainty), we conclude the uncertainties computed by DRE are effective in exploring the search space.
4. D ISCUSSION ON DRE HYPERPARAMETERS
[Figure]
[Figure] layers and 16 neurons. Given that DRE achieves state-of-the-art results across all the 16 search spaces (see Figure 12 in Appendix E) of HPO-B by using the same configuration (e.g. number of layers for the scorers, number of layers for meta-feature extractor), we assume our settings (hyper-hyperparameters) are applicable straightforwardly to new search spaces.
Such a generalization of the hyperhyperparameters is desirable for any HPO method and liberates practitioners and researchers from having to tune DRE hyperhyperparameters.
In Figure 7 we show an ablation study comparing the performance of DRE for different numbers of layers (2, 3, 4), and different numbers of neurons per layer (16, 32, 64) on all the tasks of the meta-validation split from HPO-B.
Given the critical difference diagram in Figure 10a, we observe the performance does not change significantly when we vary any of these hyper-hyperparameters.
However, we notice that the depth of the scorer is slightly more important to tune than the number of neurons per layer.
We also notice that even an expressive ensemble of scorers (32x4) is able to generalize well on the meta-test split, as we have shown in our previous experiments.
C ONCLUSION
The presented empirical results based on a very large-scale experimental protocol provide strong evidence of the state-of-the-art performance of deep ensembles optimized through learning to rank.
We demonstrated that our method outperforms a large number of 11 baselines in both transfer and non-transfer HPO.
In addition, we validated the design choices of our method through detailed ablations and analyses.
Particularly, the results indicate the power of meta-learning surrogates from evaluations on other datasets.
Overall, we believe that this paper will set a new trend in the HPO community for moving away from regression-learned surrogate functions in Bayesian Optimization.
Future work.
Our surrogate DRE opens up an effective way to improve the HPO performance in different sub-problems, such as multi-fidelity HPO, multi-objective HPO, or neural architecture search.
Furthermore, it can be applied to more general black-box optimization problems where BO is applicable, such as drug design.
Reproducibility Statement: To promote reproducibility, we release our source code in an anonymized repository.
The source code of the baselines is also included in the repository, and we reference the original implementations whenever applicable.
All the meta-datasets are publicly available and correspondingly referenced.
Our code is available in the following repository: https://anonymous.4open.science/r/Deep-Ranking-Ensembles-F
A CKNOWLEDGEMENTS
Double-blind submission.
A B AYESIAN O PTIMIZATION WITH D EEP R ANKING E NSEMBLES
Once the Deep Ensembles are trained, we aggregate the predictions for an input x following the procedure explained in Section 3.2 to obtain µ ( x ) , σ ( x ) and conditioning to a set of observations
D s .
For the sake of simplicity, we omit this conditioning in our notation.
These outputs can be fed in several types of acquisition functions and decide for the next point x to observe from the set of pending points to evaluate X .
Notice that the lower rank, the better the configuration, therefore we formulate the cast the acquisition function as a minimization problem.
Specifically, we consider:
• Average Rank : α ( x j ) = µ ( x j ) • Lower Confidence Bound : α ( x j ) = µ ( x j ) − β · σ ( x j ) • Expected Improvement : α ( x j ) =
(cid:82) r max (0 , µ ( x k ) − r ) N ( r ; µ ( x j ) , σ ( x j ))
Where β is a factor that trades of exploitation and exploration and x i is the best-observed configuration, i.e. k = arg min i ∈{ 1 ,..., |D s |} y i and µ ( x k ) is the average rank predicted for that configuration.
The previous formulation assumes a minimization, thus to choose the next query point you apply: x = arg min x j ∈X α ( x j ) .
B E XPERIMENTAL S ETUP FOR D EEP R ANKING E NSEMBLES
Meta-Feature Extractor
The DRE model has two configurable components: the meta-feature network and the scorers.
The meta-feature extractor is a DeepSet with an architecture similar to the one used by Jomaa et al.
(2021a).
However, we used 2 fully connected layers with 32 neurons each for both ϕ and ρ (Deep Set parameters) instead of 3 fully connected layers.
The output size is set toby default.
Ensemble of Scorers
The ensemble of scorers is a group of 10 MLP (Multilayer Perceptrons) with identical architectures.
Each neural network has 4 hidden layers and each hidden layer hasneurons.
The neural networks are initialized independently and randomly (for DRE-RI) or warminitialized with the meta-learned weights.
The input size of each neural network is 16 (the dimesiionality of the meta-features), plus the HP search space dimensionality.
their output size is 1.
Setup for Motivating Example.
For the creation of the Figure 2, we use as scorer network an
MLP with 2 hidden layers and 10 neurons per layer.
The meta-feature extractor has 4 layers and 10 neurons, and output dimensions equal to 10.
The network is meta-trained for 1000 epochs, with batch size 10, learning rate 0.001, Adam Optimizer, and 10 models in the ensemble.
For the meta-learning example, we do not fine-tune the networks, while we fine-tune the networks for the non-meta-learned example for 500 iterations. [Table]
C D ISCUSSION ON L IST S IZE AND L IST W EIGHTS
[Figure] We present an additional ablation on the list size. We report the average rank on the meta-validation split for different list sizes during metatraining on Figure 8a.
Notice, that a small list size (10) leads to an underperforming setting.
Therefore, it is important to consider relative large list sizes ( 100 ≤ n ).
During meta-testing i.e. by performing BO, there is no significant overhead in terms of having a larger list size, because the true rank is derived from the observed validation accuracy of configurations.
During both meta-training, as well as the BO step, we fit our surrogate to estimate the rank of previously observed configurations that have been already evaluated.
Given n observations, computing the true rank is a simple O ( n · log( n )) sorting operation.
Notice that in BO settings n is typically small.
There are indeed several weighting schemes.
Two alternatives to the weighting factor we use (inverse log weighting) are inverse linear weighting and position-dependent attention (PDA)
(Chen et al., 2017).
As you can see in Figure 8b, inverse linear gives very small weight to lower ranks, while the position-dependent gives too much importance.
We decided to use the inverse log weighting because it gives neither too low nor too high weight to lower ranks.
For the j -th position in a list with k elements, these weights can be described as follows:
• Inverse Log: w ( j ) =
1 log( j +1) • Inverse Linear: w ( j ) =
1 j • Position-dependet attention: w ( j ) =
k − j +1 (cid:80) kt
=1 t
D D ISCUSSION ON C OMPUTATIONAL C OST
We provide here a cost comparison between DRE, FSBO and HEBO.
In the Table 1, we provide the average cost per BO step ( ± standard deviation) for different search spaces (with different dimensions).
DRE effectively incurs a cost higher than FSBO and HEBO, but < 30 seconds, which is a very small overhead compared to the cost of actually evaluating hyperparameter configurations (evaluation means the expensive process of training classifiers given the hyperparameter configurations and computing the validation accuracy).
We present additional results on the critical difference diagrams for i) Transfer methods results (Figure 9a), ii) Non-Transfer (Figure 9b, iii ) Scorer size (Figure 10a, iv ) Acquisition Function (Figure 10b, v Ranking Loss (Figure 11a) and vi Meta-features (Figure 11b).
These CD plots show the comparison of the performance at different number of trials (e.g. at 25 trials =
Rank@25).
The vertical lines connecting two methods indicate that their performances are not significantly different.
[Figure]
[Figure] [Figure]