arXiv:2606.30919cs.NIcs.AI2026-06

提出按预算动态切换跳过弱模型或依赖弱模型的推理策略,提升边缘云协同效率

Budget-Adaptive Routing: Skipping the Weak When the Strong Answers Anyway

论文配图:Budget-Adaptive Routing: Skipping the Weak When the Strong Answers Anyway
图 1 · 摘自论文原文
  • 设计轻量级像素级路由估计器,可提前跳过弱模型计算
  • 在不同资源预算下自动选择最优路由方式,性能优于固定策略
  • 在低延迟和高精度间实现更好平衡,适合资源受限场景

边缘-云协同推理常依赖路由估计器决定是否将边缘弱模型的帧卸载至云端强模型。现有系统将路由估计器置于弱模型之后,导致即使后续需卸载,弱模型仍会执行前向计算。本文提出一种竞争性弱模型跳过估计器(0.153 GFLOPs,约是弱检测器4.49 GFLOPs的29倍轻量),直接从原始像素提取路由信号,优于传统后置弱模型的基准方法。进一步发现,弱跳过与弱依赖策略在全运行曲线上无绝对优劣,因此提出基于预算自适应的路由机制,通过两个离线调优阈值在两者间切换。在PASCAL VOC上,该方法始终逼近两种固定策略的精度上限;相比固定策略,帧级延迟最多降低19.1毫秒(在rho=0.9时约降30%)。此外,在部分资源配置下,其性能甚至超越强模型本身(+1.7个百分点mAP),且所需计算量远低于强模型。代码与数据已公开。

原文摘要 · Abstract (English)

Edge-cloud inference collaborations are often designed with a routing estimator that decides whether to offload each frame from weak models at the edge to stronger models in the cloud. Existing systems place the routing estimator after the weak detector, so the weak forward pass still runs even on frames that are later offloaded. In this paper, we argue that this weak-conditioned design can be suboptimal when the offload budget varies. First, we present a competitive weak-skipping estimator (0.153 GFLOPs, about 29x lighter than the weak detector at 4.49 GFLOPs) that extracts routing signal from raw pixels, outperforming the common after-weak placement weak-conditioned baselines. Second, we show that neither weak-skipping nor weak-conditioned placement dominates across the full operating curve, and we propose budget-adaptive routing, which selects between them by offload budget via two offline-tuned thresholds. On PASCAL VOC, our budget-adaptive router traces the upper accuracy envelope of both fixed placements across the operating range. Our method reduces per-frame latency by up to 19.1 ms (about 30% lower at rho = 0.9). Besides outperforming SOTA methods, it is surprisingly stronger than the strong model (+1.7 pp over the strong model's peak mAP) at some operating points with far less compute. Artifacts are available at https://github.com/ViGeng/bgt-ada

边缘计算推理优化动态路由

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