Fast Hyperparameter Tuning using Bayesian Optimization with Directional Derivatives
원문 초록
In this paper we develop a Bayesian optimization based hyperparameter tuning framework inspired by statistical learning theory for classifiers. We utilize two key facts from PAC learning theory; the generalization bound will be higher for a small subset of data compared to the whole, and the highest accuracy for a small subset of data can be achieved with a simple model. We initially tune the hyperparameters on a small subset of training data using Bayesian optimization. While tuning the hyperparameters on the whole training data, we leverage the insights from the learning theory to seek more complex models. We realize this by using directional derivative signs strategically placed in the hyperparameter search space to seek a more complex model than the one obtained with small data. We demonstrate the performance of our method on the tasks of tuning the hyperparameters of several machine learning algorithms.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Attribute-Efficient PAC Learning of Sparse Halfspaces with Constant Malicious Noise Rate
Numerical and statistical analysis of NeuralODE with Runge-Kutta time integration
A Linear Theory of Multi-Winner Voting
PAC Learning is just Bipartite Matching (Sort of)
A Closer Look at the Learnability of Out-of-Distribution (OOD) Detection
Monotonic Learning in the PAC Framework: A New Perspective
토론
이 논문과 연결된 포럼 글이 아직 없습니다.