Method and systems of dynamic sparse training of diagonally sparse networks with permutations

WO2026165490A1PCT designated stage Publication Date: 2026-08-06UNIVERSITY OF ROCHESTER +5
View PDF 0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
UNIVERSITY OF ROCHESTER
Filing Date
2026-02-02
Publication Date
2026-08-06

Smart Images

  • Figure US2026013519_06082026_PF_FP_ABST
    Figure US2026013519_06082026_PF_FP_ABST
Patent Text Reader

Abstract

An exemplary system and method for training neural networks under extreme or heavy sparsity constraints by (i) selecting and updating only the most critical diagonals during training via a diagonal-based sparse pattern, while additionally maintaining diagonal sparsity even during backpropagation, and / or (ii) using learned permutations to restore network expressivity while maintaining hardware efficiency, e.g., after a sparsity constraint having been applied, diagonal or otherwise. A structured sparse-to-sparse DST method and corresponding system are provided that enforce a diagonal sparsity pattern throughout the training process that preserves / maintains sparse computation in the forward and backward passes. Permutations can help bridge the gap between the performance of structured and unstructured sparsity in being implemented as co-learning for structure and permutations. Structure (e.g., diagonal or others) may be first applied in a training process, to which a second process based on permutations is applied.
Need to check novelty before this filing date? Find Prior Art