Artificial neural networks trained with gradient descent (GD) are widely used to model brain learning, but GD allows synapses to switch between excitatory and inhibitory and produces weight distributions unlike those observed experimentally. We show that an alternative rule, exponentiated gradient (EG), avoids these pr...
Jonathan Cornford, Roman Pogodin, Arna Ghosh et al.· Neuron· 0 citations
Continual learning is typically framed as acquiring new knowledge without catastrophically forgetting previous tasks. However, a flexible continual learner should also be able to reuse and recombine previously acquired knowledge to rapidly solve novel task compositions. We introduce Gated Target Propagation (GaTaP), a...
Abdel Mfougouon Njupoun, C. Bredenberg, B. Richards et al.· 0 citations
This work test the reasoning capabilities of Neural Cellular Automata, networks of recurrent cells that use strictly local connectivity and asynchronous updates, and shows that NCAs are robust reasoners capable of dynamically modulating compute to recover efficiently from damage, and that they can scale to solve reason...
Mayalen Etcheverry, Pietro Miotti, Aidan Sirbu et al.· arXiv.org· 1 citation
A striking finding is reported: when interacting in stylized social dilemmas, foundation model agents engaging in optimal planning consistently converge to stable cooperation, directly contradicting classical game-theoretic predictions of mutual defection.
Alexander Meulemans, Maciej Wolczyk, Marissa A. Weis et al.· 1 citation
Autopoietic Game Theory is introduced, a computational model where social interactions, replication mechanisms, and their associated computational costs are endogenous and simultaneously co-evolving and can incorporate exogenous pressures.
Kunal Jha, F. Cicala, B. A. Y. Arcas et al.· 0 citations
These results demonstrate an interactive feedback loop: environmental task demands actively shape the physical architecture of self-replication, while spontaneous replication alters the evolutionary trajectory of functional problem-solving.
F. Cicala, Eyvind Niklasson, E. Randazzo et al.· arXiv.org· 0 citations
This work adds a persistent hidden state to a diffusion denoiser and removes its timestep conditioning, leaving a single shared update that can be run to arbitrary depth, and develops an anytime solver that keeps improving with inference depth far beyond the rollout lengths and backpropagation window used in training.
M. Drozdova, Aidan Sirbu, Pietro Miotti et al.· 3 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.