Universal Semantic Communication

Slides:



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

The Equivalence of Sampling and Searching Scott Aaronson MIT.
Comparative Succinctness of KR Formalisms Paolo Liberatore.
Universal Semantic Communication Brendan Juba (Harvard and MIT) with Madhu Sudan (MSR and MIT) & Oded Goldreich (Weizmann)
February Semantic CMU1 Semantic Goal-Oriented Communication Madhu Sudan Microsoft Research + MIT Joint with Oded Goldreich (Weizmann)
Quantum Information and the PCP Theorem Ran Raz Weizmann Institute.
Lecture 24 MAS 714 Hartmut Klauck
Foundations of Cryptography Lecture 10 Lecturer: Moni Naor.
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 29 May 2, 2011 Semantic Northwestern1 Universal Semantic Communication Madhu Sudan Microsoft Research Joint with Oded Goldreich (Weizmann)
Dana Moshkovitz. Back to NP L  NP iff members have short, efficiently checkable, certificates of membership. Is  satisfiable?  x 1 = truex 11 = true.
Of 27 01/06/2015CMI: Uncertain Communication1 Communication Amid Uncertainty Madhu Sudan Microsoft Research Based on Juba, S. (STOC 2008, ITCS 2011) Juba,
Of 32 October 19, 2010Semantic U.Penn. 1 Semantic Goal-Oriented Communication Madhu Sudan Microsoft Research + MIT Joint with Oded Goldreich.
Complexity 15-1 Complexity Andrei Bulatov Hierarchy Theorem.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
Complexity 26-1 Complexity Andrei Bulatov Interactive Proofs.
Complexity 18-1 Complexity Andrei Bulatov Probabilistic Algorithms.
CPSC 411, Fall 2008: Set 12 1 CPSC 411 Design and Analysis of Algorithms Set 12: Undecidability Prof. Jennifer Welch Fall 2008.
Complexity and Cryptography
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
Lecture 20: April 12 Introduction to Randomized Algorithms and the Probabilistic Method.
Of 30 September 22, 2010Semantic Berkeley 1 Semantic Goal-Oriented Communication Madhu Sudan Microsoft Research + MIT Joint with Oded Goldreich.
Efficient Semantic Communication via Compatible Beliefs Brendan Juba (MIT CSAIL & Harvard) with Madhu Sudan (MSR & MIT)
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.
Computability and Modeling Computation What are some really impressive things that computers can do? –Land the space shuttle (and other aircraft) from.
Limits of Local Algorithms in Random Graphs
Universal Semantic Communication Madhu Sudan MIT CSAIL Joint work with Brendan Juba (MIT).
Communication & Computing Madhu Sudan ( MSR New England ) Theories of.
Theory of Computing Lecture 15 MAS 714 Hartmut Klauck.
CS151 Complexity Theory Lecture 13 May 11, Outline proof systems interactive proofs and their power Arthur-Merlin games.
CSE 3813 Introduction to Formal Languages and Automata Chapter 14 An Introduction to Computational Complexity These class notes are based on material from.
2/2/2009Semantic Communication: MIT TOC Colloquium1 Semantic Goal-Oriented Communication Madhu Sudan Microsoft Research + MIT Joint with Oded Goldreich.
CSCI 3160 Design and Analysis of Algorithms Tutorial 10 Chengyu Lin.
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.
4/17/2008Semantic Communication1 Universal Semantic Communication Madhu Sudan MIT CSAIL Joint work with Brendan Juba (MIT CSAIL).
10/14/2008Semantic Communication1 Universal Semantic Communication Madhu Sudan MIT CSAIL Joint work with Brendan Juba (MIT CSAIL).
Universal Semantic Communication Madhu Sudan MIT CSAIL Joint work with Brendan Juba (MIT CSAIL).
Complexity 24-1 Complexity Andrei Bulatov Interactive Proofs.
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.
Modeling Arithmetic, Computation, and Languages Mathematical Structures for Computer Science Chapter 8 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesTuring.
Topic 36: Zero-Knowledge Proofs
Universal Semantic Communication
Francisco Antonio Doria
Probabilistic Algorithms
Introduction to Randomized Algorithms and the Probabilistic Method
On the Size of Pairing-based Non-interactive Arguments
Lecture 22 Complexity and Reductions
Universal Semantic Communication
Universal Semantic Communication
NP-Completeness Yin Tat Lee
Communication & Computation A need for a new unifying theory
CS 154, Lecture 6: Communication Complexity
Analysis and design of algorithm
CSCE 411 Design and Analysis of Algorithms
Uncertain Compression
Interactive Proofs Adapted from Oded Goldreich’s course lecture notes.
Chapter 11 Limitations of Algorithm Power
Universal Semantic Communication
Universal Semantic Communication
CSC 380: Design and Analysis of Algorithms
Interactive Proofs Adapted from Oded Goldreich’s course lecture notes.
Universal Semantic Communication
Communication Amid Uncertainty
Interactive Proofs Adapted from Oded Goldreich’s course lecture notes.
CS21 Decidability and Tractability
Interactive Proofs Adapted from Oded Goldreich’s course lecture notes.
Presentation transcript:

