One of the most common problem-solving heuristics is by analogy. For a given problem, a solver can be viewed as a strategic walk on its fitness landscape. Thus if a solver works for one problem instance, we expect it will also be effective for other instances whose fitness landscapes essentially share structural similarities with each other. However, due to the black-box nature of combinatorial optimization, it is far from trivial to infer such similarity in real-world scenarios. To bridge this gap, by using local optima network as a proxy of fitness landscapes, this paper proposed to leverage graph data mining techniques to conduct qualitative and quantitative analyses to explore the latent topological structural information embedded in those landscapes. By conducting large-scale empirical experiments on three classic combinatorial optimization problems, we gain concrete evidence to support the existence of structural similarity between landscapes of the same classes within neighboring dimensions. We also interrogated the relationship between landscapes of different problem classes.
Augmenting Biological Fitness Prediction Benchmarks with Landscapes Features from GraphFLA
School of Computer Science and Engineering, University of Electronic Science and Technology of China(电子科技大学计算机科学与工程学院);Department of Computer Science, University of Exeter(埃克塞特大学计算机科学系)
Landscape analysis for shallow neural networks: complete classification of critical points for affine target functions
ETH Zurich(苏黎世联邦理工学院);The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳));Shenzhen Research Institute of Big Data(深圳大数据研究院);University of Münster(明斯特大学)
Improving Protein Optimization with Smoothed Fitness Landscapes
Massachusetts Institute of Technology(麻省理工学院);Czech Academy of Sciences(捷克科学院);Czech Technical University in Prague(捷克布拉格技术大学);University of Chemistry and Technology, Prague(布拉格化学与技术大学)