SpatialPC2 min read
SpatialPC: Deep Computation with Sublinear Local Credit Propagation
On a chain of $N$ states, any local learning rule with bounded communication range needs $\Theta(N)$ rounds before the loss can influence the earliest parameters, and this latency is usually attributed to depth. We show that it is a property of the communication geometry rather than of depth.
By Benjamin Prada, Shion Matsumoto, Ankur Arjun MaliarXiv cs.LG
Read the full story
Originally published by arXiv cs.LG on Oct 28, 2026.
Comments
Sign in to join the discussion.