Early-Stopping Thresholds for ES-HyperNEAT: A Data-Driven Approach from Fitness Dynamics

📅 2026-09-11
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
研究针对ES-HyperNEAT算法中网络性能停滞问题,通过早期适应度轨迹的二分类方法确定最优停止阈值,有效减少了计算资源浪费。
📝 Abstract
Most hyperparameter configurations for Evolvable-Substrate HyperNEAT (ES-HyperNEAT) produce networks that stagnate at random-guessing performance, wasting computational resources. We frame early stopping as binary classification on early fitness trajectories: for each trial, we compute the cumulative median of best-per-generation fitness and test it against a threshold derived by maximizing the F1 score on an initial 90-trial dataset. The resulting rule (generation G* = 3, threshold T* = 0.140) achieves F1 = 0.872 on 180 independent validation trials, retaining over 90% of successful trials while cutting computational cost by 41.6%. Compared to Hyperband, our domain-specific rule is 64% more efficient with higher mean fitness, though Hyperband occasionally discovers higher peak solutions. On a converged search population the rule becomes too aggressive (recall 31.1%), motivating adaptive thresholds. The specific thresholds are ES-HyperNEAT-specific, but the methodology, deriving stopping criteria from fitness dynamics classification, is applicable to other evolutionary algorithms with stagnation-prone hyperparameter spaces.
Problem

Research questions and friction points this paper is trying to address.

ES-HyperNEAT
hyperparameter configurations
stagnate
random-guessing performance
computational resources
Innovation

Methods, ideas, or system contributions that make the work stand out.

early stopping
fitness dynamics
data-driven approach
threshold
R
Romain Claret
University of Neuchâtel, Switzerland; Information Management Institute
A
Arthur Gygax
University of Neuchâtel, Switzerland; Computer Science Department
Michael O'Neill
Michael O'Neill
Natural Computing Research & Applications Group, University College Dublin, Ireland
P
Paul Cotofrei
University of Neuchâtel, Switzerland; Information Management Institute
Pascal Felber
Pascal Felber
Professor of Computer Science, University of Neuchâtel
Distributed SystemsDependabilityConcurrent Programming