Magnitude-based pruning (Top-K) increases a measure of topological orderedness in fully connected, weight-tied recurrent layers, without a clear performance drop on two toy tasks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Pruning Increases Orderedness in Recurrent Computation
Magnitude-based pruning (Top-K) increases a measure of topological orderedness in fully connected, weight-tied recurrent layers, without a clear performance drop on two toy tasks.