Enhancing Hypergradients Estimation: A Study of Preconditioning and Reparameterization
Not on the map. Why?
Abstract (arXiv)
Bilevel optimization aims to optimize an outer objective function that depends on the solution to an inner optimization problem. It is routinely used in Machine Learning, notably for hyperparameter tuning. The conventional method to compute the so-called hypergradient of the outer problem is to use the Implicit Function Theorem (IFT). As a function of the error of the inner problem resolution, we study the error of the IFT method. We analyze two strategies to reduce this error: preconditioning the IFT formula and reparameterizing the inner problem. We give a detailed account of the impact of these two modifications on the error, highlighting the role played by higher-order derivatives of the functionals at stake. Our theoretical findings explain when super efficiency, namely reaching an error on the hypergradient that depends quadratically on the error on the inner problem, is achievable and compare the two approaches when this is impossible. Numerical evaluations on hyperparameter tuning for regression problems substantiate our theoretical findings.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 23 of its 54 references that are in the map. First posted on arXiv 26 Feb 2024.
Builds on
23 of 54 references.
References · 23
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2021Convex optimizationcited by 2,479
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2019Deep Equilibrium Modelscited by 603
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
- 2016Weight Normalization: A Simple Reparameterization to Accelerate Training of Deep Neural Networkscited by 541
- 2019Meta-Learning with Implicit Gradientscited by 523
- 2018Bilevel Programming for Hyperparameter Optimization and Meta-Learningcited by 403
- 2017Forward and Reverse Gradient-Based Hyperparameter Optimizationcited by 232
- 2016Hyperparameter optimization with approximate gradientcited by 231
- 2021Efficient and Modular Implicit Differentiationcited by 199
- 2022Tutorial on amortized optimizationcited by 83
11 more
- 2022Deep Equilibrium Optical Flow Estimationcited by 63
- 2021Nonsmooth Implicit Differentiation for Machine Learning and Optimizationcited by 43
- 2020Implicit differentiation of Lasso-type models for hyperparameter optimizationcited by 34
- 2021SHINE: SHaring the INverse Estimate from the forward pass for bi-level optimization and implicit modelscited by 26
- 2022Automatic differentiation of nonsmooth iterative algorithmscited by 25
- 2022Non-Convex Bilevel Games with Critical Point Selection Mapscited by 25
- 2020Super-efficiency of automatic differentiation for functions defined as a minimumcited by 24
- 2019Automatic Differentiation of Some First-Order Methods in Parametric Optimizationcited by 18
- 2022Rethinking Initialization of the Sinkhorn Algorithmcited by 14
- 2020Differentiating the Value Function by using Convex Dualitycited by 3
- 2022Reparameterization of extreme value framework for improved Bayesian workflowcited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.