Neural Cellular Automata (NCAs) are shown to learn general, scale‑invariant topological primitives in their hidden channels, which can be transferred from a teacher to a student model for few‑shot learning. The study introduces a transfer‑learning mechanism that injects pretrained hidden states into a student, improving early optimization and outperforming recurrent and feed‑forward baselines on MNIST benchmarks with only ~9,800 parameters. Mechanistic analysis reveals that hidden channels decouple feature extraction from classification, converging to mutually orthogonal states that absorb morphological complexity.
By Etienne Guichard, Stefano Nichele
arXiv:2607. 07743v1 Announce Type: cross Abstract: Self-organization is an emergent property of life, driven by the collective behavior of individual components acting on local information.
By Meet Barot, Daniel Berenberg, Sina Khajehabdollahi
arXiv:2601. 19810v2 Announce Type: replace-cross Abstract: Unsupervised pre-training can equip reinforcement learning agents with prior knowledge and accelerate learning in downstream tasks.
By Octavio Pappalardo
Learned optimization aims to improve upon hand-designed optimizers (e. g.
arXiv:2606. 31700v1 Announce Type: new Abstract: Biological neural circuits obey Dale's principle: each neuron's synapses are uniformly excitatory or inhibitory.
By Yutaro Yamada, Luca Grillotti, Rujikorn Charakorn, Sebastian Risi, David Ha, Robert Tjarko Lange
The paper proposes a method for task adaptation that eliminates the need for gradient computation during adaptation. Using a Neural Cellular Automaton, the authors train recurrent dynamics and memory read/write operations via backpropagation, then fix the slow model parameters. Online adaptation is achieved solely through local memory updates driven by prediction errors, enabling significant performance gains on new classification tasks with a single support set pass.
By Krsto Prorokovi\'c