Of 27 August 6, 2015KAIST: Reliable Meaningful Communication1 Reliable Meaningful Communication Madhu Sudan Microsoft Research.

Slides:



Advertisements
Similar presentations
QMA/qpoly PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson University of Waterloo.
Advertisements

Of 23 09/24/2013HLF: Reliable Meaningful Communication1 Reliable Meaningful Communication Madhu Sudan Microsoft, Cambridge, USA.
Ulams Game and Universal Communications Using Feedback Ofer Shayevitz June 2006.
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 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.
Semantic Communication Madhu Sudan (based on joint work with Brendan Juba (MIT); and upcoming work with Oded Goldreich (Weizmann) & J. )
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.
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.
Game Design Serious Games Miikka Junnila.
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:
UCB Claude Shannon – In Memoriam Jean Walrand U.C. Berkeley
Computers in Society Encryption. Representing Sensory Experience Some objects correspond to human sensory experience – these representations are created.
Interactive Proofs For Quantum Computations Dorit Aharonov, Michael Ben-Or, Elad Eban School of Computer Science and Engineering The Hebrew University.
Of 30 September 22, 2010Semantic Berkeley 1 Semantic Goal-Oriented Communication Madhu Sudan Microsoft Research + MIT Joint with Oded Goldreich.
Philosophy of ICT and Islam Lecture 1: Philosophy of Science and Computing.
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.
DAAD project “Joint Course on OOP using Java” Design Patterns in the course ‘OOP in Java’ - first experiences Ana Madevska Bogdanova Institute of informatics.
Profile and a quick introduction Software Engineering: ) هندسة البرمجيات (in Arabic: is the branch of computer science Designed to develop a set rules.
* Discussion: DO YOU AGREE OR DISAGREE WITH THESE STATEMENTS? WHY OR WHY NOT? 1.The difficulty of a text depends mostly on the vocabulary it contains.
Theory (and Application) Learning: A change in human performance or performance potential that results from practice or other experience and endures over.
Of 19 June 15, 2015CUHK: Communication Amid Uncertainty1 Communication Amid Uncertainty Madhu Sudan Microsoft Research Based on joint works with Brendan.
Communication & Computing Madhu Sudan ( MSR New England ) Theories of.
Toward a Secure Data-Rate Theorem Paul Cuff. Control Setting Controller Encoder System (Plant) Sensors Rate R UiUi XiXi YiYi.
A Research Agenda for Scientific Foundations of Security David Evans University of Virginia NITRD Post-Oakland Program 25 May 2011 Artwork: Giacomo Marchesi.
11/3/2008Communication & Computation1 A need for a new unifying theory Madhu Sudan MIT CSAIL.
Codes & the Hat Game Troy Lynn Bullock John H. Reagan High School, Houston ISD Shalini Kapoor McArthur High School, Aldine ISD Faculty Mentor: Dr. Tie.
Coding Theory Efficient and Reliable Transfer of Information
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)
Of 22 10/30/2015WUSTL: Uncertain Communication1 Communication Amid Uncertainty Madhu Sudan Harvard Based on Juba, S. (STOC 2008, ITCS 2011) Juba, S. (STOC.
1 Conference key-agreement and secret sharing through noisy GHZ states Kai Chen and Hoi-Kwong Lo Center for Quantum Information and Quantum Control, Dept.
10/14/2008Semantic Communication1 Universal Semantic Communication Madhu Sudan MIT CSAIL Joint work with Brendan Juba (MIT CSAIL).
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
Gillat Kol (IAS) joint work with Anat Ganor (Weizmann) Ran Raz (Weizmann + IAS) Exponential Separation of Information and Communication.
Information Technology Michael Brand Joint work with David L. Dowe 8 February, 2016 Information Technology.
Lecture 20 CSE 331 July 30, Longest path problem Given G, does there exist a simple path of length n-1 ?
Imperfectly Shared Randomness
Communication Amid Uncertainty
Communication Amid Uncertainty
Communication Amid Uncertainty
Communication amid Uncertainty
Universal Semantic Communication
Communication & Computation A need for a new unifying theory
General Strong Polarization
Communication Amid Uncertainty
Uncertain Compression
General Strong Polarization
Using Secret Key to Foil an Eavesdropper
Imperfectly Shared Randomness
Universal Semantic Communication
Universal Semantic Communication
Information-Theoretic Security
Communication Amid Uncertainty
Universal Semantic Communication
Presentation transcript:

of 27 August 6, 2015KAIST: Reliable Meaningful Communication1 Reliable Meaningful Communication Madhu Sudan Microsoft Research

of 27 This Talk Part I: Reliable Communication Part I: Reliable Communication Problem and History (briefly) Problem and History (briefly) Part II: Recovering when errors overwhelm Part II: Recovering when errors overwhelm Sample of my work in the area Sample of my work in the area Part III: Modern challenges Part III: Modern challenges Communicating amid uncertainty Communicating amid uncertainty August 6, 2015KAIST: Reliable Meaningful Communication2

of 27 Part I: Reliable Communication August 6, 2015KAIST: Reliable Meaningful Communication3

of 27 Reliable Communication? Problem from the 1940s: Advent of digital age. Problem from the 1940s: Advent of digital age. Communication media are always noisy Communication media are always noisy But digital information less tolerant to noise! But digital information less tolerant to noise! August 6, 2015KAIST: Reliable Meaningful Communication4 AliceAlice BobBob We are not ready We are now ready

of 27 Reliability by Repetition August 6, 2015KAIST: Reliable Meaningful Communication5

of 27 Shannon’s Theory [1948] August 6, 2015KAIST: Reliable Meaningful Communication6 AliceAlice BobBob Encoder Decoder

of 27 Shannon’s Theorem August 6, 2015KAIST: Reliable Meaningful Communication7

of 27 Shannon’s contributions Far-reaching architecture: Far-reaching architecture: Profound analysis: Profound analysis: First (?) use of probabilistic method. First (?) use of probabilistic method. Deep Mathematical Discoveries: Deep Mathematical Discoveries: Entropy, Information, Bit? Entropy, Information, Bit? August 6, 2015KAIST: Reliable Meaningful Communication8 AliceAlice BobBob Encoder Decoder

of 27 Challenges post-Shannon August 6, 2015KAIST: Reliable Meaningful Communication9

of 27 Progress Profound contributions to the theory: Profound contributions to the theory: New coding schemes, decoding algorithms, analysis techniques … New coding schemes, decoding algorithms, analysis techniques … Major fields of research: Major fields of research: Communication theory, Coding Theory, Information Theory. Communication theory, Coding Theory, Information Theory. Sustained Digital Revolution: Sustained Digital Revolution: Widespread conversion of everything to “bits” Widespread conversion of everything to “bits” Every storage and communication technology relies/builds on the theory. Every storage and communication technology relies/builds on the theory. “Marriage made in heaven” [Jim Massey] “Marriage made in heaven” [Jim Massey] August 6, 2015KAIST: Reliable Meaningful Communication10

of 27 Part II: Overwhelming #errors August 6, 2015KAIST: Reliable Meaningful Communication11

of 27 Explicit Codes: Reed-Solomon Code August 6, 2015KAIST: Reliable Meaningful Communication12

of 27 Overwhelming Errors? List Decoding August 6, 2015KAIST: Reliable Meaningful Communication13

of 27 Reed-Solomon List-Decoding Problem August 6, 2015KAIST: Reliable Meaningful Communication14

of 27 Decoding by example + picture [S’96] Algorithm idea: Find algebraic explanation Find algebraic explanation of all points. of all points. Stare at the solution Stare at the solution (factor the polynomial) (factor the polynomial) Ssss Ssss August 6, 2015KAIST: Reliable Meaningful Communication15

of 27 Decoding by example + picture [S’96] Algorithm idea: Find algebraic explanation Find algebraic explanation of all points. of all points. Stare at the solution Stare at the solution (factor the polynomial) (factor the polynomial) Ssss Ssss August 6, 2015KAIST: Reliable Meaningful Communication16

of 27 August 6, 2015KAIST: Reliable Meaningful Communication17 Decoding Algorithm

of 27 Part III: Modern Challenges Communication Amid Uncertainty? August 6, 2015KAIST: Reliable Meaningful Communication18

of 27 New Kind of Uncertainty Uncertainty always has been a central problem: Uncertainty always has been a central problem: But usually focusses on uncertainty introduced by the channel But usually focusses on uncertainty introduced by the channel Rest of the talk: Uncertainty at the endpoints (Alice/Bob) Rest of the talk: Uncertainty at the endpoints (Alice/Bob) Modern complication: Modern complication: Alice+Bob communicating using computers Alice+Bob communicating using computers Huge diversity of computers/computing environments Huge diversity of computers/computing environments Computers as diverse as humans; likely to misinterpret communication. Computers as diverse as humans; likely to misinterpret communication. Alice: How should I “explain” to Bob? Alice: How should I “explain” to Bob? Bob: What did Alice mean to say? Bob: What did Alice mean to say? August 6, 2015KAIST: Reliable Meaningful Communication19

of 27 New Era, New Challenges: Interacting entities not jointly designed. Interacting entities not jointly designed. Can’t design encoder+decoder jointly. Can’t design encoder+decoder jointly. Can they be build independently? Can they be build independently? Can we have a theory about such? Can we have a theory about such? Where we prove that they will work? Where we prove that they will work? Hopefully: Hopefully: YES YES And the world of practice will adopt principles. And the world of practice will adopt principles. August 6, 2015KAIST: Reliable Meaningful Communication20

of 27 Example Problem Archiving data Archiving data Physical libraries have survived for 100s of years. Physical libraries have survived for 100s of years. Digital books have survived for five years. Digital books have survived for five years. Can we be sure they will survive for the next five hundred? Can we be sure they will survive for the next five hundred? Problem: Uncertainty of the future. Problem: Uncertainty of the future. What formats/systems will prevail? What formats/systems will prevail? Why aren’t software systems ever constant? Why aren’t software systems ever constant? Problem: Problem: When designing one system, it is uncertain what the other’s design is (or will be in the future)! When designing one system, it is uncertain what the other’s design is (or will be in the future)! August 6, 2015KAIST: Reliable Meaningful Communication21

of 27 Challenge: If Decoder does not know the Encoder, how should it try to guess what it meant? If Decoder does not know the Encoder, how should it try to guess what it meant? Similar example: Similar example: Learning to speak a foreign language Learning to speak a foreign language Humans do … (?) Humans do … (?) Can we understand how/why? Can we understand how/why? Will we be restricted to talking to humans only? Will we be restricted to talking to humans only? Can we learn to talk to “aliens”? Whales? Can we learn to talk to “aliens”? Whales? Claim: Claim: Questions can be formulated mathematically. Questions can be formulated mathematically. Solutions still being explored. Solutions still being explored. August 6, 2015KAIST: Reliable Meaningful Communication22

of 27 Modelling uncertainty Classical Shannon Model August 6, 2015KAIST: Reliable Meaningful Communication23 A B Channel B2B2B2B2 AkAkAkAk A3A3A3A3 A2A2A2A2 A1A1A1A1 B1B1B1B1 B3B3B3B3 BjBjBjBj Uncertain Communication Model New Class of Problems New challenges Needs more attention!

of 27 Modern questions/answers Communicating players share large context. Communicating players share large context. Knowledge of English, grammar, socio-political context Knowledge of English, grammar, socio-political context Or … Operating system, communication protocols, apps, compression schemes. Or … Operating system, communication protocols, apps, compression schemes. But sharing is not perfect. But sharing is not perfect. Can we retain some of the benefit of the large shared context, when sharing is imperfect? Can we retain some of the benefit of the large shared context, when sharing is imperfect? Answer: Yes … in many cases … [ ongoing work ] Answer: Yes … in many cases … [ ongoing work ] New understanding of human mechanisms New understanding of human mechanisms New reliability mechanisms coping with uncertainty! New reliability mechanisms coping with uncertainty! August 6, 2015KAIST: Reliable Meaningful Communication24

of 27 Language as compression August 6, 2015KAIST: Reliable Meaningful Communication25 1 2

of 27 Summary Reliability in Communication Reliability in Communication Key Engineering problem of the past century Key Engineering problem of the past century Led to novel mathematics Led to novel mathematics Remarkable solutions Remarkable solutions Hugely successful in theory and practice Hugely successful in theory and practice New Era has New Challenges New Era has New Challenges Hopefully new solutions, incorporating ideas from … Hopefully new solutions, incorporating ideas from … Information theory, computability/complexity, game theory, learning, evolution, linguistics … Information theory, computability/complexity, game theory, learning, evolution, linguistics … … Further enriching mathematics … Further enriching mathematics August 6, 2015KAIST: Reliable Meaningful Communication26

of 27 Thank You! August 6, 2015KAIST: Reliable Meaningful Communication27

of 27 A challenging special case August 6, 2015KAIST: Reliable Meaningful Communication28

of 27 Meaning of Meaning? Difference between meaning and words Difference between meaning and words Exemplified in Exemplified in Turing machine vs. universal encoding Turing machine vs. universal encoding Algorithm vs. computer program Algorithm vs. computer program Can we learn to communicate former? Can we learn to communicate former? Many universal TMs, programming languages Many universal TMs, programming languages [Juba,S.’08], [Goldreich,Juba,S.’12]: [Juba,S.’08], [Goldreich,Juba,S.’12]: Not generically … Not generically … Must have a goal: what will we get from the bits? Must have a goal: what will we get from the bits? Must be able to sense progress towards goal. Must be able to sense progress towards goal. Can use sensing to detect errors in understanding, and to learn correct meaning. Can use sensing to detect errors in understanding, and to learn correct meaning. [Leshno,S’13]: [Leshno,S’13]: Game theoretic interpretation Game theoretic interpretation August 6, 2015KAIST: Reliable Meaningful Communication29

of 27 Communication as Coordination Game [Leshno,S.’13] Two players playing series of coordination games Two players playing series of coordination games Coordination? Coordination? Two players simultaneously choose 0/1 actions. Two players simultaneously choose 0/1 actions. “Win” if both agree : “Win” if both agree : Alice’s payoff: not less if they agree Alice’s payoff: not less if they agree Bob’s payoff: strictly higher if they agree. Bob’s payoff: strictly higher if they agree. How should Bob play? How should Bob play? Doesn’t know what Alice will do. But can hope to learn. Doesn’t know what Alice will do. But can hope to learn. Can he hope to eventually learn her behavior and (after finite # of miscoordinations) always coordinate? Can he hope to eventually learn her behavior and (after finite # of miscoordinations) always coordinate? Theorem: Theorem: Not Deterministically (under mild “general” assumptions) Not Deterministically (under mild “general” assumptions) Yes with randomness (under mild restrictions) Yes with randomness (under mild restrictions) August 6, 2015KAIST: Reliable Meaningful Communication30