用信息论框架提升智能体通信的泛化能力,让不同设备协作更高效。
Generalization Bounds of Emergent Communications for Agentic AI Networking

- 基于分布式信息瓶颈理论设计联合损失函数,统一优化决策与通信
- 首次给出去中心化推理下新通信协议的泛化边界,性能优于现有方案
- 适用于6G智能网络,适合关注协议自适应与系统鲁棒性的研究者
6G网络向智能体原生网络(AgentNet)演进,需从传统数据流转向任务感知的智能体通信。涌现通信让自主智能体通过交互自学习信号协议,成为突破现有固定协议架构瓶颈的潜力方案。然而,现有框架多忽略带宽、计算复杂度等物理约束,且缺乏严格的信道理论基础。本文提出一种新型涌现通信框架,基于多智能体多任务分布式信息瓶颈(DIB)理论,实现异构智能体间的协作任务求解。设计联合损失函数,统一优化决策函数与通信信号学习。该方法可量化任务相关表征与计算复杂度间的根本权衡,并为去中心化推理中未见过环境状态下的通信协议提供理论泛化界。在真实硬件原型上的实验验证表明,所提框架在泛化性能上显著优于当前最优方案。
原文摘要 · Abstract (English)
The evolution of 6G networking toward agentic AI networking (AgentNet) systems requires a shift from traditional data pipelines to task-aware, agentic AI-native communication solutions. Emergent communication, a novel communication paradigm in which autonomous agents learn their own signaling protocols through interaction, is increasingly viewed as a promising solution to address the challenges posed by existing rigid, predefined protocol-based networking architecture. However, most existing emergent communication frameworks fail to account for physical networking constraints, such as bandwidth and computational complexity, and often lack a rigorous information-theoretical foundation. To address these challenges, this paper introduces a novel emergent communication framework that facilitates collaborative task-solving among heterogeneous agents through an information-theoretic lens. We propose a novel joint loss function that unifies the optimization of decision-making functions and the learning of communication signaling. Our proposed solution is grounded on the multi-agent and multi-task distributed information bottleneck (DIB) theory, which allows the quantification of the fundamental trade-off between task-relevant information representation and computational complexity. We further provide theoretical generalization bounds of the emergent communication protocol during decentralized inference across unseen environmental states. Experimental validation on a real-world hardware prototype confirms that our proposed framework significantly improves generalization performance, compared to the state-of-the-art solutions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。