Property Testing and Communication Complexity Grigory Yaroslavtsev

Slides:



Advertisements
Similar presentations
1 Property testing and learning on strings and trees Michel de Rougemont University Paris II & LRI Joint work with E. Fischer, Technion, F. Magniez, LRI.
Advertisements

Hardness of testing 3- colorability in bounded degree graphs Andrej Bogdanov Kenji Obata Luca Trevisan.
Finding Cycles and Trees in Sublinear Time Oded Goldreich Weizmann Institute of Science Joint work with Artur Czumaj, Dana Ron, C. Seshadhri, Asaf Shapira,
On the degree of symmetric functions on the Boolean cube Joint work with Amir Shpilka.
1 Transitive-Closure Spanners Sofya Raskhodnikova Penn State University Joint work with Arnab Bhattacharyya MIT Elena Grigorescu MIT Kyomin Jung MIT David.
Improved Approximation for the Directed Spanner Problem Grigory Yaroslavtsev Penn State + AT&T Labs - Research (intern) Joint work with Berman (PSU), Bhattacharyya.
LEARNIN HE UNIFORM UNDER DISTRIBUTION – Toward DNF – Ryan ODonnell Microsoft Research January, 2006.
Property Testing of Data Dimensionality Robert Krauthgamer ICSI and UC Berkeley Joint work with Ori Sasson (Hebrew U.)
Learning and Testing Submodular Functions Grigory Yaroslavtsev Columbia University October 26, 2012 With Sofya Raskhodnikova (SODA’13) + Work in progress.
Expressions and Equations
Lower Bounds for Testing Properties of Functions on Hypergrids Grigory Yaroslavtsev Joint with: Eric Blais (MIT) Sofya Raskhodnikova.
Grigory Yaroslavtsev Joint work with Piotr Berman and Sofya Raskhodnikova.
Big Data Reading Group Grigory Yaroslavtsev 361 Levine
Of 22 August 29-30, 2011 Rabin ’80: APT 1 Invariance in Property Testing Madhu Sudan Microsoft Research TexPoint fonts used in EMF. Read the TexPoint manual.
Deterministic vs. Non-Deterministic Graph Property Testing Asaf Shapira Tel-Aviv University Joint work with Lior Gishboliner.
Property testing of Tree Regular Languages Frédéric Magniez, LRI, CNRS Michel de Rougemont, LRI, University Paris II.
Extremal properties of polynomial threshold functions Ryan O’Donnell (MIT / IAS) Rocco Servedio (Columbia)
Something for almost nothing: Advances in sublinear time algorithms Ronitt Rubinfeld MIT and Tel Aviv U.
Learning Juntas Elchanan Mossel UC Berkeley Ryan O’Donnell MIT Rocco Servedio Harvard.
Steiner Transitive-Closure Spanners of Low-Dimensional Posets Grigory Yaroslavtsev Pennsylvania State University + AT&T Labs – Research (intern) Joint.
1 Markov Decision Processes: Approximate Equivalence Michel de Rougemont Université Paris II & LRI
Christian Sohler | Every Property of Hyperfinite Graphs is Testable Ilan Newman and Christian Sohler.
Chris Beck, Russell Impagliazzo, Shachar Lovett. History of Sampling Problems Earliest uses of randomness in algorithms were for sampling, not decision.
New Algorithms and Lower Bounds for Monotonicity Testing of Boolean Functions Rocco Servedio Joint work with Xi Chen and Li-Yang Tan Columbia University.
Learning and Fourier Analysis Grigory Yaroslavtsev CIS 625: Computational Learning Theory.
Learning and Testing Submodular Functions Grigory Yaroslavtsev Slides at
Learning, testing, and approximating halfspaces Rocco Servedio Columbia University DIMACS-RUTCOR Jan 2009.
Testing the Diameter of Graphs Michal Parnas Dana Ron.
On Approximating the Average Distance Between Points Kfir Barhum, Oded Goldreich and Adi Shraibman Weizmann Institute of Science.
Putting a Junta to the Test Joint work with Eldar Fischer, Dana Ron, Shmuel Safra, and Alex Samorodnitsky Guy Kindler.
Some Techniques in Property Testing Dana Ron Tel Aviv University.
Michael Bender - SUNY Stony Brook Dana Ron - Tel Aviv University Testing Acyclicity of Directed Graphs in Sublinear Time.
Testing Metric Properties Michal Parnas and Dana Ron.
1 On approximating the number of relevant variables in a function Dana Ron & Gilad Tsur Tel-Aviv University.
On Testing Convexity and Submodularity Michal Parnas Dana Ron Ronitt Rubinfeld.
1 Algorithmic Aspects in Property Testing of Dense Graphs Oded Goldreich – Weizmann Institute Dana Ron - Tel-Aviv University.
Christian Sohler 1 University of Dortmund Testing Expansion in Bounded Degree Graphs Christian Sohler University of Dortmund (joint work with Artur Czumaj,
On Testing Computability by small Width OBDDs Oded Goldreich Weizmann Institute of Science.
Beyond Set Disjointness: The Communication Complexity of Finding the Intersection Grigory Yaroslavtsev Joint with Brody, Chakrabarti,
Some 3CNF Properties are Hard to Test Eli Ben-Sasson Harvard & MIT Prahladh Harsha MIT Sofya Raskhodnikova MIT.
ADVANCED COMPUTATIONAL MODELS AND ALGORITHMS Instructor: Dr. Gautam Das Lecture 23 April 30, 2009 Class notes by Prashanth Kurabalana hundi Hombe gowda[ ]
Approximating the MST Weight in Sublinear Time Bernard Chazelle (Princeton) Ronitt Rubinfeld (NEC) Luca Trevisan (U.C. Berkeley)
A Property Testing Double-Feature of Short Talks Oded Goldreich Weizmann Institute of Science Talk at Technion, June 2013.
Testing Collections of Properties Reut Levi Dana Ron Ronitt Rubinfeld ICS 2011.
Transitive-Closure Spanner of Directed Graphs Kyomin Jung KAIST 2009 Combinatorics Workshop Joint work with Arnab Bhattacharyya MIT Elena Grigorescu MIT.
1 Sublinear Algorithms Lecture 1 Sofya Raskhodnikova Penn State University TexPoint fonts used in EMF. Read the TexPoint manual before you delete this.
Information Complexity: an Overview Rotem Oshman, Princeton CCI Based on work by Braverman, Barak, Chen, Rao, and others Charles River Science of Information.
Fast Fourier Sparsity Testing over the Boolean Hypercube Grigory Yaroslavtsev Joint with Andrew Arnold (Waterloo), Arturs Backurs (MIT),
Massive Data Sets and Information Theory Ziv Bar-Yossef Department of Electrical Engineering Technion.
Sorting 1. Insertion Sort
狄彥吾 (Yen-Wu Ti) 華夏技術學院資訊工程系 Property Testing on Combinatorial Objects.
Complexity and Efficient Algorithms Group / Department of Computer Science Testing the Cluster Structure of Graphs Christian Sohler joint work with Artur.
ECE 3323 Principles of Communication Systems Section 3.2 Fourier Transform Properties 1.
Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching Marco Molinaro David Woodruff Grigory Yaroslavtsev Georgia Tech.
Learning and Testing Junta Distributions Maryam Aliakbarpour (MIT) Joint work with: Eric Blais (U Waterloo) and Ronitt Rubinfeld (MIT and TAU) 1.
On Sample Based Testers
Dana Ron Tel Aviv University
Approximating the MST Weight in Sublinear Time
Circuit Lower Bounds A combinatorial approach to P vs NP
On Approximating the Number of Relevant Variables in a Function
Warren Center for Network and Data Sciences
CIS 700: “algorithms for Big Data”
Algebraic Property Testing
Learning, testing, and approximating halfspaces
Formal Methods in software development
The Subgraph Testing Model
Boolean Algebra for CAD Applications
Algorithms Lecture #15 Dr.Sohail Aslam.
Sublinear Algorihms for Big Data
Real-Time Systems, COSC , Lecture 18
Presentation transcript:

Property Testing and Communication Complexity Grigory Yaroslavtsev

Property Testing [Goldreich, Goldwasser, Ron, Rubinfeld, Sudan] No YES Randomized algorithm YES No Property tester Don’t care

Property Testing [Goldreich, Goldwasser, Ron, Rubinfeld, Sudan]

Communication Complexity [Yao’79] Shared randomness …

{

Communication Direct Sums

Specialized Communication Direct Sums

Direct Sums in Property Testing [Woodruff, Y.]

Property Testing Direct Sums [Goldreich’13]

[Goldreich ‘13]

Reduction from Simultaneous Communication [Woodruff]

Property testing lower bounds via CC Monotonicity, Juntas, Low Fourier degree, Small Decision Trees [Blais, Brody, Matulef’11] Small-width OBDD properties [Brody, Matulef, Wu’11] Lipschitz property [Jha, Raskhodnikova’11] Codes [Goldreich’13, Gur, Rothblum’13] Number of relevant variables [Ron, Tsur’13] All functions are over Boolean hypercube

Thank you!