Contrastive Learning and Adversarial Disentanglement for Privacy-Aware Task-Oriented Semantic Communication
Not on the map. Why?
Abstract (arXiv)
Task-oriented semantic communication systems have emerged as a promising approach to achieving efficient and intelligent data transmission in next-generation networks, where only information relevant to a specific task is communicated. This is particularly important in 6G-enabled Internet of Things (6G-IoT) scenarios, where bandwidth constraints, latency requirements, and data privacy are critical. However, existing methods struggle to fully disentangle task-relevant and task-irrelevant information, leading to privacy concerns and suboptimal performance. To address this, we propose an information-bottleneck inspired method, named CLAD (contrastive learning and adversarial disentanglement). CLAD utilizes contrastive learning to effectively capture task-relevant features while employing adversarial disentanglement to discard task-irrelevant information. Additionally, due to the absence of reliable and reproducible methods to quantify the minimality of encoded feature vectors, we introduce the Information Retention Index (IRI), a comparative metric used as a proxy for the mutual information between the encoded features and the input. The IRI reflects how minimal and informative the representation is, making it highly relevant for privacy-preserving and bandwidth-efficient 6G-IoT systems. Extensive experiments demonstrate that CLAD outperforms state-of-the-art baselines in terms of semantic extraction, task performance, privacy preservation, and IRI, making it a promising building block for responsible, efficient and trustworthy 6G-IoT services.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 22 of its 47 references that are in the map. First posted on arXiv 30 Oct 2024.
Builds on
22 of 47 references.
References · 22
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2020Supervised Contrastive Learningcited by 2,803
- 2016Membership Inference Attacks against Machine Learning Modelscited by 2,221
- 2020Big Self-Supervised Models are Strong Semi-Supervised Learnerscited by 1,375
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
- 2016Deep Variational Information Bottleneckcited by 915
- 2020What Makes for Good Views for Contrastive Learning?cited by 843
- 2018Disentangling by Factorisingcited by 614
- 2022Beyond Transmitting Bits: Context, Semantics, and Task-Oriented Communicationscited by 166
10 more
- 2019A Vision of 6G Wireless Systems: Applications, Trends, Technologies, and Open Research Problemscited by 157
- 2019Understanding the Limitations of Variational Mutual Information Estimatorscited by 140
- 2021Learning Task-Oriented Communication for Edge Inference: An Information Bottleneck Approachcited by 105
- 2020The Conditional Entropy Bottleneckcited by 75
- 2017Learning Disentangled Representations with Semi-Supervised Deep Generative Modelscited by 72
- 2019Learning Disentangled Representations via Mutual Information Estimationcited by 52
- 2023Large Generative AI Models for Telecom: The Next Big Thing?cited by 52
- 2022Robust Information Bottleneck for Task-Oriented Communication with Digital Modulationcited by 28
- 2020Disentangled Information Bottleneckcited by 24
- 2023Accelerating and Compressing Deep Neural Networks for Massive MIMO CSI Feedbackcited by 2
Built on by
Citing papers per year: 2025: 3.
3 papers.
- 2025Adaptive Token Merging for Efficient Transformer Semantic Communication at the Edge12 Sep 2025
- 2025Adaptive Pareto-Optimal Token Merging for Edge Transformer Models in Semantic Communication11 Sep 2025
- 2025Diffusion-aided Task-oriented Semantic Communications with Model Inversion Attack24 Jun 2025