A k-nearest-neighbor approach constructs problem-specific algorithm portfolios that outperform both single solvers and the virtual best solver in fixed-budget black-box optimization.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NE 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Similarity-based Portfolio Construction for Black-box Optimization
A k-nearest-neighbor approach constructs problem-specific algorithm portfolios that outperform both single solvers and the virtual best solver in fixed-budget black-box optimization.