Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aoxuan Silvia Zhang

dblp:378/5372 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Optimization for machine learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
hyperparameter optimization
0.912025
Cost-Sensitive Freeze-thaw Bayesian Optimization for Efficient Hyperparameter Tuning · NeurIPS 2025
Machine learning › Optimization for machine learning › model-based optimization › bayesian optimization
multi-fidelity bayesian optimization
0.912025
Cost-Sensitive Freeze-thaw Bayesian Optimization for Efficient Hyperparameter Tuning · NeurIPS 2025
Machine learning › Optimization for machine learning › model-based optimization
bayesian optimization
0.312025
Cost-Sensitive Freeze-thaw Bayesian Optimization for Efficient Hyperparameter Tuning · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

transfer learning · 0.9surrogate modeling · 0.9acquisition function design · 0.9
YearPublicationVenuePosition
2025 Cost-Sensitive Freeze-thaw Bayesian Optimization for Efficient Hyperparameter Tuning
abstract
In this paper, we address the problem of cost-sensitive hyperparameter optimization (HPO) built upon freeze-thaw Bayesian optimization (BO). Specifically, we assume a scenario where users want to early-stop the HPO process when the expected performance improvement is not satisfactory with respect to the additional computational cost. Motivated by this scenario, we introduce \emph{utility} in the freeze-thaw framework, a function describing the trade-off between the cost and performance that can be estimated from the user's preference data. This utility function, combined with our novel acquisition function and stopping criterion, allows us to dynamically continue training the configuration that we expect to maximally improve the utility in the future, and also automatically stop the HPO process around the maximum utility. Further, we improve the sample efficiency of existing freeze-thaw methods with transfer learning to develop a specialized surrogate model for the cost-sensitive HPO problem. We validate our algorithm on established multi-fidelity HPO benchmarks and show that it outperforms all the previous freeze-thaw BO and transfer-BO baselines we consider, while achieving a significantly better trade-off between the cost and performance.
Dong Bok Lee, Aoxuan Silvia Zhang, Byungjoo Kim, Junhyeon Park, Steven Adriaensen, Juho Lee 0001, Sung Ju Hwang, Hae Beom Lee
NeurIPS2