Timezone: »

Learning on Arbitrary Graph Topologies via Predictive Coding
Tommaso Salvatori · Luca Pinchetti · Beren Millidge · Yuhang Song · Tianyi Bao · Rafal Bogacz · Thomas Lukasiewicz

Thu Dec 01 02:00 PM -- 04:00 PM (PST) @ Hall J #614

Training with backpropagation (BP) in standard deep learning consists of two main steps: a forward pass that maps a data point to its prediction, and a backward pass that propagates the error of this prediction back through the network. This process is highly effective when the goal is to minimize a specific objective function. However, it does not allow training on networks with cyclic or backward connections. This is an obstacle to reaching brain-like capabilities, as the highly complex heterarchical structure of the neural connections in the neocortex are potentially fundamental for its effectiveness. In this paper, we show how predictive coding (PC), a theory of information processing in the cortex, can be used to perform inference and learning on arbitrary graph topologies. We experimentally show how this formulation, called PC graphs, can be used to flexibly perform different tasks with the same network by simply stimulating specific neurons. This enables the model to be queried on stimuli with different structures, such as partial images, images with labels, or images without labels. We conclude by investigating how the topology of the graph influences the final performance, and comparing against simple baselines trained with BP.

Author Information

Tommaso Salvatori (University of Oxford)
Luca Pinchetti (University of Oxford)
Beren Millidge (University of Edinburgh)
Yuhang Song (University of Oxford)
Tianyi Bao (University of Oxford)
Rafal Bogacz (University of Oxford)
Thomas Lukasiewicz (University of Oxford)

More from the Same Authors