Sign inGet started
Paper · arXiv

Stein Variational Black-Box Combinatorial Optimization

Combinatorial black-box optimization in high-dimensional settings demands a careful trade-off between exploiting promising regions of the search space and preserving sufficient exploration to identify multiple optima. Although Estimation-of-Distribution Algorithms (EDAs) provide a powerful model-based framework, they often concentrate on a single region of interest, which may result in premature convergence when facing complex or multimodal objective landscapes. In this work, we incorporate the Stein operator to introduce a repulsive mechanism among particles in the parameter space, thereby encouraging the population to disperse and jointly explore several modes of the fitness landscape. ...

AuthorsThomas Landais, Olivier Goudet, Adrien Goëffon et al.
Primary categorycs.AI
Published17 April 2026
Last updated at source17 April 2026
cs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/99d91633-76a3-4e81-8f96-76581b66426a" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.