Adaptive Task-Oriented Communication with Fairness Guarantees

Learning-based joint source-channel coding (JSCC) is widely used in task-oriented communication, which aims to extract and transmit only task-relevant information to improve communication efficiency. However, the learning-empowered algorithms in task-oriented communication may bring potential bias towards sensitive groups, and the adaptability to dynamic channel conditions still remains a challenge. To address these issues, we propose a task-oriented communication scheme that achieves efficient encoding and inference while preserving group fairness. Our approach leverages an information bottleneckbased framework that maximizes the task utility information while limiting the dependence of the inference result on the sensitive attribute and adopts a hypernetwork-parametrization mechanism to adapt to varying channel conditions. We also provide a theoretical bound for fairness guarantee and design a noise injection module to control the fairness-utility tradeoff. Experiments on benchmark datasets demonstrate the superiority of our framework in achieving a fairness-utility tradeoff and the adaptability to channel variations.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11160864
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaptive Task-Oriented Communication with Fairness Guarantees

Yuanming Shi, Meixia Tao, Jiaxuan Li, Songjie Xie et al.
Distributed and Parallel Computing Systems
article

Adaptive Task-Oriented Communication with Fairness Guarantees

Yuanming Shi, Meixia Tao, Jiaxuan Li, Songjie Xie, Youlong Wu
article en

Abstract

Learning-based joint source-channel coding (JSCC) is widely used in task-oriented communication, which aims to extract and transmit only task-relevant information to improve communication efficiency. However, the learning-empowered algorithms in task-oriented communication may bring potential bias towards sensitive groups, and the adaptability to dynamic channel conditions still remains a challenge. To address these issues, we propose a task-oriented communication scheme that achieves efficient encoding and inference while preserving group fairness. Our approach leverages an information bottleneckbased framework that maximizes the task utility information while limiting the dependence of the inference result on the sensitive attribute and adopts a hypernetwork-parametrization mechanism to adapt to varying channel conditions. We also provide a theoretical bound for fairness guarantee and design a noise injection module to control the fairness-utility tradeoff. Experiments on benchmark datasets demonstrate the superiority of our framework in achieving a fairness-utility tradeoff and the adaptability to channel variations.

Shanghai Jiao Tong University (CN), Hong Kong University of Science and Technology (HK), ShanghaiTech University (CN), Shandong Jiaotong University (CN)
Openalex Percentile: Top 69%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Adaptive Task-Oriented Communication with Fairness Guarantees — Yuanming Shi, Meixia Tao, et al. · (2025) | TGRS Research Map | TGRS