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.
Black-Box Optimization Revisited: Improving Algorithm Selection Wizards through Massive Benchmarking
Facebook AI Research(Facebook AI研究院);The Chinese University of Hong Kong(香港中文大学);Université Paris-Saclay(巴黎萨克雷大学);Université Clermont Auvergne(克莱蒙奥弗涅大学);Sorbonne Université(索邦大学)
EXaMCaP: Subset Selection with Entropy Gain Maximization for Probing Capability Gains of Large Chart Understanding Training Sets
Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China(中国科学院信息工程研究所);School of Cyberspace Security, University of Chinese Academy of Sciences, Beijing, China(中国科学院大学网络安全学院);School of Computer and Artificial Intelligence, Jiangxi University of Finance and Economics(江西财经大学计算机与人工智能学院)
DeepGD: A Multi-Objective Black-Box Test Selection Approach for Deep Neural Networks
University of Ottawa(渥太华大学);École de Technologie Supérieure(高等技术学院);Lero SFI Centre on Software Research and University of Limerick(Lero SFI软件研究中心与利默里克大学)
Stabilizing black-box model selection with the inflated argmax
Data Science Institute, University of Chicago(芝加哥大学数据科学研究所);Department of Statistics, University of Michigan(密歇根大学统计学系);Department of Statistics, University of Chicago(芝加哥大学统计学系);Department of Computer Science, University of Chicago(芝加哥大学计算机科学系)
Robust Bayesian optimization with reinforcement learned acquisition functions
Nanjing University of Aeronautics and Astronautics(南京航空航天大学);Collaborative Innovation Center of Novel Software Technology and Industrialization(新型软件技术与产业化协同创新中心);State Key Laboratory of Aerodynamics(空气动力学国家重点实验室)
WASHH: An Anchor-Aware Whale-Guided Selection Hyper-Heuristic for Continuous Optimization and SVC Configuration
Faculty of Applied Sciences, Macao Polytechnic University(澳门理工学院应用科学学院);School of Mechanical and Electrical Engineering and Automation, Shanghai University(上海大学机械与自动化工程学院);Pazhou Lab (Huangpu), Guangzhou(广州 Pazhou 实验室(黄埔));College of Animal Science and Technology, Zhongkai University of Agriculture and Engineering(仲恺农业工程学院动物科学与技术学院);Macao Polytechnic University(澳门理工学院)
Less is More: Efficient Black-box Attribution via Minimal Interpretable Subset Selection
Institute of Information Engineering, Chinese Academy of Sciences(中国科学院信息工程研究所);University of Chinese Academy of Sciences(中国科学院大学);College of Computing and Data Science, Nanyang Technological University(南洋理工大学计算机与数据科学学院);School of Artificial Intelligence, University of Science and Technology Beijing(北京科技大学人工智能学院);Department of Mechanical Engineering, Imperial College London(伦敦帝国理工学院机械工程系);Center for Machine Vision and Signal Analysis (CMVS), University of Oulu(奥卢大学机器视觉与信号分析中心);School of Cyber Science and Technology, Shenzhen Campus of Sun Yat-sen University(中山大学深圳校区计算机科学与技术学院)