mlsanityData to 14 Oct 2026

An Introduction to Bi-level Optimization: Foundations and Applications in Signal Processing and Machine Learning

arXiv 2308.00788 ↗First posted 1 Aug 2023cs.LG math.OCcited by 41

Not on the map. Why?

Abstract (arXiv)

Recently, bi-level optimization (BLO) has taken center stage in some very exciting developments in the area of signal processing (SP) and machine learning (ML). Roughly speaking, BLO is a classical optimization problem that involves two levels of hierarchy (i.e., upper and lower levels), wherein obtaining the solution to the upper-level problem requires solving the lower-level one. BLO has become popular largely because it is powerful in modeling problems in SP and ML, among others, that involve optimizing nested objective functions. Prominent applications of BLO range from resource allocation for wireless systems to adversarial machine learning. In this work, we focus on a class of tractable BLO problems that often appear in SP and ML applications. We provide an overview of some basic concepts of this class of BLO problems, such as their optimality conditions, standard algorithms (including their optimization principles and practical implementations), as well as how they can be leveraged to obtain state-of-the-art results for a number of key SP and ML applications. Further, we discuss some recent advances in BLO theory, its implications for applications, and point out some limitations of the state-of-the-art that require significant future research efforts. Overall, we hope that this article can serve to accelerate the adoption of BLO as a generic tool to model, analyze, and innovate on a wide array of emerging SP and ML applications.

Key facts. Cited by 41 papers in the map (data through 14 Oct 2026). Builds on 105 of its 147 references that are in the map. First posted on arXiv 1 Aug 2023.

Builds on

105 of 147 references.

References · 105

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  3. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
  4. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
  5. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  7. 2016Matching Networks for One Shot Learningcited by 2,255
  8. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  9. 2016Identity Mappings in Deep Residual Networkscited by 1,965
  10. 2019Invariant Risk Minimizationcited by 1,854
  11. 2018DARTS: Differentiable Architecture Searchcited by 1,798
  12. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
38 more
  1. 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
  2. 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,330
  3. 2018On First-Order Meta-Learning Algorithmscited by 1,018
  4. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
  5. 2019Introduction to Online Convex Optimizationcited by 803
  6. 2015The Limitations of Deep Learning in Adversarial Settingscited by 790
  7. 2020Fast is better than free: Revisiting adversarial trainingcited by 727
  8. 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 724
  9. 2019Adversarial Training for Free!cited by 643
  10. 2016Learning to learn by gradient descent by gradient descentcited by 620
  11. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 571
  12. 2019Meta-Learning with Implicit Gradientscited by 525
  13. 2020Dataset Condensation with Gradient Matchingcited by 516
  14. 2017Progressive Neural Architecture Searchcited by 487
  15. 2022Dataset Distillation by Matching Training Trajectoriescited by 442
  16. 2018Bilevel Programming for Hyperparameter Optimization and Meta-Learningcited by 405
  17. 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 402
  18. 2018Adversarial Attacks on Neural Networks for Graph Datacited by 397
  19. 2015Gradient-based Hyperparameter Optimization through Reversible Learningcited by 360
  20. 2019Rapid Learning or Feature Reuse? Towards Understanding the Effectiveness of MAMLcited by 359
  21. 2019Momentum-Based Variance Reduction in Non-Convex SGDcited by 306
  22. 2018SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimatorcited by 287
  23. 2019PC-DARTS: Partial Channel Connections for Memory-Efficient Architecture Searchcited by 265
  24. 2020The Risks of Invariant Risk Minimizationcited by 262
  25. 2018Approximation Methods for Bilevel Programmingcited by 236
  26. 2017Forward and Reverse Gradient-Based Hyperparameter Optimizationcited by 234
  27. 2018Dataset Distillationcited by 230
  28. 2020Bilevel Optimization: Convergence Analysis and Enhanced Designcited by 222
  29. 2020Understanding and Improving Fast Adversarial Trainingcited by 214
  30. 2021Learning to Optimize: A Primer and A Benchmarkcited by 208
  31. 2017Towards Poisoning of Deep Learning Algorithms with Back-gradient Optimizationcited by 197
  32. 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 192
  33. 2018Truncated Back-propagation for Bilevel Optimizationcited by 190
  34. 2020Invariant Risk Minimization Gamescited by 188
  35. 2019You Only Propagate Once: Accelerating Adversarial Training via Maximal Principlecited by 183
  36. 2019Adaptive Gradient-Based Meta-Learning Methodscited by 183
  37. 2021Investigating Bi-Level Optimization for Learning and Vision from a Unified Perspective: A Survey and Beyondcited by 153
  38. 2020A Two-Timescale Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Criticcited by 144

