REVIEW 2 cited by
A multiscale Consensus-Based algorithm for multi-level optimization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
A novel multiscale consensus-based optimization (CBO) algorithm for solving bi- and tri-level optimization problems is introduced. Existing CBO techniques are generalized by the proposed method through the employment of multiple interacting populations of particles, each of which is used to optimize one level of the problem. These particle populations are evolved through multiscale-in-time dynamics, which are formulated as a singularly perturbed system of stochastic differential equations. Theoretical convergence analysis for the multiscale CBO model to an averaged effective dynamics as the time-scale separation parameter approaches zero is provided. The resulting algorithm is presented for both bi-level and tri-level optimization problems. The effectiveness of the approach in tackling complex multi-level optimization tasks is demonstrated through numerical experiments on various benchmark functions. Additionally, it is shown that the proposed method performs well on min-max optimization problems, comparing favorably with existing CBO algorithms for saddle point problems.
Forward citations
Cited by 2 Pith papers
-
CB$^2$O: Consensus-Based Bi-Level Optimization
CB2O is a consensus-based optimization method with a quantile selection step that provably converges to the upper-level minimizer among the lower-level minimizers in the mean-field limit.
-
Self-interacting CBO: Existence, uniqueness, and long-time convergence
A self-interacting single-particle CBO process is shown to have its occupation measure converge polynomially to a unique invariant measure; the global-minimizer approximation remains unproven.
Discussion (0). Continue with ORCID to comment.