Pruning and accelerating neural networks with hierarchical fine-grained structured sparsity
AssigneeNVIDIA Corporation
InventorsYannan Wu, Po-An Tsai, Saurav Muralidharan, Joel Springer Emer
Life of this patent
Estimating the term…
Loading patent…
AssigneeNVIDIA Corporation
InventorsYannan Wu, Po-An Tsai, Saurav Muralidharan, Joel Springer Emer
Estimating the term…
Hierarchical structured sparse parameter pruning and processing improves runtime performance and energy efficiency of neural networks. In contrast with conventional (non-structured) pruning which allows for any distribution of the non-zero values within a matrix that achieves the desired sparsity degree (e.g., 50%) and is consequently difficult to accelerate, structured hierarchical sparsity requires each multi-element unit at the coarsest granularity of the hierarchy to be pruned to the desired sparsity degree. The global desired sparsity degree is a function of the per-level sparsity degrees. Distribution of non-zero values within each multi-element unit is constrained according to the per-level sparsity degree at the particular level of the hierarchy. Each level of the hierarchy may be associated with a hardware (e.g., logic or circuit) structure that can be enabled or disabled according to the per-level sparsity. Hierarchical sparsity provides performance improvements for a greater variety of sparsity patterns, granularity, and sparsity degrees.
A method, comprising:
A system, comprising:
A non-transitory computer-readable media storing computer instructions that, when executed by one or more processors, cause the one or more processors to perform the steps of:
Dependencies are inferred from the claim text.