Universal Semantic Communication Madhu Sudan MIT CSAIL Joint work with Brendan Juba (MIT CSAIL). 3/23/2009 Semantic Communication

An fantasy setting (SETI) 010010101010001111001000 Alice No common language! Is meaningful communication possible? Bob What should Bob’s response be? If there are further messages, are they reacting to him? Is there an intelligent Alien (Alice) out there? 3/23/2009 Semantic Communication

Semantic Communication Pioneer’s face plate Why did they put this image? What would you put? What are the assumptions and implications? 3/23/2009 Semantic Communication

Motivation: Better Computing Networked computers use common languages: Interaction between computers (getting your computer onto internet). Interaction between pieces of software. Interaction between software, data and devices. Getting two computing environments to “talk” to each other is getting problematic: time consuming, unreliable, insecure. Can we communicate more like humans do? 3/23/2009 Semantic Communication

Classical Paradigm for interaction Designer Object 1 Object 2 3/23/2009 Semantic Communication

Semantic Communication New paradigm Designer Object 1 Object 2 Object 2 Object 2 3/23/2009 Semantic Communication

Semantic Communication Robust interfaces Want one interface for all “Object 2”s. Can such an interface exist? What properties should such an interface exhibit? Our thesis: Sufficient (for Object 1) to count on intelligence (of Object 2). But how to detect this intelligence?Puts us back in the “Alice and Bob” setting. 3/23/2009 Semantic Communication

Semantic Communication Goal of this talk Definitional issues and a definition: What is successful communication? What is intelligence? cooperation? Theorem: “If Alice and Bob are intelligent and cooperative, then communication is feasible” (in one setting) Proof ideas: Suggest: Protocols, Phenomena … Methods for proving/verifying intelligence 3/23/2009 Semantic Communication

What has this to do with computation? In general: Subtle issues related to “human” intelligence/interaction are within scope of computational complexity. E.g., Proofs? Easy vs. Hard? (Pseudo)Random? Secrecy? Knowledge? Trust? Privacy? This talk: What is “understanding”? 3/23/2009 Semantic Communication

A first attempt at a definition Alice and Bob are “universal computers” (aka programming languages) Have no idea what the other’s language is! Can they learn each other’s language? Good News: Language learning is finite. Can enumerate to find translator. Bad News: No third party to give finite string! Enumerate? Can’t tell right/wrong  3/23/2009 Semantic Communication

Semantic Communication Communication & Goals Indistinguishability of Right/Wrong: Consequence of “communication without goal”. Communication (with/without common language) ought to have a “Goal”. Before we ask how to improve communication, we should ask why we communicate? “Communication is not an end in itself, but a means to achieving a Goal” 3/23/2009 Semantic Communication

Part I: A Computational Goal 3/23/2009 Semantic Communication

Computational Goal for Bob Bob wants to solve hard computational problem: Decide membership in set S. Can Alice help him? What kind of sets S? E.g., S = {set of programs P that are not viruses}. S = {non-spam email} S = {winning configurations in Chess} S = {(A,B) | A has a factor less than B} 3/23/2009 Semantic Communication

Review of Complexity Classes P (BPP) – Solvable in (randomized) polynomial time (Bob can solve this without Alice’s help). NP – Problems where solutions can be verified in polynomial time (contains factoring). PSPACE – Problems solvable in polynomial space (quite infeasible for Bob to solve on his own). Computable – Problems solvable in finite time. (Includes all the above.) Uncomputable (Virus detection. Spam filtering.) Which problems can you solve with (alien) help? 3/23/2009 Semantic Communication

Semantic Communication Setup Which class of sets? Alice Bob x 2 S ? R Ã $ q 1 a 1 a k q f ( x ; R a 1 : k ) = ? H o p e f u l y x 2 S , ( ¢ ) = 1 3/23/2009 Semantic Communication

Contrast with Interactive Proofs Similarity: Interaction between Alice and Bob. Difference: In IP, Bob does not trust Alice. (In our case Bob does not understand Alice). Famed Theorem: IP = PSPACE [LFKN, Shamir]. Membership in PSPACE solvable S can be proved interactively to a probabilistic Bob. Needs a PSPACE-complete prover Alice. 3/23/2009 Semantic Communication

