Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR10-155 | 14th October 2010 05:00

Efficient Semantic Communication via Compatible Beliefs

RSS-Feed




TR10-155
Authors: Brendan Juba, Madhu Sudan
Publication: 14th October 2010 08:39
Downloads: 2414
Keywords: 


Abstract:

In previous works, Juba and Sudan (STOC 2008) and Goldreich, Juba and Sudan (ECCC TR09-075) considered the idea of "semantic communication", wherein two players, a user and a server, attempt to communicate with each other without any prior common language (or communication protocol). They showed that if communication was goal-oriented and the user could sense progress towards the goal (or verify when it has been achieved), then meaningful communication is possible, in that the user's goal can be achieved whenever the server is helpful.

A principal criticism of their result has been that it is inefficient: in order to determine the "right" protocol to communicate with
the server, the user enumerates protocols and tries them out with the server until it finds one that allows it to achieve its goal. They also show settings in which such enumeration is essentially the best possible solution.

In this work we introduce definitions which allow for efficient behavior in practice. Roughly, we measure the performance of users and servers against their own "beliefs" about natural protocols. We show that if user and server are efficient with respect to their own beliefs and their beliefs are (even just slightly) compatible with each other, then they can achieve their goals very efficiently. We show that this model allows sufficiently "broad-minded" servers to talk with "exponentially" many different users in polynomial time, while dismissing the "counterexamples" in the previous work as being "narrow-minded", or based on "incompatible beliefs".



ISSN 1433-8092 | Imprint