Communication with Imperfectly Shared Randomness

Communication with Imperfectly Shared Randomness
Published By Clips Today, Publish Date: Wednesday 22nd June 2016
175 views
0 Dislike
2 Like

Communication with Imperfectly Shared Randomness

Watch most popular videos on Clips Today November 2021. Full HD video Communication with Imperfectly Shared Randomness. This video has been updated on November 2021.You can watch and free download this Youtube video from this site. If you Browse "Communication with Imperfectly Shared Randomness November 2021" you can download this video and also You can see a list of Clips Today Communication with Imperfectly Shared Randomness November 2021 related all videos.

A common feature in most natural communication is that it relies on a large shared context between speaker and listener, where the context is shared vaguely rather than precisely. Knowledge of language, technical terms, socio-political events, history etc. all combine to form this shared context; and it should be obvious that no one can expect any part of this context to be shared perfectly by the two parties. This shared context helps in compressing communication (else I would have to include an English dictionary, a book on grammar etc. to this abstract); but the imperfection of the sharing potentially leads to misunderstanding and ambiguity. The challenge of achieving the benefits provided by the shared context without leading to new errors due to the imperfection leads to a host of new mathematical questions. In this talk we will focus on one specific setting for this tension between shared context and imperfection of sharing, namely in the use of shared randomness in communication complexity. It is widely known that shared randomness between speaker and listener can lead to immense savings in communication complexity for certain communication tasks. What happens when this randomness is not perfectly shared? We model this as saying that sender has access to a sequence of uniform random bits and receiver has access to a noisy version of the same sequence where each bit is flipped independently with some probability p. While most known communication protocols fail when the randomness is imperfectly shared, it turns out that many of the effects of shared randomness can be recovered with a slight loss by more carefully designed protocols. Among other results we will describe a general one which shows that any k-bit one-way communication protocol with perfectly shared randomness can be "simulated" with 2 k bits of imperfectly shared randomness, and this is essentially tight. Based on joint work with Clément Canonne (Columbia), Venkatesan Guruswami (CMU), and Raghu Meka ().

Communication with Imperfectly Shared Randomness is a most popular video on Clips Today November 2021. Communication with Imperfectly Shared Randomness is a full HD video. This video has been updated on November 2021.You can watch and free download this Youtube video from this site. If you Browse "Communication with Imperfectly Shared Randomness November 2021" you can download this video and also You can see a list of Clips Today Communication with Imperfectly Shared Randomness November 2021 related all videos

microsoft research, social sciences. microsoft research Communication with Imperfectly Shared Randomness. social sciences Communication with Imperfectly Shared Randomness.