Intelligence & Cooperation? For Bob to have a non-trivial interaction, Alice must be: Intelligent: Capable of deciding if x in S. Cooperative: Must communicate this to Bob. Modelling Alice: Maps “(state of mind,external input)” to “(new state of mind, output)”. Formally: A l i c e s S - h p f u 9 r o b a t y m ( ) B . 8 n d ¾ , $ x w ® 2 3/23/2009 Semantic Communication

Successful universal communication Bob should be able to talk to any S-helpful Alice and decide S. Formally, P p t B i s S - u n v e r a l f o y x 2 ; 1 g ¤ ¡ A i s S - h e l p f u ) [ $ B ( x ] = 1 ® 2 w . A i s n o t S - h e l p f u ) N g ! Or should it be … A i s n o t S - h e l p f u ) [ $ B ( x ] = 1 m 2 . 3/23/2009 Semantic Communication

Semantic Communication Main Theorem - In English: If S is moderately stronger than what Bob can do on his own, then attempting to solve S leads to non-trivial (useful) conversation. If S too strong, then leads to ambiguity. Uses IP=PSPACE I f S i s P A C E - c o m p l e t ( a k h ) , n r x u v B b . G z y I f t h e r x i s a n S - u v l B o b P A C E . 3/23/2009 Semantic Communication

Few words about the proof Positive result: Enumeration + Interactive Proofs G u e s : I n t r p ; x 2 S ? Prover Alice Bob Interpreter P r o f w k s ) x 2 S ; D e n t G u g . A l i c - h p I ! 3/23/2009 Semantic Communication

Proof of Negative Result L not in PSPACE implies Bob makes mistakes. Suppose Alice answers every question so as to minimize the conversation length. (Reasonable effect of misunderstanding). Conversation comes to end quickly. Bob has to decide. Conversation + Decision simulatable in PSPACE (since Alice’s strategy can be computed in PSPACE). Bob must be wrong if L is not in PSPACE. Warning: Only leads to finitely many mistakes. 3/23/2009 Semantic Communication

Potential Criticisms of Main Theorem This is just rephrasing IP=PSPACE. No … the result proves “misunderstanding is equal to mistrust”. Was not a priori clear. Even this is true only in some contexts. 3/23/2009 Semantic Communication

Potential Criticisms of Main Theorem This is just rephrasing IP=PSPACE. Bob is too slow: Takes exponential time in length of Alice, even in his own description of her! A priori – not clear why he should have been able to decide right/wrong. Polynomial time learning not possible in our model of “helpful Alice”. Better definitions can be explored – future work. 3/23/2009 Semantic Communication

Potential Criticisms of Main Theorem This is just rephrasing IP=PSPACE. Bob is too slow: Takes exponential time in length of Alice, even in his own description of her! Alice has to be infinitely/PSPACE powerful … But not as powerful as that Anti-Virus Program! Wait for Part II 3/23/2009 Semantic Communication

Part II: Intellectual Curiosity 3/23/2009 Semantic Communication

Setting: Bob more powerful than Alice What should Bob’s Goal be? Can’t use Alice to solve problems that are hard for him. Can pose problems and see if she can solve them. E.g., Teacher-student interactions. But how does he verify “non-triviality”? What is “non-trivial”? Must distinguish … Bob Interpreter Alice Scene 2 Scene 1 3/23/2009 Semantic Communication

Setting: Bob more powerful than Alice Concretely: Bob capable of TIME(n10). Alice capable of TIME(n3) or nothing. Can Bob distinguish the two settings? Answer: Yes, if Translate(Alice,Bob) computable in TIME(n2). Bob poses TIME(n3) time problems to Alice and enumerates all TIME(n2) interpreters. Moral: Language (translation) should be simpler than problems being discussed. 3/23/2009 Semantic Communication

Part III: Concluding thoughts 3/23/2009 Semantic Communication

Goals of Communication Largely unexplored (at least explicitly) Main categories Remote Control: Laptop wants to print on printer! Buy something on Amazon Intellectual Curiosity: Learning/Teaching Searching for alien intelligence Coming to this talk May involve common environment/context. 3/23/2009 Semantic Communication

Role of common language? If common language is not needed (as we claim), then why do intelligent beings like it? Our belief: To gain efficiency. Reduce # bits of communication # rounds of communication Topic for further study: What efficiency measure does language optimize? Is this difference asymptotically significant? 3/23/2009 Semantic Communication

Semantic Communication Further work Exponential time learning (enumerating Interpreters) What is a reasonable restriction on languages? What is the role of language in communication? What are other goals of communication? What is intelligence? Paper (Part I) available from ECCC 3/23/2009 Semantic Communication

Semantic Communication Thank You! 3/23/2009 Semantic Communication