Organizations: School of Future Science and Engineering, Soochow University, Suzhou 215006, China · College of Computer and Information Sciences, Fujian Agriculture and Forestry University, Fuzhou 350002, China · School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China · Department of Control Science and Engineering, Tongji University, Shanghai 201804, China · School of Computing Technologies, RMIT University, Melbourne, Victoria, Australia
As Deep Neural Network (DNN) inference becomes increasingly prevalent on edge and mobile platforms, critical challenges emerge in privacy protection, resource constraints, and dynamic model deployment. This paper proposes a privacy-aware collaborative inference framework, in which adaptive model partitioning is performed across edge devices and servers. To jointly optimize inference delay, energy consumption, and privacy cost under dynamic service demands and resource constraints, we formulate the joint problem as a Constrained Markov Decision Process (CMDP) that integrates model deployment, user-server association, model partitioning, and resource allocation. We propose a Hierarchical Constrained Multi-Agent Proximal Policy Optimization with Lagrangian relaxation (HC-MAPPO-L) algorithm, a safe reinforcement learning-based framework that enhances Multi-Agent Proximal Policy Optimization (MAPPO) with adaptive Lagrangian dual updates to enforce long-term delay constraints. To ensure tractability while maintaining coordination, we decompose the CMDP into three hierarchically structured policy layers: an auto-regressive based model deployment policy, a Lagrangian-enhanced user association and model partitioning policy, and an attention-based resource allocation policy. Extensive experimental results demonstrate that HC-MAPPO-L consistently satisfies stringent delay constraints while achieving a superior balance among energy consumption and privacy cost, outperforming representative baseline algorithms across varying problem scales and resource configurations.
Figures & tables
Fig. 1: The system model of edge-device collaborative inference.
Fig. 2: Privacy leakage decreases with partition depth in VGG16, showing SSIM scores of 0.99 ( l=2 ), 0.59 ( l=8 ), and 0.35 ( l=14 ).
Fig. 3: The architecture of HC–MAPPO–L algorithm.
Parameter
Value
User compute capacity ( fk )
10–100 GFLOPS (Uniform)
Edge compute capacity ( fj )
500–2000 GFLOPS (Uniform)
User storage capacity
1–2 GB (Uniform)
Edge storage capacity
3–5 GB (Uniform)
Per-server bandwidth
50–100 MHz (Uniform)
Server / User TX power
30–43 / 20–30 dBm
TABLE I: Key Simulation Parameters
Fig. 4: Evaluation of convergence performance versus energy–privacy weight ratios.
Fig. 5: Evaluation of training convergence performance. All subfigures share the legend in (a), and the red dashed line in (b) indicates the latency constraint τˉ=3 s.
Fig. 6: Evaluation of user cost distribution. The right-hand color bar range [1,8] represents the normalized cost rank, where 1 (8) corresponds to the lowest (highest) user cost.
Fig. 7: Evaluation of system performance under varying number of users.
Fig. 8: Evaluation of system performance under varying number of edge servers.
Fig. 9: Evaluation of system performance under varying number of services.
Fig. 10: Service success rate versus services per model.
Fig. 11: Evaluation of system performance under varying delay constraints.
Fig. 12: Evaluation of system performance under varying user computation capacities.
Fig. 13: Evaluation of system performance under varying server computation capacities.
Fig. 14: Evaluation of system performance under varying server storage capacity.
Recently, mobile edge computing (MEC)-enabled collaborative deep neural network (DNN) inference has emerged as a promising approach for delivering intelligent services to resource-constrained mobile devices. A representative scenario is multi-user collaborative edge inference, where distinct devices independently partition their DNN models and offload backend computation to a common edge server over wireless networks. However, determining the optimal DNN partition for each device is challenging due to unknown and time-varying system conditions, including fluctuating wireless links and diverse device capabilities. To address this problem, we propose Cooperative Autodidactic NeuroSurgeon (CANS), a collaborative edge inference framework that enables devices to adaptively learn optimal DNN partitions by sharing informative feedback during online inference. To handle the challenge of device heterogeneity and better leverage offline inference experience, we integrate a novel FedLinUCB-DW algorithm that groups devices of the same type and warm-starts online exploration using local offline early-exit inference experience. Furthermore, we provide theoretical guarantees for FedLinUCB-DW by deriving the regret upper bound. We also validate our method on both a simulated environment and a hardware prototype system. Empirical evaluations demonstrate that CANS achieves lower inference latency compared to state-of-the-art baselines. Especially, in prototype experiments on two edge devices, the proposed CANS reduced average inference latency by up to 50% compared to the non-cooperative baseline.
Zheshun Wu, Ziyang Zhang, Changyao Lin +2
School of Computer Science and Technology, Harbin Institute of Technology Shenzhen, Shenzhen 518055, China · NESLab, Politecnico di Milano, 39-20133 Milano, Italy · School of Computer Science and Technology, Harbin Institute of Technology, Harbin, Heilongjiang 150001, China +2
Federated edge learning (FEEL) has recently emerged as a promising paradigm for achieving edge intelligence (EI) via enabling collaborative model training across edge devices while protecting data privacy. In this paper, we put forth an online optimization framework that jointly manages federated training and inference on resource-constrained edge devices. We introduce a tandem-queue-inspired conversion mechanism that bridges inference requests and training data, and further incorporate both data and model freshness into the accuracy formulation to capture temporal dynamics in real-world environments. To maximize inference accuracy while minimizing latency and energy consumption, the mode selections, communication, and computation resource allocations of edge devices are jointly optimized. We formulate this optimization as a multi-objective optimization problem, which is NP-hard and further complicated by the online setting. To address these challenges, we transform the problem into a multi-objective Markov decision process (MOMDP) and develop a constrained multi-objective proximal policy optimization (C-MOPPO) algorithm. Specifically, C-MOPPO first learns a set of policies with different preferences across three objectives, then leverages constrained policy optimization to enrich the Pareto front and obtain high-quality, dense solutions. Extensive experiments demonstrate that C-MOPPO achieves well-balanced trade-offs among objectives and significantly outperforms baselines under various system configurations.
Zhen Li, Jun Cai, Chao Yang +1
Department of Electrical and Computer Engineering, Concordia University, Montreal, QC, H3G 1M8, Canada · School of Automation, Guangdong University of Technology, China
Large deep neural networks (DNNs), especially transformer-based and multimodal architectures, are computationally demanding and challenging to deploy on resource-constrained edge platforms like field robots. These challenges intensify in mission-critical scenarios (e.g., disaster response), where robots must collaborate under tight constraints on bandwidth, latency, and battery life, often without infrastructure or server support. To address these limitations, we present COHORT, a collaborative DNN inference and task-execution framework for multi-robot systems built on the Robotic Operating System (ROS). COHORT employs a hybrid offline-online reinforcement learning (RL) strategy to dynamically schedule and distribute DNN module execution across robots. Our key contributions are threefold: (a) Offline RL policy learning combined with Advantage-Weighted Regression (AWR), trained on auction-based task allocation data from heterogeneous DNN workloads across distributed robots, (b) Online policy adaptation via Multi-Agent PPO (MAPPO), initialized from the offline policy and fine-tuned in real time, and (c) comprehensive evaluation of COHORT on vision-language model (VLM) inference tasks such as CLIP and SAM, analyzing scalability with increasing robot/workload and robustness under . We benchmark COHORT against genetic algorithms and multiple RL baselines. Experimental results demonstrate that COHORT reduces battery consumption by 15.4% and increases GPU utilization by 51.67%, while satisfying frame-rate and deadline constraints 2.55 times of the time.
Mohammad Saeid Anwar, Anuradha Ravi, Indrajeet Ghosh +3
University of Maryland Baltimore County · DEVCOM Army Research Laboratory