Back

Evidence for predictive computations in a brain hierarchy during a visual search task

Pinotsis, D.; Bastos, A.; Miller, E. K.

2026-04-09 neuroscience
10.64898/2026.04.09.717389 bioRxiv
Show abstract

Many lines of evidence suggest that the cortex functions fundamentally as a predictive system, compressing high-dimensional sensory inputs into low-dimensional representations that support internal models of the environment. These models generate top-down signals that shape and filter incoming sensory information, prioritizing unpredicted, and thus more informative, inputs for further processing. Multiple, mutually compatible computational frameworks have been proposed to explain these mechanisms, including predictive coding, predictive routing, and autoencoder-based approaches. However, a key challenge remains in empirically disentangling their relative contributions. Here, we directly compared three candidate algorithms, predictive coding, routing and autoencoders using LFP data from a brain hierarchy acquired during a visual search task. Notably, predictive coding differs from alternative models in its capacity to dynamically optimize signal passing across brain hierarchies in an input-specific manner, while the other algorithms do not consider constraints on feedback or feedforward inputs. It also goes beyond pairwise interactions, by predicting information flow in triplets of brain areas; here, V4, 7A and PFC. We considered the characteristic patterns of neural dynamics and within-area coupling that distinct algorithms produce. These were subsequently used to assess the relative evidence of each algorithm in the face of the LFP data. Our results support a hybrid account: hierarchical message passing consistent with predictive coding appears necessary to explain deep-layer activity, while predictive suppression mechanisms, aligned with predictive routing, account for superficial-layer dynamics without requiring explicit error computations.

Matching journals

The top 6 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.