通过分层单路径结构,动态减少推理时的活跃参数量。
Sigma-Branch: Hierarchical Single-Path Network Reconstruction for Dynamic Inference with Reduced Active Parameters

- 将预训练网络重构为带共享主干的分层二叉树结构
- 推理时仅激活一条路径,活跃参数降低58%-60%
- 适用于边缘设备,对模型精度影响小于1.72个百分点
在内存受限的边缘加速器上部署深度神经网络,主要瓶颈在于每次推理都需要从片外加载全部权重,而非计算能力:密集网络无法完整驻留于片上,每个输入都需重新加载所有参数。现有模型压缩方法虽能减少传输,但永久损失模型容量。本文提出Sigma-Branch(SigmaB)框架,将预训练密集网络重构为包含共享主干、分层路由器和专用叶节点的分层二叉树。通过基于激活的球面k均值聚类,将预训练权重分布至树中,联合初始化路由器权重与各分支通道分配;随后进行软路由微调,使每个叶节点与其路由输入子集对齐。推理时,网络仅执行单一根到叶路径,显著减少活跃参数量,同时保持完整的密集参数存储。在CIFAR-100/ResNet-50、ImageNet-1K/ResNet-50和ModelNet40/PointNet++上,SigmaB-Net实现每推理活跃参数降低58-60%,且准确率比密集基线低不超过1.72个百分点。在相近ImageNet-1K Top-1精度下,相比静态结构化剪枝(FPGM、HRank),活跃参数减少幅度高出14-23个百分点。跨模态评估覆盖2D视觉与3D点云骨干网络,验证了该框架可解耦推理内存流量与总参数量的关系。
原文摘要 · Abstract (English)
Deploying deep neural networks on memory-constrained edge accelerators is bottlenecked by per-inference off-chip weight transfer rather than computation: the dense network cannot be retained on-chip, and every parameter must be loaded for every input. Existing model compression reduces this transfer only at the cost of permanent capacity loss. We propose Sigma-Branch (SigmaB), a framework that restructures a pretrained dense network into a hierarchical binary tree composed of a shared backbone, hierarchical routers, and specialized leaves. Pretrained weights are distributed across the tree via activation-based spherical k-means clustering, which jointly initializes router weights and per-branch channel allocations; soft-routing fine-tuning then aligns each leaf with its routed input subset. At inference, the resulting network executes only a single root-to-leaf path, reducing the active-parameter footprint while storing the complete dense parameter set in memory. Across CIFAR-100 / ResNet-50, ImageNet-1K / ResNet-50, and ModelNet40 / PointNet++, SigmaB-Net reduces per-inference active parameters by 58-60% while remaining within 1.72 percentage points (pp) of the dense baseline Top-1. At comparable ImageNet-1K Top-1, the active-parameter reduction exceeds static structured pruning (FPGM, HRank) by 14-23 pp. The cross-modal evaluation, spanning 2D vision and 3D point-cloud backbones, substantiates a framework-level claim that decouples per-inference memory traffic from the total parameter count.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。