SOURCE-LINKED INTELLIGENCE

A Study of Hidden-State Optimization Order in Predictive Coding Networks

arXiv · AI, language, vision and robotics · article · Sep 1, 2026 · UTC

Local learning methods offer an alternative to end-to-end backpropagation, but their unstructured local objectives can produce weak feature learning in deep networks. We study whether the order of hidden-state optimization can address this limitation. We propose a boundary-first inference schedule that partitions a model into chunks, first coordinates hidden states at chunk boundaries, and then refines representations within each chunk. We instantiate this schedule in predictive coding networks (PCNs), a local-learning framework in which hidden activities and prediction errors are explicitly e

Read original source ↗ Open in workspace

recordType

paper

region

Global