50 most cited of 105 All 105 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 3; 2024: 10; 2025: 17; 2026: 11.

41 papers.

Sort:

By area:

  1. 2024Rethinking Machine Unlearning for Large Language Modelscited by 257
  2. 2024Defensive Unlearning with Adversarial Training for Robust Concept Erasure in Diffusion Modelscited by 168
  3. 2025KungfuBot: Physics-Based Humanoid Whole-Body Control for Learning Highly-Dynamic Skillscited by 52
  4. 2023Robust Mixture-of-Expert Training for Convolutional Neural Networkscited by 30
  5. 2025Think Smarter not Harder: Adaptive Reasoning with Inference Aware Optimizationcited by 29
  6. 2024WAGLE: Strategic Weight Attribution for Effective and Modular Unlearning in Large Language Modelscited by 26
  7. 2025Invariance Makes LLM Unlearning Resilient Even to Unanticipated Downstream Fine-Tuningcited by 21
  8. 2024Constrained Bi-Level Optimization: Proximal Lagrangian Value function Approach and Hessian-free Algorithmcited by 16
  9. 2024Backdoor Secrets Unveiled: Identifying Backdoor Data with Optimized Scaled Prediction Consistencycited by 13
  10. 2023Selectivity Drives Productivity: Efficient Dataset Pruning for Enhanced Transfer Learningcited by 11
  11. 2025Direct Prediction Set Minimization via Bilevel Conformal Classifier Trainingcited by 8
  12. 2025Closed-Form Last Layer Optimizationcited by 5
29 more
  1. 2024LancBiO: dynamic Lanczos-aided bilevel optimization via Krylov subspacecited by 4
  2. 2025Scalable Meta-Learning via Mixed-Mode Differentiationcited by 4
  3. 2025Downgrade to Upgrade: Optimizer Simplification Enhances Robustness in LLM Unlearningcited by 4
  4. 2024The Power of Few: Accelerating and Enhancing Data Reweighting with Coreset Selectioncited by 3
  5. 2025Efficient Curvature-Aware Hypergradient Approximation for Bilevel Optimizationcited by 3
  6. 2025WEEP: A Differentiable Nonconvex Sparse Regularizer via Weakly-Convex Envelopecited by 1
  7. 2025Stackelberg Coupling of Online Representation Learning and Reinforcement Learningcited by 1
  8. 2025Invisible Watermarks, Visible Gains: Steering Machine Unlearning with Bi-Level Watermarking Designcited by 1
  9. 2025Bridging Constraints and Stochasticity: A Fully First-Order Method for Stochastic Bilevel Optimization with Linear Constraintscited by 1
  10. 2026Efficient Bilevel Optimization with KFAC-Based Hypergradientscited by 1
  11. 2026Subspace Control: Turning Constrained Model Steering into Controllable Spectral Optimizationcited by 1
  12. 2026A Tale of Two Problems: Multi-Task Bilevel Learning Meets Equality Constrained Multi-Objective Optimizationcited by 1
  13. 2023Personalized Federated Learning via ADMM with Moreau Envelopecited by 0
  14. 2024SSP-GNN: Learning to Track via Bilevel Optimizationcited by 0
  15. 2024Towards Differentiable Multilevel Optimization: A Gradient-Based Approachcited by 0
  16. 2024Towards Convexity in Anomaly Detection: A New Formulation of SSLM with Unique Optimal Solutionscited by 0
  17. 2025Bayesian Optimization for Enhanced Language Models: Optimizing Acquisition Functionscited by 0
  18. 2025CR-BLEA: Contrastive Ranking for Adaptive Resource Allocation in Bilevel Evolutionary Algorithmscited by 0
  19. 2025Information-Theoretic Bayesian Optimization for Bilevel Optimization Problemscited by 0
  20. 2025Beyond sparse denoising in frames: minimax estimation with a scattering transformcited by 0
  21. 2025A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimizationcited by 0
  22. 2026Scaling GraphLLM with Bilevel-Optimized Sparse Queryingcited by 0
  23. 2026Constrained Triple-Head Price Optimization (C3PO) Network for Discrete-Choice Modelscited by 0
  24. 2026Prediction-Intervention Games and Invariant Setscited by 0
  25. 2026Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Levelcited by 0
  26. 2026To Solve Bilevel Optimization with Nonconvex Lower Levels, We Need Second-Order Stationaritycited by 0
  27. 2026A Light Bilevel Refinement Aligns Self-Supervised Representations for Stronger Task-Specific Learningcited by 0
  28. 2026Calibration in One Go: Jointly Learning Accurate and Calibrated Neural Networkscited by 0
  29. 2026Probabilistic Multi-Source Data Selection via Learnable Categorical Priors: Variance Reduction and Guaranteed Derandomizationcited by 0