DISCD: Distributed Lossy Semantic Communication for Logical Deduction of Hypothesis
Ahmet Faruk Saz, Siheng Xiong, Faramarz Fekri

TL;DR
This paper introduces a distributed lossy semantic communication framework that enhances hypothesis testing in networks with limited communication, enabling nodes to better infer the state of the world through informative message exchange.
Contribution
The paper proposes a novel semantic communication method for distributed hypothesis testing that reduces communication costs while improving inference accuracy.
Findings
Semantic messages improve convergence to true hypotheses.
The approach outperforms random message selection in experiments.
Significant reduction in communication overhead achieved.
Abstract
In this paper, we address hypothesis testing in a distributed network of nodes, where each node has only partial information about the State of the World (SotW) and is tasked with determining which hypothesis, among a given set, is most supported by the data available within the node. However, due to each node's limited perspective of the SotW, individual nodes cannot reliably determine the most supported hypothesis independently. To overcome this limitation, nodes must exchange information via an intermediate server. Our objective is to introduce a novel distributed lossy semantic communication framework designed to minimize each node's uncertainty about the SotW while operating under limited communication budget. In each communication round, nodes determine the most content-informative message to send to the server. The server aggregates incoming messages from all nodes, updates its…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies
