arXiv:2608.05499cs.CVcs.AI2026-08

用AI智能分析模型各层特性,自动实现高效压缩与量化。

APQF: Agentic Profiling-Guided Structured Pruning and Mixed-Precision Quantization with Adaptive Fine-Tuning

  • 通过智能代理分析每层敏感度,动态设定压缩比例和精度
  • 在ImageNet上计算量降至原5.6%-7.7%,准确率接近基线
  • 支持多种模型架构,适合边缘设备部署

现代深度神经网络性能强大,但规模庞大导致在资源受限的边缘设备上运行成本高、速度慢。剪枝与量化可缓解此问题,但依赖人工经验,且算法难跨架构应用。统一设置忽略各层对压缩的响应差异,影响精度。我们提出APQF框架,融合结构化剪枝、混合精度量化感知训练及自适应微调,构建全自动流水线。一个分析代理测量模型各层的开销分布与剪枝敏感度,基于证据驱动每层剪枝率、位宽及恢复策略,由LLM规划器提出并验证后执行。据我们所知,APQF是首个结合LLM引导、基于剖析数据决策与全训练感知剪枝量化管道的框架,适用于CNN与视觉变压器。在ResNet、VGG7、ViT、DeiT、Swin上使用ImageNet-1k与CIFAR-10进行评估。在ImageNet上,计算量降至原始比特操作的5.6%-7.7%(13-18倍缩减),准确率保持接近基线;在20万图像预算下,比现有联合剪枝量化方法高出约17个百分点。在CIFAR-10上,五种架构中有四种压缩效果更优。在VGG7上仅用0.41%基线比特操作达到93.15%准确率,是唯一在该压缩水平上超越全精度基线的方法。消融实验表明,统一压缩在相同计算量下损失最大精度;若移除剖析数据,所有模型性能均下降。六种LLM规划器(含开源免费版本)在Swin-Tiny上均达97.4%-97.9%准确率。

原文摘要 · Abstract (English)

Modern deep neural networks achieve strong performance, but their scale makes them costly and slow, especially on resource-constrained edge devices. Pruning and quantization address this, but rely on manual, expert choices and on algorithms that are hard to apply across architectures. Uniform settings also ignore how differently individual layers respond to compression, which costs accuracy. We introduce APQF, an agentic profiling-guided framework that combines structured pruning, mixed-precision quantization-aware training, and accuracy recovery in one automated pipeline. A profiling agent measures how cost is distributed across the model and how sensitive each part is to pruning, and this evidence drives per-layer pruning ratios, per-layer bit-widths, and the recovery strategy, all proposed by LLM planners and validated before execution. To our knowledge, APQF is the first framework to combine LLM-guided, profiling-grounded decisions with a fully training-aware pruning and quantization pipeline for both CNNs and vision transformers. We evaluate APQF on ResNet, VGG7, ViT, DeiT, and Swin using ImageNet-1k and CIFAR-10. On ImageNet it cuts compute to 5.6-7.7 percent of the original bit-operations, a 13-18x reduction, while keeping accuracy close to the baseline, and under a 200K-image budget it stays roughly 17 points higher in Top-1 than existing joint pruning and quantization methods. On CIFAR-10 it compresses further than that method on four of five architectures. On VGG7 it reaches 93.15 percent using only 0.41 percent of baseline bit-operations, the only method at that compression level to improve on its full-precision baseline. Ablations show that uniform compression loses the most accuracy at matched compute, and that withholding profiling data from the planner hurts every model. Six LLM planners, including free open-weight ones, all reach 97.4-97.9 percent on Swin-Tiny.

模型压缩智能剪枝量化边缘计算

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