AI Paper Atlas

Research map / Optimization / Optimizers

Hypergradient bilevel optimization

Computes approximate hypergradients to solve bilevel problems for hyperparameter optimization.

35 accepted papers at ICML, NeurIPS, ICLR, CVPR and AAAI (2018–2026) · an approach in Optimizers, keyword cluster “bilevel · inner · shot”

State History Tried Checklist Preprints Who Export

Where it stands

Not enough benchmark data Fewer than four papers report the same benchmark, so there is no record to follow.

10 papers in 2023–24 and 6 in 2025–26 (at ICML, NeurIPS, ICLR, CVPR and AAAI); its share of the topic shrank, from 4.1% to 2.1%.

How this is decided

A benchmark is tracked when at least four papers of this approach report their own method on the same dataset and metric in at least two different years. Its record is the best number reported up to 2024 compared with the best reported in 2025–26: still improving means at least 1% better, flat means at most 0.2% better with at least two papers from 2025–26 trying. Numbers on a different scale from the rest (a fraction among percentages) and far outliers are left out. Results come from different papers with different setups, so they are signals, not head-to-head comparisons. The share of papers is counted at ICML, NeurIPS, ICLR, CVPR and AAAI.

How it got here

2016: 0162017: 0172018: 1182019: 1192020: 3202021: 8212022: 6222023: 4232024: 6242025: 5252026: 126

Most cited paper of each year

Earliest papers here

What has been tried

30 papers here report 303 measured changes (a component added, removed or swapped, compared with a baseline): helped 71%, no clear effect 11%, hurt 14%, mixed 5%. Papers mostly publish changes that helped, so "helped" is over-represented.

Ablations in recent papers

What was changedMeasured onResultEffectPaper
Increase unrolled depthStreamingQA · F1HelpedMemory-Efficient Gradient Unrolling for Large-Scale Bi-level Optimization (NeurIPS 2024 · 1 citation)
Increase the SGLD temperature from tau=10^-10 to tau=10^-2Noisy synthetic 1D · lambda* error0.0019 -> 0.0008HelpedA Stochastic Approach to Bi-Level Optimization for Hyperparameter Optimization and Meta Learning (AAAI 2025 · 0 citations)
Add saving inner gradients to mixed mode and block rematerialisationGPU · HBM (G)174.8 -> 54.8HelpedScalable Meta-Learning via Mixed-Mode Differentiation (ICML 2025 · 0 citations)
Use conjugate gradient instead of gradient descent for solving the subproblemsDeterministic bilevel optimization · Hessian-vector productsO(\kappa^4 /\epsilon) -> O(\kappa^{3.5} \log \kappa/\epsilon)HelpedEfficient Curvature-Aware Hypergradient Approximation for Bilevel Optimization (ICML 2025 · 0 citations)
Smooth Swish activation search space versus non-smooth activations in NASNAS CIFAR-10 · Test Top-1 acc (%)95.870 (smooth) vs 96.070 (non-smooth)HurtMoreau Envelope for Nonconvex Bi-Level Optimization: A Single-Loop and Hessian-Free Solution Strategy (ICML 2024 · 0 citations)
vary the FOSL penalty parameter λCIFAR100 and CelebA · test AUCNo clear effectFirst-Order Minimax Bilevel Optimization (NeurIPS 2024 · 0 citations)

What reviewers will expect

Datasets and baselines named in the 5 papers of this approach from 2025–2026 that have a full-text summary. Leaving out the common ones is a frequent review question.

Baselines

  • AmIGO · 2 of 5 papers

Recent preprints

Loading recent arXiv preprints…

    Who publishes on it

    Institutions on the most papers of this approach since 2023 (of 16 papers; from OpenAlex and the papers' affiliations).

    Use it

    Download BibTeX of 31 key papersOpen the topic in the interactive map

    Get alerts. Describe your idea in scime atlas and save it (free scime account): you get a weekly email when new preprints land close to it.

    Same keyword cluster

    Elsewhere in the topic

    Benchmark numbers, ablations and baseline numbers are extracted by AI from each paper's full text and can be wrong; the paper is the authority. Data: results index of 2026-11-02, citation counts from OpenAlex (2026-10-09).

    Get the next scime Dispatch and a monthly field update

    Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy