Universal structural patterns in sparse recurrent neural networks

This paper investigates the structural patterns in sparse recurrent neural networks (RNNs) that achieve performance comparable to their fully connected counterparts while requiring less energy and memory. The authors analyze RNNs trained using various sparsification strategies (pruning and rewiring) across different tasks. They discover a universal pattern of signed motifs, showing that optimized sparse topologies exhibit structural balance, improving performance. This structural balance is also observed in other state-of-the-art models, such as Neural ODEs and continuous-time RNNs, suggesting a general principle for optimizing sparse network architectures.

Xin-Jie Zhang, Jack Murdoch Moore, Gang Yan, Xiang Li