cs.LGDec 24, 2024

Accelerating AIGC Services with Latent Action Diffusion Scheduling in Edge Networks

Authors: Changfu Xu, Jianxiong Guo, Wanyu Lin, Haodong Zou, Yuzhu Liang, Xiaowen Chu, Jiannong Cao, Tian Wang

Organizations: BNU-HKBU United International College, Zhuhai 519087, China, and the Hong Kong Baptist University, Hong Kong. · Institute of Artificial Intelligence and Future Networks, Beijing Normal University, Zhuhai 519087, China, and the Guangdong Key Lab of AI and Multi-Modal Data Processing, BNU-HKBU United International College, Zhuhai 519087, China. · Department of Computing, Hong Kong Polytechnic University, Hong Kong. · Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China. · 

Abstract

Artificial Intelligence Generated Content (AIGC) has gained significant popularity for creating diverse content. However, current AIGC models primarily focus on content quality within a centralized framework, resulting in a high service delay and negative user experiences. The workload of an AIGC task is determined by model complexity and multi-layered encoder architectures, posing significant challenges for its modeling, deployment, and scheduling within resource-constrained edge networks. We model an offloading problem among edges for providing real AIGC services and propose LAD-TS, a novel Latent Action Diffusion-based Task Scheduling method that orchestrates multiple edge servers for expedited AIGC services by leveraging the diffusion model's conditional guidance capability and the reinforcement learning's environment interaction ability. We first design an innovative Latent Action Diffusion Network (LADN) model based on traditional diffusion models. We then incorporate the LADN model into deep reinforcement learning, forming an effective LAD-TS method for task scheduling in distributed edge networks. Meanwhile, we design a latent action diffusion strategy to achieve near-optimal decisions quickly by utilizing historical action probabilities instead of Gaussian noise. Furthermore, we implement a refined AIGC model and develop DEdgeAI, a prototype edge system with the refined AIGC model deployment to evaluate our LAD-TS method. DEdgeAI provides a real AIGC service for users, demonstrating up to 7.36%−18.11%7.36\%-18.11\% and 34.07%−94.96%34.07\%-94.96\% shorter service delays than the state-of-the-art methods and representative commercial platforms, respectively. We release our open-source code at https://github.com/ChangfuXu/DEdgeAI/

Figures & tables

Explore similar work

Aug 29, 2026

A-MADiff: Attention-Guided Multi-Agent DRL with Diffusion Policies for Memory-Aware Task Orchestration in Mobile AIGC Networks

Artificial Intelligence-Generated Content (AIGC) services employ Generative AI (GenAI) models to automatically generate diverse content. Mobile AIGC networks host GenAI models on edge-located AIGC Service Providers (ASPs) to deliver low-latency and personalized AIGC services for mobile users. However, AIGC inference tasks typically occupy GPU memory until task completion, causing GPU memory exhaustion at serving ASPs and triggering out-of-memory failures rather than merely increasing service latency. Existing studies on AIGC task orchestration have largely overlooked GPU memory feasibility constraints. To address this issue, we develop a cooperative multi-agent orchestration framework, in which each edge node is equipped with a scheduling agent to route tasks to local ASPs or neighboring edge nodes. Since scheduling agents make decisions based only on local observations, while peer offloading couples their resource states and long-term utilities, we formulate the orchestration process as a cooperative Decentralized Partially Observable Markov Decision Process (Dec-POMDP). To solve the Dec-POMDP, we propose an Attention-guided Multi-Agent deep reinforcement learning algorithm with Diffusion policies (A-MADiff) under the centralized training with a decentralized execution paradigm. A-MADiff employs diffusion-based decentralized actors to generate multi-modal preferences over feasible orchestration actions, and an attention-guided centralized critic to estimate per-agent values from cross-agent states under GPU memory heterogeneity. Numerical results demonstrate that A-MADiff significantly improves the cumulative reward over the state-of-the-art baseline.
Feb 6, 2026

Multi-Agentic AI for Fairness-Aware and Accelerated Multi-modal Large Model Inference in Real-world Mobile Edge Networks

Generative AI (GenAI) has transformed applications in natural language processing and content creation, yet centralized inference remains hindered by high latency, limited customizability, and privacy concerns. Deploying large models (LMs) in mobile edge networks emerges as a promising solution. However, it also poses new challenges, including heterogeneous multi-modal LMs with diverse resource demands and inference speeds, varied prompt/output modalities that complicate orchestration, and resource-limited infrastructure ill-suited for concurrent LM execution. In response, we propose a Multi-Agentic AI framework for latency- and fairness-aware multi-modal LM inference in mobile edge networks. Our solution includes a long-term Global Planning Agent, a short-term Prompt Scheduling Agent, and multiple on-node LM Deployment Agents, all powered by foundation language models. These agents cooperatively optimize prompt routing and LM deployment through natural language reasoning over runtime telemetry and historical experience. To evaluate its performance, we further develop a city-wide testbed that supports network monitoring, containerized LM deployment, intra-server resource management, and inter-server communications. Experiments demonstrate that our solution reduces average end-to-end latency by 42.9% compared with a state-of-the-art online-learning baseline and by 80.6% compared with the full-activation baseline, while maintaining a mean service-type Jain's index of 0.925. Moreover, our solution adapts quickly without fine-tuning, offering a generalizable solution for optimizing GenAI services in edge environments.
Sep 15, 2026

End-to-End Latency-Minimizing and Load-Balanced Request Scheduling for Edge LLM Inference in Agentic AI Services

Large language model (LLM)-powered agentic AI services increasingly demand low-latency inference, motivating the deployment of LLMs across distributed edge servers. However, heterogeneous communication and computing capabilities, together with dynamically evolving inference states, make the edge server selection for each incoming request time-varying and tightly coupled across slots. In this paper, we investigate an online request scheduling framework for edge LLM inference that jointly minimizes long-term average end-to-end latency and regulates workload distribution across heterogeneous edge servers. Two main challenges arise in this context. First, conventional latency models cannot accurately capture the fine-grained dynamics of multi-stage LLM execution. Second, the latency consequence of a scheduling decision is observed only after request completion, making immediate decision evaluation difficult. To address these challenges, we develop a cross-slot inference model that captures transmission, prefill, iteration-level decoding, and key-value (KV) cache evolution for each diverse request, and characterize server workload through a KV cache memory-time consumption metric. We propose the LYREO approach that transforms the long-term load-balancing constraint via Lyapunov optimization and employs reward redistribution with sequencebased return prediction to convert delayed outcomes into timely learning signals for earlier decisions. Simulations under various configurations demonstrate that LYREO consistently achieves lower latency and more balanced load distribution than representative learning-based and heuristic baseline schemes.