# On the Convergence Theory for Hessian-Free Bilevel Algorithms

Source: [On the Convergence Theory for Hessian-Free Bilevel Algorithms](<https://www.sota2.com/research/paper/68fa59571e209131ce9b61c5>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-01-02T12:55:05.071Z

Authors: Daouda Sow, Kaiyi Ji, Yingbin Liang

Published: 2021-10-13T19:36:50.000Z

## Abstract

Bilevel optimization has arisen as a powerful tool in modern machine learning. However, due to the nested structure of bilevel optimization, even gradient-based methods require second-order derivative approximations via Jacobian- or/and Hessian-vector computations, which can be costly and unscalable in practice. Recently, Hessian-free bilevel schemes have been proposed to resolve this issue, where the general idea is to use zeroth- or first-order methods to approximate the full hypergradient of the bilevel problem. However, we empirically observe that such approximation can lead to large variance and unstable training, but estimating only the response Jacobian matrix as a partial component of the hypergradient turns out to be extremely effective. To this end, we propose a new Hessian-free method, which adopts the zeroth-order-like method to approximate the response Jacobian matrix via taking difference between two optimization paths. Theoretically, we provide the convergence rate analysis for the proposed algorithms, where our key challenge is to characterize the approximation and smoothness properties of the trajectory-dependent estimator, which can be of independent interest. This is the first known convergence rate result for this type of Hessian-free bilevel algorithms. Experimentally, we demonstrate that the proposed algorithms outperform baseline bilevel optimizers on various bilevel problems. Particularly, in our experiment on few-shot meta-learning with ResNet-12 network over the miniImageNet dataset, we show that our algorithm outperforms baseline meta-learning algorithms, while other baseline bilevel optimizers do not solve such meta-learning problems within a comparable time frame.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

- [5-way 5-shot classification convergence time on miniImageNet (test)](<https://www.sota2.com/research/sota/5-way-5-shot-classification-convergence-time-on-miniimagenet-test.md>): 5-way 5-shot Classification; miniImageNet (test); Convergence Time (67% Acc, hours): 2.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2110.07004>)

[PDF](<https://arxiv.org/pdf/2110.07004.pdf>)
