arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.09095cs.LGmath.OC
收藏

GeoPAS: 在连续黑盒优化中用于算法选择的几何探测

Geometric Probing for Algorithm Selection in Continuous Black-Box Optimization

Duke Kunshan University(杜克昆山大学);Mohamed bin Zayed University of Artificial Intelligence(穆罕默德·本·扎耶德人工智能大学)

Jiabao Brad Wang, Xiang Shi, Yiliang Yuan, Mustafa Mısır

AI总结:

本文提出了一种几何探测框架,通过随机采样多尺度二维切片来表示问题实例,并结合有效性掩码感知的视觉池化进行聚合,从而在连续黑盒优化中实现算法选择。

摘要:

连续黑盒优化的自动化算法选择依赖于在有限探测下表示问题信息,并在具有厚尾性能分布的情况下选择求解器。本文提出了一种几何探测框架,通过随机采样多尺度二维切片来表示每个问题实例。这些切片通过有效性掩码感知的视觉池化进行编码并聚合为实例表示。然后通过结合学习的实例条件估计和算法侧经验先验的对数复合分数进行求解器选择。该框架在标准单目标黑盒优化基准套件上评估,使用十二种求解器的组合,在实例级、分组随机和问题级转移协议下进行测试。在两种套件协议下,它将单最佳求解器的平均相对预期运行时间从30.37降至3.14和3.61,同时提高了中位数和上尾性能。在问题级转移下,传统自适应设置提高了典型和中等尾部性能,但使均值被罕见极端失败所主导;一个先验重的评分变体缓解了这种失败模式,尽管其鲁棒性可能依赖于基准。结果表明,粗粒度几何探测提供了有用的求解器相关信息,而鲁棒跨问题选择也取决于度量对齐的决策评分。

英文摘要:

Automated algorithm selection for continuous black-box optimization depends on what information is acquired from a problem under a limited probing budget and how that information is represented. We introduce a geometric probing framework that samples multi-scale two-dimensional restrictions across location, orientation, and scale, and encodes their normalized objective-value maps with validity-aware convolutional processing and permutation-invariant aggregation. We compare our method with classical ELA and Deep-ELA under matched budgets, within-problem and problem-level transfer, fusion, representation, and budget analyses. We further disentangle probe acquisition from probe processing by controlled ablation. The results show that the proposed visual representation exposes solver-performance information complementary to ELA-family features and retains a relative advantage for relative expected runtime under problem-level transfer, while greater coverage, feature richness, or predictive accessibility alone does not guarantee better selection.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