paper-with-me

Papers

Gradient-based Hyperparameter Optimization Over Long Horizons

2020-07-15 · NeurIPS 2021 12 · Paul Micaelli, Amos Storkey

Gradient-based hyperparameter optimization has earned a widespread popularity in the context of few-shot meta-learning, but remains broadly impractical for tasks with long horizons (many gradient steps), due to memory scaling and gradient degradation issues. A common workaround is to learn hyperparameters online, but this introduces greediness which comes with a significant performance drop. We propose forward-mode differentiation with sharing (FDS), a simple and efficient algorithm which tackles memory scaling issues with forward-mode differentiation, and gradient degradation issues by sharing hyperparameters that are contiguous in time. We provide theoretical guarantees about the noise reduction properties of our algorithm, and demonstrate its efficiency empirically by differentiating through $\sim 10^4$ gradient steps of unrolled optimization. We consider large hyperparameter search ranges on CIFAR-10 where we significantly outperform greedy gradient-based alternatives, while achieving $\times 20$ speedups compared to the state-of-the-art black-box methods. Code is available at: \url{https://github.com/polo5/FDS}

📄 PDF Abstract BibTeX arXiv:2007.07869

Code (1)

polo5/fds 공식 구현 pytorch

Tasks

Hyperparameter OptimizationMeta-Learning

Methods 이 논문이 사용한 방법론

Weight Decay 설명 없음
SGD Stochastic Gradient Descent is an iterative optimization technique that uses minibatches of data to form an expectation of the gradient, rather than the full gradient using…

Similar Papers 제목 키워드 기반

Non-greedy Gradient-based Hyperparameter Optimization Over Long Horizons

2020-09-28 · Paul Micaelli, Amos Storkey

Gradient-based meta-learning has earned a widespread popularity in few-shot learning, but remains broadly impractical for tasks with long horizons (many gradient steps), due to memory scaling and gradient degradation iss…

Few-Shot LearningHyperparameter OptimizationMeta-Learning

Scaling Optimal LR Across Token Horizons

2024-09-30 · Johan Bjorck, Alon Benhaim, Vishrav Chaudhary, Furu Wei 외

State-of-the-art LLMs are powered by scaling -- scaling model size, dataset size and cluster size. It is economically infeasible to extensively tune hyperparameter for the largest runs. Instead, approximately optimal hyp…

Temporal horizons in forecasting: a performance-learnability trade-off

2025-06-04 · Pau Vilimelis Aceituno, Jack William Miller, Noah Marti, Youssef Farag 외

When training autoregressive models to forecast dynamical systems, a critical question arises: how far into the future should the model be trained to predict? Too short a horizon may miss long-term trends, while too long…

Hyperparameter Optimization

Learning Gradient Descent: Better Generalization and Longer Horizons

2017-03-10 · ICML 2017 8 · Kaifeng Lv, Shunhua Jiang, Jian Li

Training deep neural networks is a highly nontrivial task, involving carefully selecting appropriate training algorithms, scheduling step sizes and tuning other hyperparameters. Trying different combinations can be quite…

Scheduling

Learning Provably Improves the Convergence of Gradient Descent

2025-01-30 · Qingyu Song, Wei Lin, Hong Xu

Learn to Optimize (L2O) trains deep neural network based solvers for optimization, achieving success in accelerating convex problems and improving non-convex solutions. However, L2O lacks rigorous theoretical backing for…