Enhancing the Performance of Bandit-based Hyperparameter Optimization
Yile Chen, Zeyi Wen, Jian Chen, Jin Huang
摘要
Bandit-based methods are commonly used for hyperparameter optimization (HPO), which is significant in data analytics. When confronted with numerous configurations and high-dimensional large problems, existing bandit-based methods face challenges of high evaluation cost and poor optimization performance. To address these challenges, we introduce an improved bandit-based approach that exhibits enhanced evaluation ability and is suitable for situations with limited resources. Specifically, our method first effectively utilizes the feature and label information to conduct representative groups for further evaluation. After that, two kinds of folds (i.e., general folds and special folds) are constructed to facilitate better evaluation of the configuration in the cross-validation process. Additionally, we incorporate variance and subset size into the evaluation metric to comprehensively evaluate the configuration. We integrate our proposed method into three commonly used bandit-based methods, and experimental results on multiple datasets show that our method has advantages in stability with accuracy improvement of 1% to 15% on the datasets tested. In addition, since our method can avoid configurations that are low-quality but time-consuming to evaluate, it is always more efficient than the existing bandit-based methods, and can even reduce the execution time by half in some datasets. Sometimes it takes a little more time, but the improvement in accuracy can be significant.
• We investigate the challenges faced by bandit-based methods in terms of performance, stability, and time consumption when dealing with a large number of configurations and complex problems. Meanwhile, we further explore and highlight the significant impact of the subset sampling process and the cross-validation process on optimization.
• To overcome these issues, we present a method that utilizes both feature and label information to perform better subset sampling through group construction. Furthermore, we introduce general and specific folds in the cross-validation process to better evaluate configurations. We further integrate variance and subset size into the evaluation metric, which enhances the optimization performance.
• Our experimental and theoretical findings showcase the superiority of our method in terms of performance, stability, and efficiency, especially in scenarios with a large number of configurations. Our proposed method achieves accuracy improvement ranging from 1% to 10%, while consuming less time and exhibiting lower variance. Furthermore, we have successfully employed our techniques in cross-validation experiments and regression problems, which further vali-
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper3
- AutoSF: Searching Scoring Functions for Knowledge Graph EmbeddingYongqi Zhang, Quanming Yao, Wenyuan Dai, Lei ChenICDE 2020 · 被引用 89 次
- TransBO: Hyperparameter Optimization via Two-Phase Transfer LearningYang Li, Yu Shen, Huaijun Jiang, Wentao Zhang 等KDD 2022 · 被引用 12 次
- PASHA: Efficient HPO and NAS with Progressive Resource AllocationOndrej Bohdal, Lukas Balles, Martin Wistuba, Beyza Ermis 等ICLR 2023 · 被引用 4 次
相关 Paper
- MFES-HB: Efficient Hyperband with Multi-Fidelity Quality MeasurementsYang Li, Yu Shen, Jiawei Jiang, Jinyang Gao 等AAAI 2021 · 被引用 32 次
- On Speeding Up Language Model EvaluationJin Peng Zhou, Christian K. Belardi, Ruihan Wu, Travis Zhang 等ICLR 2025
- LAMDA: Two-Phase HPO via Learning Prior from Low-Fidelity DataFan Li, Shengbo Wang, Ke LiAAAI 2026
- BTTackler: A Diagnosis-based Framework for Efficient Deep Learning Hyperparameter OptimizationZhongyi Pei, Zhiyao Cen, Yipeng Huang, Chen Wang 等KDD 2024 · 被引用 1 次
- HyperJump: Accelerating HyperBand via Risk ModellingPedro Mendes, Maria Casimiro, Paolo Romano, David GarlanAAAI 2023 · 被引用 11 次
