arXiv:1611.03824
Learning to Learn without Gradient Descent by Gradient Descent
원문 초록
We learn recurrent neural network optimizers trained on simple synthetic functions by gradient descent. We show that these learned optimizers exhibit a remarkable degree of transfer in that they can be used to efficiently optimize a broad range of derivative-free black-box functions, including Gaussian process bandits, simple control objectives, global optimization benchmarks and hyper-parameter tuning tasks. Up to the training horizon, the learned optimizers learn to trade-off exploration and exploitation, and compare favourably with heavily engineered Bayesian optimization packages for hyper-parameter tuning.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Improving LLM-based Global Optimization with Search Space Partitioning
Global optimization of graph acquisition functions for neural architecture search
Regularized infill criteria for multi-objective Bayesian optimization with application to aircraft design
Bayesian Optimization for Robust Identification of Ornstein-Uhlenbeck Model
BARK: A Fully Bayesian Tree Kernel for Black-box Optimization
Deterministic Global Optimization of the Acquisition Function in Bayesian Optimization: To Do or Not To Do?
토론
이 논문과 연결된 포럼 글이 아직 없습니다.