101. Is predictive coding falsifiable?
- Author
-
Bowman, H., Collins, D.J., Nayak, A.K., and Cruse, D.
- Subjects
- *
VANILLA , *CODING theory , *FALSIFICATION - Abstract
Predictive-coding has justifiably become a highly influential theory in Neuroscience. However, the possibility of its unfalsifiability has been raised. We argue that if predictive-coding were unfalsifiable, it would be a problem, but there are patterns of behavioural and neuroimaging data that would stand against predictive-coding. Contra (vanilla) predictive patterns are those in which the more expected stimulus generates the largest evoked-response. However, basic formulations of predictive-coding mandate that an expected stimulus should generate little, if any, prediction error and thus little, if any, evoked-response. It has, though, been argued that contra (vanilla) predictive patterns can be obtained if precision is higher for expected stimuli. Certainly, using precision, one can increase the amplitude of an evoked-response, turning a predictive into a contra (vanilla) predictive pattern. We demonstrate that, while this is true, it does not present an absolute barrier to falsification. This is because increasing precision also reduces latency and increases the frequency of the response. These properties can be used to determine whether precision-weighting in predictive-coding justifiably explains a contra (vanilla) predictive pattern, ensuring that predictive-coding is falsifiable. • Assess falsifiability of predictive coding. • Review predictive coding and present a canonical model of it. • Identify data patterns that stand against predictive coding. • Outline competing theories to predictive coding. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF