2015/02/11 by Dougal Maclaurin, David Duvenaud, Maclaurin, Dougal +3 · 1 voice · 403 citations
Computer Science · Mathematics · #Advanced Neural Network Applications #Algorithm #Artificial intelligence #Artificial neural network #Chaining #Computer science #Gaussian Processes and Bayesian Inference #Gradient descent #Hyperparameter #Hyperparameter optimization #Initialization #Machine Learning and Data Classification #Machine learning #Mathematical optimization #Mathematics #Momentum (technical analysis) #Parameterized complexity #Regularization (linguistics) #Stochastic gradient descent #Support vector machine #cs.LG #stat.ML
paper · pdf · doi:10.48550/arxiv.1502.03492
published in arXiv (Cornell University), 2113-2122 (Cornell University) · 10 figures. Submitted to ICML
openalex publication_date 2015/02/11 · arxiv created 2015/04/02 · arxiv updated 2015/04/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
Tuning hyperparameters of learning algorithms is hard because gradients are usually unavailable. We compute exact gradients of cross-validation performance with respect to all hyperparameters by chaining derivatives backwards through the entire training procedure. These gradients allow us to optimize thousands of hyperparameters, including step-size and momentum schedules, weight initialization distributions, richly parameterized regularization schemes, and neural network architectures. We compute hyperparameter gradients by exactly reversing the dynamics of stochastic gradient descent with momentum.