q-bio.NCFeb 23, 2025

Lattice-Based Pruning of Recurrent Neural Networks via Poset Modeling: A Corrected Theory and a Matched-Sparsity Evaluation

Authors: Rakesh Sengupta

Organizations: School of Interwoven Arts and Sciences, Krea University, Sri City 517541, Andhra Pradesh, India

Abstract

Magnitude pruning of recurrent neural networks (RNNs) ignores how information flows between neurons. An earlier version proposed to model RNN dependencies as a partially ordered set (poset) and to retain the meet-irreducible elements of its dependency lattice. By Birkhoff's representation theorem, the meet-irreducible ideals of a finite poset are in bijection with its elements, so retaining them retains everything; the critical-set criterion used earlier selects precisely the elements comparable to all others, of which a dense recurrent layer has none. Condensing a thresholded dependency graph into strongly connected components yields a well-defined dependency order, a graded order score and an acyclic pruning rule; for Cohen-Grossberg networks and LSTMs, acyclic pruning makes local stability decompose over modules. For a 128-unit LSTM pruned at matched sparsity on row-wise and chunked sequential MNIST (three seeds, equal training budgets), the original rules remove every recurrent weight or equal random column pruning; the order score is no better than degree, PageRank or norm; trained weights show little directional bias; and imposing acyclicity from initialisation costs 2.1 and 10.5 percentage points at 50% and 90% sparsity. In the networks studied, order structure must be imposed rather than discovered.

Figures & tables

Appendix figures & tables1 asset

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Effective pruning of task-trained recurrent neural networks using noisy fluctuations and connection rescaling

    Aug 5, 2026Sanjith Senthil, Rishidev ChaudhuriRecurrent Neural NetworksBiologically Plausible Learning

  2. Finding Sparse Subnetworks in One Training Cycle via Progressive Magnitude-Based Pruning

    Jun 10, 2026Romana Qureshi, Hafida Benhidour, Said Kerrache +1Sparse Neural NetworksNeural Network Pruning