Pareto-Optimal Bit Allocation for Collaborative Intelligence
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
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
An Optimal Task Planning and Agent-aware Allocation Algorithm in Collaborative Tasks Combining with PDDL and POPF
Industry 4.0 proposes the integration of artificial intelligence (AI) into manufacturing and other industries to create smart collaborative systems which enhance efficiency. The aim of this paper is to develop a flexible…
Task PlanningA near Pareto optimal approach to student-supervisor allocation with two sided preferences and workload balance
The problem of allocating students to supervisors for the development of a personal project or a dissertation is a crucial activity in the higher education environment, as it enables students to get feedback on their wor…
Predictive GAN-powered Multi-Objective Optimization for Hybrid Federated Split Learning
As an edge intelligence algorithm for multi-device collaborative training, federated learning (FL) can reduce the communication burden but increase the computing load of wireless devices. In contrast, split learning (SL)…
Federated LearningGenerative Adversarial NetworkCounter-monotonic risk allocations and distortion risk measures
In risk-sharing markets with aggregate uncertainty, characterizing Pareto-optimal allocations when agents might not be risk averse is a challenging task, and the literature has only provided limited explicit results thus…
Pareto-Optimal Peer-to-Peer Risk Sharing with Robust Distortion Risk Measures
We study Pareto optimality in a decentralized peer-to-peer risk-sharing market where agents' preferences are represented by robust distortion risk measures that are not necessarily convex. We obtain a characterization of…