Optimistic bilevel optimization with manifold lower-level minimizers is differentiable if the optimistic selection is unique, yielding a pseudoinverse hyper-gradient and a convergent HG-MS algorithm whose rate depends on intrinsic manifold dimension.
arXiv preprint arXiv:2505.05991 , year=
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 3years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
unclear 1representative 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.
Sublevel sets of invex functions are connected under mild assumptions, with the result extended to solution sets in invex-incave minimax problems and incave games.
citing papers explorer
-
Select-then-differentiate: Solving Bilevel Optimization with Manifold Lower-level Solution Sets
Optimistic bilevel optimization with manifold lower-level minimizers is differentiable if the optimistic selection is unique, yielding a pseudoinverse hyper-gradient and a convergent HG-MS algorithm whose rate depends on intrinsic manifold dimension.
-
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.
-
On the Connectedness of Sublevel Sets in Invex Optimization
Sublevel sets of invex functions are connected under mild assumptions, with the result extended to solution sets in invex-incave minimax problems and incave games.