arXiv:2511. 07836v4 Announce Type: replace-cross Abstract: The curse of dimensionality remains a persistent challenge in modern optimization problems.
By Julian Soltes
arXiv:2111. 10722v4 Announce Type: replace-cross Abstract: We propose a novel deterministic sampling method, EVI-MMD, to approximate a target distribution $\rho^*$ by minimizing the kernel discrepancy, also known as the Maximum Mean Discrepancy (MMD).
By Yindong Chen, Yiwei Wang, Lulu Kang, Chun Liu
arXiv:2606. 09949v1 Announce Type: cross Abstract: Data-driven PDE surrogates are trained with data produced by numerical PDE solvers.
By Pierre Cesar (DATAMOVE), Sofya Dymchenko (DATAMOVE), Abhishek Purandare (DATAMOVE), Bruno Raffin (DATAMOVE)
arXiv:2607. 08791v1 Announce Type: cross Abstract: Designing effective multi-objective Bayesian optimization (MOBO) algorithms requires balancing many interdependent design choices whose optimal configuration is problem-dependent and typically demands deep expertise.
By Georgios Laskaris, Reuben Brasher, Niki van Stein, Elena Raponi, Thomas B\"ack, Florian Neukart
arXiv:2607. 19031v1 Announce Type: new Abstract: Automated algorithm selection in black-box optimization typically relies on supervised models that map landscape features to algorithm performance labels.
By Yihang Lu, Tome Eftimov, Carola Doerr
arXiv:2607. 22238v1 Announce Type: new Abstract: Bayesian optimization (BO) is an optimization method that sequentially proposes the next candidate explainable variables for optimizing target variables by balancing exploration and exploitation.
By Hirotaka Sugawara, Yujin Taguchi, Kei Minagawa, Yusuke Hiki, Takashi Morikura, Akira Funahashi