Search arXivSearch

arXiv · 2608.29255

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

Abstract

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 \underline{A}ttention-guided \underline{M}ulti-\underline{A}gent deep reinforcement learning algorithm with \underline{Diff}usion 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.

Explore related subjects

Keep this discovery

BibTeXRIS

Chongzhi Wu, Zhengtao Li, Jiawen Kang, Jinbo Wen, Xiaohuan Li, Maomao Zhang, Ekram Hossain. 2026-08-29. A-MADiff: Attention-Guided Multi-Agent DRL with Diffusion Policies for Memory-Aware Task Orchestration in Mobile AIGC Networks. https://arxiv.org/abs/2608.29255

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

Off the Normal Path: Learning Spatial Density Models of Node Mobility

We consider the problem of learning models of spatial density functions, representing the steady-state density of mobile nodes moving on a two-dimensional terrain. Deriving such models can assist in network design and optimization problems, e.g., by accelerating the computation of the density function during a parameter sweep. We address the question of applicability of off-the-shelf mixture density network models and of, two varieties of, normalizing flows for the description of mobile node density over a disk. We introduce the use of Möbius distributions to retain symmetric spatial relations. Our results indicate that mixtures of Möbius distributions provide interpretable, parsimonious models for the studied steady state density distributions, that match or outperform the alternatives.

cs.NI

Uncertainty-Aware Multi-Task Learning for Joint Modulation Recognition and SINR Estimation

Joint modulation recognition and signal-to-interference-plus-noise ratio (SINR) estimation can reduce duplicated processing in intelligent receivers, but the two tasks have different uncertainty characteristics. This letter proposes an uncertainty-aware multi-task model that transforms each short normalized in-phase/quadrature window into 36 deterministic, label-free statistics, learns a shared representation, and uses task-specific adapters for modulation classification and heteroscedastic SINR regression. A joint uncertainty score combines classification entropy and predicted regression variance to support selective inference. Simulations cover QPSK, 8PSK, 16QAM, and 64QAM under matched additive white Gaussian noise/Rayleigh channels and an unseen frequency-selective Rician channel. Over five independent seeds, the proposed model improves matched and unseen-channel accuracy over conventional multi-task learning by 14.86 and 8.61 percentage points, respectively, while reducing SINR mean absolute error by 1.60 and 1.61 dB. Confidence-based rejection further lowers modulation error under channel mismatch.

cs.NI

Temporal Analysis of NetFlow Datasets for Network Intrusion Detection Systems

This paper investigates the temporal analysis of NetFlow datasets for machine learning (ML)-based network intrusion detection systems (NIDS). Although many previous studies have highlighted the critical role of temporal features, such as inter-packet arrival time and flow length/duration, in NIDS, the currently available NetFlow datasets for NIDS lack these temporal features. This study addresses this gap by creating and making publicly available a set of NetFlow datasets that incorporate these temporal features [1]. With these temporal features, we provide a comprehensive temporal analysis of NetFlow datasets by examining the distribution of various features over time and presenting time-series representations of NetFlow features. This temporal analysis has not been previously provided in the existing literature. We also borrowed an idea from signal processing, time frequency analysis, and tested it to see how different the time frequency signal presentations (TFSPs) are for various attacks. The results indicate that many attacks have unique patterns, which could help ML models to identify them more easily.

cs.LG