Daily Tech Briefing
AI 科技速览
每天 5 分钟内学习 AI。获取最新的人工智能新闻,理解其重要性,并学习如何将其应用于您的工作。
arXiv Machine Learning · 2026/7/22 04:00:00
Multi-Timescale Latent-Action DRL for Joint Optimization in Edge-Cloud Networks
AI 中文解读
边缘-云网络迎来智能调度新方案!这项研究提出了一种名为2T-MDRL-LA的深度强化学习框架,能同时优化服务部署、用户连接、计算分配、任务卸载和功率控制,平均端到端延迟降低20.8%,资源利用率提升13%,而且收敛速度比传统方法快约50%。
简单来说,在边缘计算和云计算混合的网络中,任务像潮水一样涌来,服务器忙的忙、闲的闲。传统方法要么反应慢,要么容易卡顿。研究者发现,有的决策需要长期规划(比如放在哪台服务器上),有的需要秒级微调(比如任务分给谁干)。于是设计了一套“双时间尺度”的AI调度系统:长期规划像制定城市路网,短期调度像实时交通指挥,两者配合。为解决“选项太多”的难题,还引入变分自编码器压缩行动空间,让AI能快速找到最优解。
对普通人来说,这意味着未来用的视频通话、在线游戏、智能家居指令,甚至自动驾驶的数据处理,都会更快更稳,不再出现转圈等待或画面卡顿。企业也能用更少的服务器满足更多用户需求,降低运营成本。这项技术让边缘-云网络的智能化水平上了一个新台阶。
arXiv:2607.18288v1 Announce Type: new
Abstract: Load imbalance across edge and cloud layers degrades latency performance in hierarchical edge-cloud computing (HECC) systems under dynamic task arrivals and heterogeneous resources, leading to severe queuing delays and inefficient resource utilization. To address this challenge, we study a joint service placement, computational delegation, and power control (JSCP) problem to minimize the average end-to-end (e2e) latency. The resulting JSCP problem is a mixed-integer nonconvex and NP-hard optimization problem due to the strong coupling between discrete and continuous variables. To enable tractable optimization and stable system adaptation, we exploit the inherent difference in decision dynamics and decompose the problem into long-term system configuration and short-term resource allocation subproblems. Based on this formulation, we propose a two-timescale multi-layer deep reinforcement learning framework with a latent action space (2T-MDRL-LA) to jointly optimize service placement, user association, computational delegation, task offloading, and user transmit power. A latent action representation based on a variational autoencoder is introduced to efficiently compress the high-dimensional combinatorial action space. Simulation results demonstrate that the proposed framework effectively adapts to dynamic network conditions and achieves near-optimal performance compared to branch-and-bound solutions. It achieves up to a 20.8% reduction in average e2e latency and a 13% improvement in resource utilization over the scheme without the computational delegation, while converging approximately 50% faster than conventional proximal policy optimization.
分享
阅读原文 ↗