Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.14818 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916910217560064 |
|---|---|
| author | Lin, Jihao Andreas Mayoraz, Nicolas Rendle, Steffen Kuzmin, Dima Praun, Emil Isik, Berivan |
| author_facet | Lin, Jihao Andreas Mayoraz, Nicolas Rendle, Steffen Kuzmin, Dima Praun, Emil Isik, Berivan |
| contents | Successive Halving is a popular algorithm for hyperparameter optimization which allocates exponentially more resources to promising candidates. However, the algorithm typically relies on intermediate performance values to make resource allocation decisions, which can cause it to prematurely prune slow starters that would eventually become the best candidate. We investigate whether guiding Successive Halving with learning curve predictions based on Latent Kronecker Gaussian Processes can overcome this limitation. In a large-scale empirical study involving different neural network architectures and a click prediction dataset, we compare this predictive approach to the standard approach based on current performance values. Our experiments show that, although the predictive approach achieves competitive performance, it is not Pareto optimal compared to investing more resources into the standard approach, because it requires fully observed learning curves as training data. However, this downside could be mitigated by leveraging existing learning curve data. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_14818 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Successive Halving with Learning Curve Prediction via Latent Kronecker Gaussian Processes Lin, Jihao Andreas Mayoraz, Nicolas Rendle, Steffen Kuzmin, Dima Praun, Emil Isik, Berivan Machine Learning Successive Halving is a popular algorithm for hyperparameter optimization which allocates exponentially more resources to promising candidates. However, the algorithm typically relies on intermediate performance values to make resource allocation decisions, which can cause it to prematurely prune slow starters that would eventually become the best candidate. We investigate whether guiding Successive Halving with learning curve predictions based on Latent Kronecker Gaussian Processes can overcome this limitation. In a large-scale empirical study involving different neural network architectures and a click prediction dataset, we compare this predictive approach to the standard approach based on current performance values. Our experiments show that, although the predictive approach achieves competitive performance, it is not Pareto optimal compared to investing more resources into the standard approach, because it requires fully observed learning curves as training data. However, this downside could be mitigated by leveraging existing learning curve data. |
| title | Successive Halving with Learning Curve Prediction via Latent Kronecker Gaussian Processes |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2508.14818 |