Deep Ranking Ensembles for Hyperparameter Optimization

Abdus Salam Khazi, Sebastian Pineda Arango, Josif Grabocka
3/27/2023
cs.LG

No official code found. Best implementation: machinelearningnuremberg/DeepRankingEnsembles (15 stars, MIT, last commit 2024-03-26).

Abstract

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.

View on arXivView PDF

Code Implementations(1)

MIT

[ICLR 2023] Deep Ranking Ensembles for Hyperparameter Optimization

151PythonJan 24, 20232 years agoMIT
bayesian-optimizationdeep-ensembledeep-learninghyperparameter-optimizationmeta-learning+3 more

Similar Papers

Cite this paper

@article{khazi2023deep,
  title  = {Deep Ranking Ensembles for Hyperparameter Optimization},
  author = {Abdus Salam Khazi and Sebastian Pineda Arango and Josif Grabocka},
  year   = {2023},
  eprint = {2303.15212},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.15212v2},
  journal = {ICLR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.15212.svg)](https://codeofpaper.com/paper/2303.15212)

Discussion