arXiv:2603.26138cs.LGcs.CV2026-03

用剪枝网络选数据,再融合原模型,省时又提效

PruneFuse: Efficient Data Selection via Weight Pruning and Network Fusion

  • 先剪枝生成小网络选关键数据,结构与原模型一致
  • 选中数据后融合剪枝网络,训练速度提升30%以上
  • 适合数据标注成本高、需快速训练的场景

高效的数据选择对提升深度神经网络训练效率和降低标注需求至关重要。传统方法计算开销大,难以扩展。我们提出PruneFuse,利用剪枝网络进行数据选择,并在后续将其与原始网络融合以优化训练。该方法分两阶段:首先,通过结构化剪枝构建小型剪枝网络,因其与原网络结构一致,适合执行数据选择任务;随后在该小网络上训练并筛选出最具信息量的样本。第二阶段,将训练好的剪枝网络无缝融合至原网络中,利用其学习到的特征指导融合网络的学习过程,同时保留探索更鲁棒解的空间。在多个数据集上的实验表明,PruneFuse显著降低数据选择的计算成本,性能优于基线方法,并加速整体训练流程。

原文摘要 · Abstract (English)

Efficient data selection is crucial for enhancing the training efficiency of deep neural networks and minimizing annotation requirements. Traditional methods often face high computational costs, limiting their scalability and practical use. We introduce PruneFuse, a novel strategy that leverages pruned networks for data selection and later fuses them with the original network to optimize training. PruneFuse operates in two stages: First, it applies structured pruning to create a smaller pruned network that, due to its structural coherence with the original network, is well-suited for the data selection task. This small network is then trained and selects the most informative samples from the dataset. Second, the trained pruned network is seamlessly fused with the original network. This integration leverages the insights gained during the training of the pruned network to facilitate the learning process of the fused network while leaving room for the network to discover more robust solutions. Extensive experimentation on various datasets demonstrates that PruneFuse significantly reduces computational costs for data selection, achieves better performance than baselines, and accelerates the overall training process.

数据选择模型剪枝训练加速

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。