Learning Network Sheaves for AI-native Semantic Communication
Preprint
Abstract
Recent advances in AI call for a paradigm shift from bit-centric communication to goal- and semantics-oriented architectures, paving the way for AI-native 6G networks. In this context, we address a key open challenge: enabling heterogeneous AI agents to exchange compressed latent-space representations while mitigating semantic noise and preserving task-relevant meaning. We cast this challenge as learning both the communication topology and the alignment maps that govern information exchange among agents, yielding a learned network sheaf equipped with orthogonal maps. This learning process is further supported by a semantic denoising end compression module that constructs a shared global semantic space and derives sparse, structured representations of each agent's latent space. This corresponds to a nonconvex dictionary learning problem solved iteratively with closed-form updates. Experiments with mutiple AI agents pre-trained on real image data show that the semantic denoising and compression facilitates AI agents alignment and the extraction of semantic clusters, while preserving high accuracy in downstream task. The resulting communication network provides new insights about semantic heterogeneity across agents, highlighting the interpretability of our methodology.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Frame-Based Zero-Shot Semantic Channel Equalization for AI-Native CommunicationsIEEE Transactions on Cognitive Communications and Networking, 2026
- Latent Functional Maps: a spectral framework for representation alignment2024
- Goal-Oriented Communications for the IoT: System Design and Adaptive Resource OptimizationIEEE Internet of Things Magazine, 2023
- Latent Space Translation via Semantic Alignment2023
- Semantics-Empowered Communication for Networked Intelligent SystemsIEEE Communications Magazine, 2021
- Deep Learning Enabled Semantic Communication SystemsIEEE Transactions on Signal Processing, 2021
- Parallel and Distributed Successive Convex Approximation Methods for Big-Data Optimization2018
- A Splitting Method for Orthogonality Constrained ProblemsJournal of Scientific Computing, 2013
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011