🤖 AI Summary
This study addresses the response latency inherent in Lateral Predictive Coding (LPC) networks when extracting non-Gaussian latent features. By reconfiguring the network’s dynamic architecture and incorporating a sparse modular design, the proposed approach significantly reduces system response time while preserving predictive accuracy and information robustness. The method achieves, for the first time, response latencies approaching the theoretical lower bound and demonstrates that modular architectures can match the overall performance of fully connected networks. Through an explicit trade-off between energy cost and information robustness, the work establishes an optimized LPC network with a simpler structure and faster response, attaining state-of-the-art performance across multiple metrics—including feature detection capability, response speed, energy efficiency, and robustness.
📝 Abstract
Lateral predictive coding (LPC) is a simple theoretical framework to appreciate feature detection in biological neural circuits. Recent theoretical work [Huang et al., Phys.Rev.E 112, 034304 (2025)] has successfully constructed optimal LPC networks capable of extracting non-Gaussian hidden input features by imposing the tradeoff between energetic cost and information robustness, but the resulting dynamical systems of recurrent interactions can be very slow in responding to external inputs. We investigate response-time reduction in the present paper. We find that the characteristic response time of the LPC system can be minimized to closely approaching the lower-bound value without compromising the mean predictive error (energetic cost) and the information robustness of signal transmission. We further demonstrate that optimal LPC networks taking a modular structural organization with extensively reduced number of lateral interactions are equally excellent as all-to-all completely connected networks, in terms of feature detection performance, response time, energetic cost and information robustness.