通过可剪枝网络实现多平台检索模型的灵活适配。
Learning Compatible Multi-Prize Subnetworks for Asymmetric Retrieval
- 在密集网络中联合优化不同容量子网的结构与权重。
- 支持任意容量子网生成,无需为新平台重新训练。
- 适合资源异构的部署场景,如移动端与服务器端协同检索。
异构检索是现实检索系统中的典型场景,需在不同资源配置的平台上部署能力各异的兼容模型。现有方法通常为预设平台训练特定容量的网络或子网,依赖兼容学习。然而,这些方法在多平台部署时灵活性差:新增平台时,需通过后向兼容学习额外训练适配模型。本文提出一种具备自兼容性的可剪枝网络,可通过训练后剪枝生成任意容量的兼容子网,无需额外训练即可匹配新平台资源。具体而言,我们在一个密集网络中联合优化不同容量子网的架构与权重,并设计冲突感知梯度融合机制,以缓解密集网络与子网间的梯度冲突。在多种基准和视觉骨干网络上的大量实验验证了该方法的有效性。代码与模型已开源。
原文摘要 · Abstract (English)
Asymmetric retrieval is a typical scenario in real-world retrieval systems, where compatible models of varying capacities are deployed on platforms with different resource configurations. Existing methods generally train pre-defined networks or subnetworks with capacities specifically designed for pre-determined platforms, using compatible learning. Nevertheless, these methods suffer from limited flexibility for multi-platform deployment. For example, when introducing a new platform into the retrieval systems, developers have to train an additional model at an appropriate capacity that is compatible with existing models via backward-compatible learning. In this paper, we propose a Prunable Network with self-compatibility, which allows developers to generate compatible subnetworks at any desired capacity through post-training pruning. Thus it allows the creation of a sparse subnetwork matching the resources of the new platform without additional training. Specifically, we optimize both the architecture and weight of subnetworks at different capacities within a dense network in compatible learning. We also design a conflict-aware gradient integration scheme to handle the gradient conflicts between the dense network and subnetworks during compatible learning. Extensive experiments on diverse benchmarks and visual backbones demonstrate the effectiveness of our method. Our code and model are available at https://github.com/Bunny-Black/PrunNet.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。