arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.06746cs.NE

面向稀疏脉冲神经网络的负载均衡剪枝

Workload-Balanced Pruning for Sparse Spiking Neural Networks

Ruokai Yin, Youngeun Kim, Yuhang Li, Abhishek Moitra, Nitin Satpute, Anna Hambitzer, Priyadarshini Panda

AI总结:

针对高权重稀疏SNNs的负载不均衡导致硬件利用率低的问题,提出u-Ticket方法在基于LTH的剪枝中调整权重连接,实现最高100%硬件利用率,显著降低延迟与能耗。

摘要:

针对脉冲神经网络(SNNs)的剪枝已成为在资源受限的边缘设备上部署深度SNNs的基础方法。尽管现有的剪枝方法能为深度SNNs提供极高的权重稀疏度,但这种高权重稀疏度带来了负载不均衡问题。具体而言,当分配给并行运行的硬件单元的非零权重数量不同时,就会发生负载不均衡。这导致硬件利用率低下,从而造成更长的延迟和更高的能耗。在初步实验中,我们展示了稀疏SNNs(约98%的权重稀疏度)的利用率可能低至约59%。为缓解负载不均衡问题,我们提出了u-Ticket,在基于彩票假说(LTH)的剪枝过程中监控并调整SNN的权重连接,从而确保最终的“彩票”在部署到硬件时获得最佳利用率。实验表明,我们的u-Ticket能保证高达100%的硬件利用率,与未考虑利用率的LTH方法相比,最多可减少76.9%的延迟和63.8%的能耗。

英文摘要:

Pruning for Spiking Neural Networks (SNNs) has emerged as a fundamental methodology for deploying deep SNNs on resource-constrained edge devices. Though the existing pruning methods can provide extremely high weight sparsity for deep SNNs, the high weight sparsity brings a workload imbalance problem. Specifically, the workload imbalance happens when a different number of non-zero weights are assigned to hardware units running in parallel. This results in low hardware utilization and thus imposes longer latency and higher energy costs. In preliminary experiments, we show that sparse SNNs (~98% weight sparsity) can suffer as low as ~59% utilization. To alleviate the workload imbalance problem, we propose u-Ticket, where we monitor and adjust the weight connections of the SNN during Lottery Ticket Hypothesis (LTH) based pruning, thus guaranteeing the final ticket gets optimal utilization when deployed onto the hardware. Experiments indicate that our u-Ticket can guarantee up to 100% hardware utilization, thus reducing up to 76.9% latency and 63.8% energy cost compared to the non-utilization-aware LTH method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