Gillat Kol (IAS) joint work with Anat Ganor (Weizmann) Ran Raz (Weizmann + IAS) Exponential Separation of Information and Communication.

Slides:



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

DCSP-7: Information Jianfeng Feng Department of Computer Science Warwick Univ., UK
Of 23 09/24/2013HLF: Reliable Meaningful Communication1 Reliable Meaningful Communication Madhu Sudan Microsoft, Cambridge, USA.
Parallel Repetition of Two Prover Games Ran Raz Weizmann Institute and IAS.
Of 13 10/08/2013MSRNE 5 th Anniversary: Communication Amid Uncertainty1 Communication Amid Uncertainty Madhu Sudan Microsoft Research.
Entropy and Information Theory
How to Delegate Computations: The Power of No-Signaling Proofs Ran Raz (Weizmann Institute & IAS) Joint work with: Yael Tauman Kalai Ron Rothblum.
Gillat Kol (IAS) joint work with Ran Raz (Weizmann + IAS) Interactive Channel Capacity.
Negotiating a stable distribution of the payoff among agents may prove challenging. The issue of coalition formation has been investigated extensively,
Rational Oblivious Transfer KARTIK NAYAK, XIONG FAN.
Gillat Kol joint work with Ran Raz Competing Provers Protocols for Circuit Evaluation.
Universal Communication Brendan Juba (MIT) With: Madhu Sudan (MIT)
1 Information complexity and exact communication bounds April 26, 2013 Mark Braverman Princeton University Based on joint work with Ankit Garg, Denis Pankratov,
How to Delegate Computations: The Power of No-Signaling Proofs Ron Rothblum Weizmann Institute Joint work with Yael Kalai and Ran Raz.
Chapter 6 Information Theory
Poorvi Vora/CTO/IPG/HP 01/03 1 The channel coding theorem and the security of binary randomization Poorvi Vora Hewlett-Packard Co.
On the tightness of Buhrman- Cleve-Wigderson simulation Shengyu Zhang The Chinese University of Hong Kong On the relation between decision tree complexity.
Ref. Cryptography: theory and practice Douglas R. Stinson
Avraham Ben-Aroya (Tel Aviv University) Oded Regev (Tel Aviv University) Ronald de Wolf (CWI, Amsterdam) A Hypercontractive Inequality for Matrix-Valued.
On Gallager’s problem: New Bounds for Noisy Communication. Navin Goyal & Mike Saks Joint work with Guy Kindler Microsoft Research.
Quantum Algorithms I Andrew Chi-Chih Yao Tsinghua University & Chinese U. of Hong Kong.
A Graph-based Framework for Transmission of Correlated Sources over Multiuser Channels Suhan Choi May 2006.
Erasing correlations, destroying entanglement and other new challenges for quantum information theory Aram Harrow, Bristol Peter Shor, MIT quant-ph/
Shengyu Zhang The Chinese University of Hong Kong.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 13 June 22, 2005
Noise, Information Theory, and Entropy
Bioinformatics lectures at Rice University Lecture 4: Shannon entropy and mutual information.
Noise, Information Theory, and Entropy
Basic Concepts in Information Theory
2. Mathematical Foundations
EEET 5101 Information Theory Chapter 1
Great Theoretical Ideas in Computer Science.
1 Information and interactive computation January 16, 2012 Mark Braverman Computer Science, Princeton University.
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
Communication Complexity Rahul Jain Centre for Quantum Technologies and Department of Computer Science National University of Singapore. TexPoint fonts.
Rei Safavi-Naini University of Calgary Joint work with: Hadi Ahmadi iCORE Information Security.
Information Theory for Data Streams David P. Woodruff IBM Almaden.
On the Communication Complexity of SFE with Long Output Daniel Wichs (Northeastern) joint work with Pavel Hubáček.
One-way multi-party communication lower bound for pointer jumping with applications Emanuele Viola & Avi Wigderson Columbia University IAS work done while.
A limit on nonlocality in any world in which communication complexity is not trivial IFT6195 Alain Tapp.
1 Information Theory Nathanael Paul Oct. 09, 2002.
Introduction to Quantum Key Distribution
CRYPTOGRAPHY & NETWORK SECURITY Introduction and Basic Concepts Eng. Wafaa Kanakri Computer Engineering Umm Al-Qura University.
Quantum Cryptography Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”
The Classically Enhanced Father Protocol
Interactive Channel Capacity Ran Raz Weizmann Institute Joint work with Gillat Kol Technion.
Information Complexity: an Overview Rotem Oshman, Princeton CCI Based on work by Braverman, Barak, Chen, Rao, and others Charles River Science of Information.
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.
Umans Complexity Theory Lectures Lecture 7b: Randomization in Communication Complexity.
Massive Data Sets and Information Theory Ziv Bar-Yossef Department of Electrical Engineering Technion.
1 Lecture 7 System Models Attributes of a man-made system. Concerns in the design of a distributed system Communication channels Entropy and mutual information.
Interactive Channel Capacity. [Shannon 48]: A Mathematical Theory of Communication An exact formula for the channel capacity of any noisy channel.
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.
Quantum Cryptography Antonio Acín
Ankit Garg Princeton Univ. Joint work with Mark Braverman Young Kun Ko Princeton Univ. Princeton Univ. Jieming Mao Dave Touchette Princeton Univ. Univ.
When Can Limited Randomness Be Used in Repeated Games? Moni Naor Weizmann Institute of Science Joint work with Pavel Hubáček and Jon Ullman Columbia University.
Imperfectly Shared Randomness
Information Complexity Lower Bounds
Introduction to Information theory
Unbounded-Error Classical and Quantum Communication Complexity
Communication Amid Uncertainty
Bits and Bobs: The Quantum Theory of Information
CS 154, Lecture 6: Communication Complexity
Communication Amid Uncertainty
Quantum Information Theory Introduction
How to Delegate Computations: The Power of No-Signaling Proofs
Imperfectly Shared Randomness
Non-Malleable Extractors
Communication Amid Uncertainty
Presentation transcript:

