.png){kind=icon}
.png){kind=icon}
Return
Stochastic Frank-Wolfe Algorithm for Constrained Bilevel Optimization With Improved Per-Iteration Complexity
.png){kind=icon}
PRE
AI
DOI：10.1109/TSP.2025.3596231.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Bilevel optimization, where one optimization problem is inherently nested within another, has gained significant attention due to its extensive applications in machine learning, such as hyperparameter optimization and meta-learning. Most existing algorithms are designed to address unconstrained bilevel optimization problems, with few are capable of effectively tackling complex constrained settings. To address this gap, we propose a novel, fully single-loop stochastic Frank-Wolfe algorithm. This algorithm incorporates a Hessian-inverse-vector approximation technique, momentum-based gradient tracking, and a Frank-Wolfe update. Our proposed algorithm improves per-iteration complexity and achieves lower sample complexity compared to existing Frank-Wolfe algorithms for bilevel optimization. We also conduct numerical simulations to demonstrate the efficacy of our algorithm compared to state-of-the-art methods.
Keywords:
Stochastic Frank-Wolfe algorithm
bilevel optimization
hypergradient approximation
variance reduction technique
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W