Of 22 10/30/2015WUSTL: Uncertain Communication1 Communication Amid Uncertainty Madhu Sudan Harvard Based on Juba, S. (STOC 2008, ITCS 2011) Juba, S. (STOC.

Slides:



Advertisements
Similar presentations
1+eps-Approximate Sparse Recovery Eric Price MIT David Woodruff IBM Almaden.
Advertisements

Of 23 09/24/2013HLF: Reliable Meaningful Communication1 Reliable Meaningful Communication Madhu Sudan Microsoft, Cambridge, USA.
Of 35 05/30/2012CSOI-Summer: Uncertainty in Communication1 Communication amid Uncertainty Madhu Sudan Microsoft, Cambridge, USA Based on: Universal Semantic.
Of 12 12/04/2013CSOI: Communication as Coordination1 Communication as Coordination Madhu Sudan Microsoft, Cambridge, USA -
Of 19 03/21/2012CISS: Beliefs in Communication1 Efficient Semantic Communication & Compatible Beliefs Madhu Sudan Microsoft, New England Based on joint.
Of 10 09/27/2011Communication, Computing & Technology: Communication, Computing, & Technology Madhu Sudan MSR New England.
Of 13 10/08/2013MSRNE 5 th Anniversary: Communication Amid Uncertainty1 Communication Amid Uncertainty Madhu Sudan Microsoft Research.
Of 29 12/02/2013Purdue: Uncertainty in Communication1 Communication amid Uncertainty Madhu Sudan Microsoft, Cambridge, USA Based on: -Universal Semantic.
Approximate List- Decoding and Hardness Amplification Valentine Kabanets (SFU) joint work with Russell Impagliazzo and Ragesh Jaiswal (UCSD)
Of 24 11/20/2012TIFR: Deterministic Communication Amid Uncertainty1 ( Deterministic ) Communication amid Uncertainty Madhu Sudan Microsoft, New England.
Of 30 10/31/2013Cornell: Uncertainty in Communication1 Communication amid Uncertainty Madhu Sudan Microsoft, Cambridge, USA Based on: -Universal Semantic.
Of 30 09/16/2013PACM: Uncertainty in Communication1 Communication amid Uncertainty Madhu Sudan Microsoft, Cambridge, USA Based on: -Universal Semantic.
Gillat Kol (IAS) joint work with Ran Raz (Weizmann + IAS) Interactive Channel Capacity.
Of 7 10/01/2013LIDS Lunch: Communication Amid Uncertainty1 Communication Amid Uncertainty Madhu Sudan Microsoft Research.
Universal Communication Brendan Juba (MIT) With: Madhu Sudan (MIT)
Of 30 09/04/2012ITW 2012: Uncertainty in Communication1 Communication amid Uncertainty Madhu Sudan Microsoft, Cambridge, USA Based on: Universal Semantic.
1 Information complexity and exact communication bounds April 26, 2013 Mark Braverman Princeton University Based on joint work with Ankit Garg, Denis Pankratov,
Of 29 May 2, 2011 Semantic Northwestern1 Universal Semantic Communication Madhu Sudan Microsoft Research Joint with Oded Goldreich (Weizmann)
Of 27 01/06/2015CMI: Uncertain Communication1 Communication Amid Uncertainty Madhu Sudan Microsoft Research Based on Juba, S. (STOC 2008, ITCS 2011) Juba,
Of 13 October 6-7, 2010Emerging Frontiers of Information: Kickoff 1 Madhu Sudan Microsoft Research + MIT TexPoint fonts used in EMF. TexPoint fonts used.
Of 14 01/03/2015ISCA-2015: Reliable Meaningful Communication1 Reliable Meaningful Communication Madhu Sudan Microsoft, Cambridge, USA.
Of 32 October 19, 2010Semantic U.Penn. 1 Semantic Goal-Oriented Communication Madhu Sudan Microsoft Research + MIT Joint with Oded Goldreich.
Of 10 Uncertainty in Communication1 Communication amid Uncertainty Madhu Sudan Microsoft, Cambridge, USA Based on: Universal Semantic.
Of 12 03/22/2012CISS: Compression w. Uncertain Priors1 Compression under uncertain priors Madhu Sudan Microsoft, New England Based on joint works with:
CSE 501 Research Overview Atri Rudra
The Power of Randomness in Computation 呂及人中研院資訊所.
EECS 598 Fall ’01 Quantum Cryptography Presentation By George Mathew.
Of 30 September 22, 2010Semantic Berkeley 1 Semantic Goal-Oriented Communication Madhu Sudan Microsoft Research + MIT Joint with Oded Goldreich.
Of 33 March 1, 2011 Semantic UCLA1 Universal Semantic Communication Madhu Sudan Microsoft Research + MIT Joint with Oded Goldreich (Weizmann)
Of 35 05/16/2012CTW: Communication and Computation1 Communication amid Uncertainty Madhu Sudan Microsoft, Cambridge, USA Based on: Universal Semantic Communication.
Of 28 Probabilistically Checkable Proofs Madhu Sudan Microsoft Research June 11, 2015TIFR: Probabilistically Checkable Proofs1.
Of 19 June 15, 2015CUHK: Communication Amid Uncertainty1 Communication Amid Uncertainty Madhu Sudan Microsoft Research Based on joint works with Brendan.
Limits of Local Algorithms in Random Graphs
Communication & Computing Madhu Sudan ( MSR New England ) Theories of.
1 Information and interactive computation January 16, 2012 Mark Braverman Computer Science, Princeton University.
Richard W. Hamming Learning to Learn The Art of Doing Science and Engineering Session 13: Information Theory ` Learning to Learn The Art of Doing Science.
Cryptography In the Bounded Quantum-Storage Model Christian Schaffner, BRICS University of Århus, Denmark ECRYPT Autumn School, Bertinoro Wednesday, October.
1 A Randomized Space-Time Transmission Scheme for Secret-Key Agreement Xiaohua (Edward) Li 1, Mo Chen 1 and E. Paul Ratazzi 2 1 Department of Electrical.
Introduction to Quantum Key Distribution
Coding Theory Efficient and Reliable Transfer of Information
Bayesianism, Convexity, and the quest towards Optimal Algorithms Boaz Barak Harvard UniversityMicrosoft Research.
The Cost of Fault Tolerance in Multi-Party Communication Complexity Binbin Chen Advanced Digital Sciences Center Haifeng Yu National University of Singapore.
Of 27 August 6, 2015KAIST: Reliable Meaningful Communication1 Reliable Meaningful Communication Madhu Sudan Microsoft Research.
The Price of Uncertainty in Communication Brendan Juba (Washington U., St. Louis) with Mark Braverman (Princeton)
Of 27 12/03/2015 Boole-Shannon: Laws of Communication of Thought 1 Laws of Communication of Thought? Madhu Sudan Harvard.
Of 22 10/07/2015UMass: Uncertain Communication1 Communication Amid Uncertainty Madhu Sudan Microsoft Research Based on Juba, S. (STOC 2008, ITCS 2011)
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Lecture 20 CSE 331 July 30, Longest path problem Given G, does there exist a simple path of length n-1 ?
Of 17 Limits of Local Algorithms in Random Graphs Madhu Sudan MSR Joint work with David Gamarnik (MIT) 7/11/2013Local Algorithms on Random Graphs1.
Imperfectly Shared Randomness
Communication Amid Uncertainty
And now for something completely different!
Communication Amid Uncertainty
Communication Amid Uncertainty
Communication amid Uncertainty
Universal Semantic Communication
General Strong Polarization
Communication Amid Uncertainty
Quantum Information Theory Introduction
Uncertain Compression
General Strong Polarization
Imperfectly Shared Randomness
Universal Semantic Communication
Universal Semantic Communication
Universal Semantic Communication
Communication Amid Uncertainty
Universal Semantic Communication
What should I talk about? Aspects of Human Communication
General Strong Polarization
General Strong Polarization
Presentation transcript:

of 22 10/30/2015WUSTL: Uncertain Communication1 Communication Amid Uncertainty Madhu Sudan Harvard Based on Juba, S. (STOC 2008, ITCS 2011) Juba, S. (STOC 2008, ITCS 2011) Goldreich, Juba, S. (JACM 2011) Goldreich, Juba, S. (JACM 2011) Juba, Kalai, Khanna, S. (ITCS 2011) Juba, Kalai, Khanna, S. (ITCS 2011) Haramaty, S. (ITCS 2014) Haramaty, S. (ITCS 2014) Canonne, Guruswami, Meka, S. (ITCS 2015) Canonne, Guruswami, Meka, S. (ITCS 2015) Ghazi, Kamath, S. (SODA 2016) Ghazi, Kamath, S. (SODA 2016) Ghazi, Komargodski, Kothari, S. (SODA 2016) Ghazi, Komargodski, Kothari, S. (SODA 2016) Leshno, S. (manuscript) Leshno, S. (manuscript)

of 22 Communication vs. Computation Communication vs. Computation Interdependent technologies: Neither can exist without other Interdependent technologies: Neither can exist without other Technologies/Products/Commerce developed (mostly) independently. Technologies/Products/Commerce developed (mostly) independently. Early products based on clean abstractions of the other. Early products based on clean abstractions of the other. Later versions added other capability as afterthought. Later versions added other capability as afterthought. Today products … deeply integrated. Today products … deeply integrated. Deep theories: Deep theories: 10/30/2015WUSTL: Uncertain Communication2 Well separated … and have stayed that way Turing ‘36 Shannon ‘48

of 22 Consequences of the wall 10/30/2015WUSTL: Uncertain Communication3

of 22 Sample problems: Universal printing: Universal printing: You are visiting a friend. You can use their Wifi network, but not their printer. Why? You are visiting a friend. You can use their Wifi network, but not their printer. Why? Projecting from your laptop: Projecting from your laptop: Machines that learn to communicate, and learn to understand each other. Machines that learn to communicate, and learn to understand each other. Digital libraries: Digital libraries: Data that lives forever (communication across time), while devices change. Data that lives forever (communication across time), while devices change. 10/30/2015WUSTL: Uncertain Communication4

of 22 Essence of “semantics”: Uncertainty Shannon: Shannon: “The significant aspect is that the actual message is one selected from a set of possible messages” “The significant aspect is that the actual message is one selected from a set of possible messages” Essence of unreliability today: Essence of unreliability today: Context: Determines set of possible messages. Context: Determines set of possible messages. dictionary, grammar, general knowledge dictionary, grammar, general knowledge coding scheme, prior distribution, communication protocols … coding scheme, prior distribution, communication protocols … Context is HUGE; and not shared perfectly; Context is HUGE; and not shared perfectly; 10/30/2015WUSTL: Uncertain Communication5

of 22 Modelling uncertainty Classical Shannon Model 10/30/2015WUSTL: Uncertain Communication6 A B Channel B2B2B2B2 AkAkAkAk A3A3A3A3 A2A2A2A2 A1A1A1A1 B1B1B1B1 B3B3B3B3 BjBjBjBj Uncertain Communication Model New Class of Problems New challenges Needs more attention!

of 22 Hope Better understanding of existing mechanisms Better understanding of existing mechanisms In natural communication In natural communication In “ad-hoc” (but “creative”) designs In “ad-hoc” (but “creative”) designs What problems are they solving? What problems are they solving? Better solutions? Better solutions? Or at least understand how to measure the quality of a solution. Or at least understand how to measure the quality of a solution. 10/30/2015WUSTL: Uncertain Communication7

of 22 10/30/2015WUSTL: Uncertain Communication8 II: Uncertain Compression

of 22 Human-Human Communication 10/30/2015WUSTL: Uncertain Communication9 Prob. distribution on messages

of 22 Human Communication /30/2015WUSTL: Uncertain Communication10ReceivercontextSendercontext

of 22 Implications 10/30/2015WUSTL: Uncertain Communication11

of 22 10/30/2015WUSTL: Uncertain Communication12 III: Imperfectly Shared Randomness

of 22 Communication (Complexity) 10/30/2015WUSTL: Uncertain Communication13 AliceAlice BobBob CompressDecompress

of 22 (Recall) Communication Complexity (Recall) Communication Complexity The model The model 10/30/2015WUSTL: Uncertain Communication14 (with shared randomness) AliceAlice BobBob w.p. 2/3 Usually studied for lower bounds. This talk: CC as +ve model.

of 22 Brief history 10/30/2015WUSTL: Uncertain Communication15 [Ghazi, Kamath, S., SODA 2016]:Taxonomy of simple problems; Many interesting problems and protocols!

of 22 Results 10/30/2015WUSTL: Uncertain Communication16

of 22 Some General Lessons Compression Protocol: Compression Protocol: Adds “error-correction” to [JKKS] protocol. Adds “error-correction” to [JKKS] protocol. Send shortest word that is far from words of other high probability messages. Send shortest word that is far from words of other high probability messages. Another natural protocol. Another natural protocol. General Protocol: General Protocol: Much more “statistical” Much more “statistical” Classical protocol for Equality: Classical protocol for Equality: Alice sends random coordinate of ECC(x) Alice sends random coordinate of ECC(x) New Protocol New Protocol ~ Alice send # 1’s in random subset of coordinates. ~ Alice send # 1’s in random subset of coordinates. 10/30/2015WUSTL: Uncertain Communication17

of 22 10/30/2015WUSTL: Uncertain Communication18 IV: Focussed Communication

of 22 Model 10/30/2015WUSTL: Uncertain Communication19

of 22 Results 10/30/2015WUSTL: Uncertain Communication20

of 22 Conclusions 10/30/2015WUSTL: Uncertain Communication21 (which is a good thing)

of 22 Thank You! 10/30/2015WUSTL: Uncertain Communication22

of 22 10/30/2015WUSTL: Uncertain Communication23 IV: Coordination

of 22 Communicate meaning? 10/30/2015WUSTL: Uncertain Communication24

of 22 (Mis) Understanding? Uncertainty problem: Uncertainty problem: Sender/receiver disagree on meaning of bits Sender/receiver disagree on meaning of bits Definition of Understanding? Definition of Understanding? Sender sends instructions; Receiver follows? Sender sends instructions; Receiver follows? Errors undetectable (by receiver) Errors undetectable (by receiver) Not the right definition anyway: Not the right definition anyway: Does receiver want to follow instructions Does receiver want to follow instructions What does receiver gain by following instructions? Must have its own “Goal”/”Incentives”. What does receiver gain by following instructions? Must have its own “Goal”/”Incentives”. [ Goldreich,Juba,S ]: Goal-oriented communication: [ Goldreich,Juba,S ]: Goal-oriented communication: 10/30/2015WUSTL: Uncertain Communication25ReceiverdictionarySenderdictionary

of 22 (Mis) Understanding? Uncertainty problem: Uncertainty problem: Sender/receiver disagree on meaning of bits Sender/receiver disagree on meaning of bits Definition of Understanding? Definition of Understanding? Receiver has goals/incentives. Receiver has goals/incentives. [ Goldreich,Juba,S ]: Goal-oriented communication: [ Goldreich,Juba,S ]: Goal-oriented communication: Define general communication problems (and goals) Define general communication problems (and goals) Show that if Show that if Sender can help receiver achieve goal (from any state) Sender can help receiver achieve goal (from any state) Receiver can sense progress towards goal Receiver can sense progress towards goal then then Receiver can achieve goal. Receiver can achieve goal. Functional definition of understanding. Functional definition of understanding. 10/30/2015WUSTL: Uncertain Communication26ReceiverdictionarySenderdictionary

of 22 Illustration: (Repeated) Coordination 10/30/2015WUSTL: Uncertain Communication27

of 22 Our setting 10/30/2015WUSTL: Uncertain Communication28

of 22 Coordination with Uncertainty 10/30/2015WUSTL: Uncertain Communication29

of 22 Lessons Coordination is possible: Coordination is possible: Even in extreme settings where Even in extreme settings where Alice has almost no idea of Bob Alice has almost no idea of Bob Bob has almost no idea of Alice Bob has almost no idea of Alice Alice is trying to learn Bob Alice is trying to learn Bob Bob is trying to learn Alice Bob is trying to learn Alice Learning is slow … Learning is slow … Need to incorporate beliefs to measure efficiency. [Juba, S. 2011] Need to incorporate beliefs to measure efficiency. [Juba, S. 2011] Does process become more efficient when languages have structure? [Open] Does process become more efficient when languages have structure? [Open] 10/30/2015WUSTL: Uncertain Communication30