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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
GeoPAS uses multi-scale 2D geometric slices of optimization landscapes with validity-mask pooling and a learned-plus-prior composite score to select from 12 solvers, cutting mean relative expected running time from 30.37 to around 3.1-3.6 on within-suite benchmarks.
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.
-
GeoPAS: Geometric Probing for Algorithm Selection in Continuous Black-Box Optimization
GeoPAS uses multi-scale 2D geometric slices of optimization landscapes with validity-mask pooling and a learned-plus-prior composite score to select from 12 solvers, cutting mean relative expected running time from 30.37 to around 3.1-3.6 on within-suite benchmarks.