arXiv:2004.14014
Versatile Black-Box Optimization
원문 초록
Choosing automatically the right algorithm using problem descriptors is a classical component of combinatorial optimization. It is also a good tool for making evolutionary algorithms fast, robust and versatile. We present Shiwa, an algorithm good at both discrete and continuous, noisy and noise-free, sequential and parallel, black-box optimization. Our algorithm is experimentally compared to competitors on YABBOB, a BBOB comparable testbed, and on some variants of it, and then validated on several real world testbeds.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization
Learnable Evolutionary Multi-Objective Combinatorial Optimization via Sequence-to-Sequence Model
Synergizing Reinforcement Learning and Genetic Algorithms for Neural Combinatorial Optimization
Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization
Pareto Optimization with Robust Evaluation for Noisy Subset Selection
Selection of Filters for Photonic Crystal Spectrometer Using Domain-Aware Evolutionary Algorithms
토론
이 논문과 연결된 포럼 글이 아직 없습니다.