针对边缘AI生成内容服务,提出双时尺度资源调度方法以兼顾质量与延迟。
Two-Timescale Model Caching and Resource Allocation for Edge-Enabled AI-Generated Content Services
- 分长期缓存与短期分配两阶段优化,分别用DDQN和扩散模型驱动的D3PG求解。
- 实测建立模型参数量与计算资源的数学关系,支持精准资源规划。
- 适合研究边缘智能、生成式AI部署及强化学习应用的开发者参考。
生成式AI(GenAI)正推动个性化AI生成内容(AIGC)服务的发展。本文针对边缘端支持AIGC服务所面临的挑战展开研究,这些挑战在现有文献中尚未充分探索。此类服务需运行参数量达数十亿的GenAI模型,对资源受限的无线边缘环境构成重大挑战。为此,本文提出了联合模型缓存与资源分配的优化框架,以平衡AIGC质量与延迟之间的权衡。通过实验获得模型计算资源需求与性能指标间的数学关系。随后,将问题分解为长期时尺度的模型缓存子问题和短期时尺度的资源分配子问题。由于前者变量为离散型,后者为连续型,本文采用双深度Q网络(DDQN)求解缓存问题,并提出基于扩散模型的深度确定性策略梯度(D3PG)算法解决资源分配问题。该算法创新性地将扩散模型作为策略网络,实现最优资源分配决策。最终,将两种学习机制集成至整体的双时尺度深度强化学习(T2DRL)算法中,通过对比数值仿真验证其性能优势。
原文摘要 · Abstract (English)
Generative AI (GenAI) has emerged as a transformative technology, enabling customized and personalized AI-generated content (AIGC) services. In this paper, we address challenges of edge-enabled AIGC service provisioning, which remain underexplored in the literature. These services require executing GenAI models with billions of parameters, posing significant obstacles to resource-limited wireless edge. We subsequently introduce the formulation of joint model caching and resource allocation for AIGC services to balance a trade-off between AIGC quality and latency metrics. We obtain mathematical relationships of these metrics with the computational resources required by GenAI models via experimentation. Afterward, we decompose the formulation into a model caching subproblem on a long-timescale and a resource allocation subproblem on a short-timescale. Since the variables to be solved are discrete and continuous, respectively, we leverage a double deep Q-network (DDQN) algorithm to solve the former subproblem and propose a diffusion-based deep deterministic policy gradient (D3PG) algorithm to solve the latter. The proposed D3PG algorithm makes an innovative use of diffusion models as the actor network to determine optimal resource allocation decisions. Consequently, we integrate these two learning methods within the overarching two-timescale deep reinforcement learning (T2DRL) algorithm, the performance of which is studied through comparative numerical simulations.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。