






























Abstract:In this paper, we study a consensus-based optimization method for nonconvex bi-level optimization, where the objective is to minimize an upper-level function over the set of global minimizers of a lower-level problem. The proposed approach is derivative-free, and constructs its consensus point via smooth quantile selection combined with a Gibbs-type Laplace approximation. We establish convergence guarantees for both the associated \textit{mean-field} dynamics and its \textit{finite-particle} approximation. In particular, under suitable assumptions on smooth quantile localization, error bounds, and stability, we show that the mean-field law reaches any arbitrary prescribed Wasserstein neighborhood of the target bi-level solution with an explicit exponential rate up to the hitting time. Numerical experiments on a two-dimensional constrained problem and neural network training further support the theoretical results.
| Subjects: | Optimization and Control (math.OC); Machine Learning (cs.LG) |
| MSC classes: | 90C26 |
| ACM classes: | G.1.6 |
| Cite as: | arXiv:2605.19667 [math.OC] |
| (or arXiv:2605.19667v1 [math.OC] for this version) | |
| https://doi.org/10.48550/arXiv.2605.19667 arXiv-issued DOI via DataCite (pending registration) |
From: Yutong Chao [view email]
[v1]
Tue, 19 May 2026 11:00:05 UTC (2,765 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。