mlsanityData to 7 Oct 2026

Gradient-based Hyperparameter Optimization Over Long Horizons

arXiv 2007.07869 ↗First posted 15 Jul 2020cs.LG cs.CV stat.MLcited by 12

Not on the map. Why?

Abstract (arXiv)

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 ~ 104 gradient steps of unrolled optimization. We consider large hyperparameter search ranges on CIFAR-10 where we significantly outperform greedy gradient-based alternatives, while achieving × 20 speedups compared to the state-of-the-art black-box methods. Code is available at: urlhttps://github.com/polo5/FDS

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 3; 2023: 1; 2024: 5; 2025: 2; 2026: 1.

12 papers.