FAB is a first-order distributed algorithm for bilevel optimization on time-varying directed graphs using AB/Push-Pull and penalty methods, with proven convergence that also settles an open question for single-level Push-Pull.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
FAB: A First-Order AB-based Gradient Algorithm for Distributed Bilevel Optimization over Time-Varying Directed Graphs
FAB is a first-order distributed algorithm for bilevel optimization on time-varying directed graphs using AB/Push-Pull and penalty methods, with proven convergence that also settles an open question for single-level Push-Pull.