A self-evolving neural architecture search framework inspired by NCA, in which a population of NCA-based controllers autonomously generates and improves candidate GNN architectures over successive generations, enabling progressive adaptation of the architecture distribution without hand-crafted design rules.
Abstract
Designing effective graph neural networks for node classification still depends heavily on human intuition, repeated trial-and-error, and expert knowledge of architectural components. To reduce this manual burden, we introduce a self-evolving neural architecture search framework inspired by Neural Cellular Automata (NCA), in which a population of NCA-based controllers autonomously generates and improves candidate GNN architectures over successive generations. Each controller encodes layer-wise architectural decisions, including layer activation, message-passing operator type, and hidden dimensionality, thereby defining a dynamic search space of graph models. The sampled architectures are trained and evaluated on node classification tasks, while their quality is assessed through a fitness function that jointly considers validation accuracy, validation loss, architectural depth, and parameter count relative to a baseline model. In this way, the proposed framework promotes not only predictive performance but also structural efficiency. Evolution proceeds through elitist retention, tournament selection, and mutation of controller parameters, enabling progressive adaptation of the architecture distribution without hand-crafted design rules.
A probabilistic L-system-inspired encoding for architecture search, where each individual is a small set of production rules and repeated rewriting generates a symbol sequence that is translated into a GNN.
Maciej Krzywda, Szymon Łukasik, Amir H. Gandomi· GECCO Companion· 0 citations
A pairwise surrogate model is introduced that predicts whether an offspring architecture is likely to outperform its parent using genotype-derived features and early training signals, enabling full evaluation only for promising candidates within the evolutionary loop.
Maciej Krzywda, Szymon Łukasik, Amir H. Gandomi· GECCO Companion· 0 citations
This work introduces Meta Neural Cellular Automata (MetaNCA), a framework that learns local rules which self-organize the weights of artificial neural networks, and shows that MetaNCA generalizes to architectures not seen during meta-training, and that architectural diversity in the training phase strengthens this gene...
Meet Barot, Daniel Berenberg, Sina Khajehabdollahi· IEEE Symposium on Artificial...· 0 citations
Network optimization driven by Artificial Intelligence (AI) is increasingly required to operate under non-stationary environments, where traffic conditions exhibit cyclic patterns as well as abrupt structural changes. Most existing learning-based approaches rely on explicit retraining or change detection, which limits...
Kazuki Sekizawa, Masaaki Yamauchi, Daichi Kominami et al.· International Conference on...· 0 citations
Evolutionary program search guided by Large Language Models (LLMs) has emerged as a powerful paradigm for automated scientific discovery. However, current approaches are fundamentally constrained by three bottlenecks: structurally blind parent selection, sparse whole-program evaluation rewards, and static mutation oper...
Ensemble-GNAS is proposed, a novel framework that integrates evolutionary GNAS with ensemble learning to address limitations of existing graph NAS algorithms and outperforms the state-of theart methods in both classification accuracy and performance stability.
Weifeng Guo, Pengyu Wang, Ying Bi et al.· IEEE Transactions on Neural...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.