A barrier-smoothed first-order method achieves stationarity rates of tilde O(K to the -2/3) deterministic and tilde O(K to the -2/5) stochastic for linearly constrained bilevel optimization.
Bilevel programming for hyperparameter optimization and meta-learning
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2roles
background 2representative citing papers
Establishes exponential convergence in Wasserstein distance for the mean-field limit and finite-particle approximation of a consensus-based method solving nonconvex bi-level optimization problems.
citing papers explorer
-
A Barrier-Metric First-Order Method for Linearly Constrained Bilevel Optimization
A barrier-smoothed first-order method achieves stationarity rates of tilde O(K to the -2/3) deterministic and tilde O(K to the -2/5) stochastic for linearly constrained bilevel optimization.
-
Convergence of Consensus-Based Particle Methods for Nonconvex Bi-Level Optimization
Establishes exponential convergence in Wasserstein distance for the mean-field limit and finite-particle approximation of a consensus-based method solving nonconvex bi-level optimization problems.