Gillat Kol (IAS) joint work with Anat Ganor (Weizmann) Ran Raz (Weizmann + IAS) Exponential Separation of Information and Communication

Information theory was developed by Claude Shannon to study one-way data transmission “A mathematical theory of communication” 1948 It had a profound impact on many fields of science. Specifically, it is an incredibly useful tool in TCS Recently, computational aspects of information theory are studied as a goal in its own right Information Theory

Interactive protocols performing a computation are central in TCS ( interactive proofs, communication complexity, cryptography, distributed computing, …) Interactive information theory extends classical information theory to the interactive setting, where information flows in several directions Interactive coding (cf. noisy coding) Interactive compression (cf. data compression) … Interactive Information Theory this talk

Data Compression Entropy function “unpredictability”

Data Compression Theorem [S‘48,H‘52]: Any message can be compressed to its “information content” Interactive Compression Problem [BBCR‘09]: Assume Alice and Bob engage in an interactive communication protocol (i.e., conversation). Can the protocol’s transcript be compressed to its “information content”?

Communication Complexity [Yao‘79] adaptive! Protocol:

Distributional CC

Information Cost The amount of information players learn about each other’s input from the interaction mutual information

Information Cost The amount of information players learn about each other’s input from the interaction

Amount of information revealed Number of bits exchanged

Why is the Interactive Case More Challenging?

Tight!

Direct Sum [80’s] Corollary of Our Result: Strong Direct Sum doesn’t hold!

Underlying Tree multilayer c

Underlying Tree multilayer c

Typical Vertices

multilayer i Typical Vertices typical leaves ≥ 80% correct children typical vertices

multilayer i typical leaves

multilayer i

noisy multilayer i

noisy multilayer i typical leaves

Bursting Noise Game noisy multilayer i typical leaves

noisy multilayer i typical leaves

The Protocol (-bug fix) typical leaves noisy multilayer i 90%10%

Why 90% and not 100%?? typical leaves noisy multilayer i

typical leaves noisy multilayer i

Thank You!