Papers › Automated Hyperparameter Optimization Challenge at CIKM 2021 AnalyticCup

Automated Hyperparameter Optimization Challenge at CIKM 2021 AnalyticCup

31 Oct 2021arXiv:2111.00513archive 2025-07-28

Huaijun Jiang, Yu Shen, Yang Li

In this paper, we describe our method for tackling the automated hyperparameter optimization challenge in QQ Browser 2021 AI Algorithm Competiton (ACM CIKM 2021 AnalyticCup Track 2). The competition organizers provide anonymized realistic industrial tasks and datasets for black-box optimization. Based on our open-sourced package OpenBox, we adopt the Bayesian optimization framework for configuration sampling and a heuristic early stopping strategy. We won first place in both the preliminary and final contests with the results of 0.938291 and 0.918753, respectively.

PaperPDFCode

Syntology This paper's arXiv id is not in Syntology's Atlas id list (549,449 ids, as this build read them; the read time is in the build record), so this page links to no Syntology page for it. The list is not the whole graph; Syntology's feed shows papers as they enter the graph.

Code

PKU-DAIR/open-box officialmentioned in paperNOASSERTIONSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Bayesian OptimizationHyperparameter Optimization

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Early Stopping

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections