arXiv Machine Learning By Julian G. Soltes

Hyperellipsoid Density Sampling: Exploitative Sequences to Accelerate High-Dimensional Numerical Optimization

Read the original on arXiv Machine Learning →

arXiv:2511. 07836v5 Announce Type: replace-cross Abstract: The curse of dimensionality remains a persistent challenge in modern optimization problems.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv AI
Jul 13

LLM-Driven Evolutionary Generation of Multi-Objective Bayesian Optimization Algorithms

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 Machine Learning
Jul 27

Optimization of time-consuming experimental conditions using pseudo-experimental data guided by adaptive polynomial regression

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