Polarized consensus-based dynamics for optimization and sampling

被引:2
|
作者
Bungert, Leon [1 ]
Roith, Tim [2 ]
Wacker, Philipp [3 ]
机构
[1] Univ Wurzburg, Inst Math, Wurzburg,Emil F Str 40, D-97074 Wurzburg, Germany
[2] Deutsch Elektronen Synchrotron DESY, Computat Imaging, Helmholtz Imaging, Notkestr 85, D-22607 Hamburg, Germany
[3] Univ Canterbury, Sch Math & Stat, Sci Rd, Christchurch 8140, New Zealand
基金
瑞典研究理事会;
关键词
Global optimization; Consensus-based optimization; Polarization; Sampling; GLOBAL OPTIMIZATION;
D O I
10.1007/s10107-024-02095-y
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper we propose polarized consensus-based dynamics in order to make consensus-based optimization (CBO) and sampling (CBS) applicable for objective functions with several global minima or distributions with many modes, respectively. For this, we "polarize" the dynamics with a localizing kernel and the resulting model can be viewed as a bounded confidence model for opinion formation in the presence of common objective. Instead of being attracted to a common weighted mean as in the original consensus-based methods, which prevents the detection of more than one minimum or mode, in our method every particle is attracted to a weighted mean which gives more weight to nearby particles. We prove that in the mean-field regime the polarized CBS dynamics are unbiased for Gaussian targets. We also prove that in the zero temperature limit and for sufficiently well-behaved strongly convex objectives the solution of the Fokker-Planck equation converges in the Wasserstein-2 distance to a Dirac measure at the minimizer. Finally, we propose a computationally more efficient generalization which works with a predefined number of clusters and improves upon our polarized baseline method for high-dimensional optimization.
引用
收藏
页数:31
相关论文
共 50 条
  • [21] ZERO-INERTIA LIMIT: FROM PARTICLE SWARM OPTIMIZATION TO CONSENSUS-BASED OPTIMIZATION
    Cipriani, Cristina
    Huang, Hui
    Qiu, Jinniao
    SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 2022, 54 (03) : 3091 - 3121
  • [22] Consensus-Based Quantized Algorithm for Convex Optimization with Smooth Cost Functions
    Hayashi, Naoki
    Kajiyama, Yuichi
    Takai, Shigemasa
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2020, E103A (02) : 435 - 442
  • [23] Convergence of a first-order consensus-based global optimization algorithm
    Ha, Seung-Yeal
    Jin, Shi
    Kim, Doheon
    MATHEMATICAL MODELS & METHODS IN APPLIED SCIENCES, 2020, 30 (12): : 2417 - 2444
  • [24] Convergence of Anisotropic Consensus-Based Optimization in Mean-Field Law
    Fornasier, Massimo
    Klock, Timo
    Riedl, Konstantin
    APPLICATIONS OF EVOLUTIONARY COMPUTATION (EVOAPPLICATIONS 2022), 2022, : 738 - 754
  • [25] DAdam: A Consensus-Based Distributed Adaptive Gradient Method for Online Optimization
    Nazari, Parvin
    Tarzanagh, Davoud Ataee
    Michailidis, George
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2022, 70 : 6065 - 6079
  • [26] A Consensus-Based Distributed Secondary Control Optimization Strategy for Hybrid Microgrids
    Espina, Enrique
    Cardenas-Dobson, Roberto J.
    Simpson-Porco, John W.
    Kazerani, Mehrdad
    Saez, Doris
    IEEE TRANSACTIONS ON SMART GRID, 2023, 14 (06) : 4242 - 4255
  • [27] Fast and robust consensus-based optimization via optimal feedback control
    Huang, Yuyang
    Herty, Michael
    Kalise, Dante
    Kantas, Nikolas
    arXiv,
  • [28] Consensus-based iterative learning of heterogeneous agents with application to distributed optimization
    Song, Qiang
    Meng, Deyuan
    Liu, Fang
    AUTOMATICA, 2022, 137
  • [29] Consensus-based optimization on the sphere: Convergence to global minimizers and machine learning
    Fornasier, Massimo
    Huang, Hui
    Pareschi, Lorenzo
    Sünnen, Philippe
    Journal of Machine Learning Research, 2021, 22 : 1 - 55
  • [30] Consensus-based distributed learning for robust convex optimization with a scenario approach
    Cao, Feilong
    Feng, Fan
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2021, 33 (08):