arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.12430eess.IVcs.AIcs.LG
收藏

协同智能中的Pareto最优比特分配

Pareto-Optimal Bit Allocation for Collaborative Intelligence

Simon Fraser University(西蒙弗雷泽大学)

Saeed Ranjbar Alvar, Ivan V. Bajić

摘要:

在最近的研究中,协作智能(CI)已经成为在移动/边缘设备上部署基于人工智能(AI)的服务的一个有前途的框架。在CI中,AI模型(深度神经网络)在边缘和云之间分裂,中间特征从边缘子模型发送到云子模型。本文研究了多流CI系统中特征编码的比特分配问题。我们的模型任务失真率的函数,使用凸面类似的失真率理论。使用这样的模型,我们能够提供封闭形式的位分配解决方案的单任务系统和标量多任务系统。此外,我们提供了完整的Pareto集的2流k-任务系统的分析特征,和边界上的Pareto集的3流2-任务系统。分析结果进行了检查,从文献中的各种DNN模型,以证明广泛的适用性的结果

英文摘要:

In recent studies, collaborative intelligence (CI) has emerged as a promising framework for deployment of Artificial Intelligence (AI)-based services on mobile/edge devices. In CI, the AI model (a deep neural network) is split between the edge and the cloud, and intermediate features are sent from the edge sub-model to the cloud sub-model. In this paper, we study bit allocation for feature coding in multi-stream CI systems. We model task distortion as a function of rate using convex surfaces similar to those found in distortion-rate theory. Using such models, we are able to provide closed-form bit allocation solutions for single-task systems and scalarized multi-task systems. Moreover, we provide analytical characterization of the full Pareto set for 2-stream k-task systems, and bounds on the Pareto set for 3-stream 2-task systems. Analytical results are examined on a variety of DNN models from the literature to demonstrate wide applicability of the results

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