REVIEW 5 cited by
An Introduction to Bi-level Optimization: Foundations and Applications in Signal Processing and Machine Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
An Introduction to Bi-level Optimization: Foundations and Applications in Signal Processing and Machine Learning
read the original abstract
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.
Forward citations
Cited by 5 Pith papers
-
Optimization under Persistent State-Dependent Bias: Gradient-based Method and Complexity Analysis
Residual Learning, a proposed bilevel gradient method, claims exact convergence under state-dependent analog-hardware bias with rate O~(kappa1*kappa2^4*sigma^2/(mu*K)).
-
Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation
A bilevel data-curation method for LLM fine-tuning that selects validation-aligned offline data and reweights online self-refined responses via importance ratios.
-
Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method
A first-order Lagrangian penalty method is claimed to reach an ε-stationary multi-follower Stackelberg equilibrium in O(k²ε^{-6-α}) gradient evaluations.
-
Bayesian Reasoning for Physics Informed Neural Networks
Introduces Laplace-approximated Bayesian PINNs for automatic loss-weight optimization when solving PDEs such as heat, wave, and Burgers equations.
-
Bilevel learning
Bilevel learning methods rely on implicit differentiation but are restricted by assumptions of unique lower-level solutions and struggle with constraints, and connections to broader bilevel optimization literature may...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.