We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byClinton Moist
Modified over 2 years ago
Lower Bounds for Testing Properties of Functions on Hypergrids Grigory Yaroslavtsev http://grigory.us Joint with: Eric Blais (MIT) Sofya Raskhodnikova (PSU)
Property Testing [Goldreich, Goldwasser, Ron, Rubinfeld, Sudan] No YES Randomized algorithm YES No Property tester Don’t care
Ultra-fast Approximate Decision Making
Property Testing [Goldreich, Goldwasser, Ron, Rubinfeld, Sudan]
Communication Complexity [Yao’79] Shared randomness …
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] (Almost) all: Boolean functions over Boolean hypercube
Property Testing and Communication Complexity Grigory Yaroslavtsev
Grigory Yaroslavtsev Joint work with Piotr Berman and Sofya Raskhodnikova.
Learning and Fourier Analysis Grigory Yaroslavtsev CIS 625: Computational Learning Theory.
Fast Fourier Sparsity Testing over the Boolean Hypercube Grigory Yaroslavtsev Joint with Andrew Arnold (Waterloo), Arturs Backurs (MIT),
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.
Hardness of testing 3- colorability in bounded degree graphs Andrej Bogdanov Kenji Obata Luca Trevisan.
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.
Steiner Transitive-Closure Spanners of Low-Dimensional Posets Grigory Yaroslavtsev Pennsylvania State University + AT&T Labs – Research (intern) Joint.
On Testing Computability by small Width OBDDs Oded Goldreich Weizmann Institute of Science.
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.
Extremal properties of polynomial threshold functions Ryan O’Donnell (MIT / IAS) Rocco Servedio (Columbia)
Testing Collections of Properties Reut Levi Dana Ron Ronitt Rubinfeld ICS 2011.
Testing the Diameter of Graphs Michal Parnas Dana Ron.
Property Testing of Data Dimensionality Robert Krauthgamer ICSI and UC Berkeley Joint work with Ori Sasson (Hebrew U.)
Learning and Testing Junta Distributions Maryam Aliakbarpour (MIT) Joint work with: Eric Blais (U Waterloo) and Ronitt Rubinfeld (MIT and TAU) 1.
Learning and Testing Submodular Functions Grigory Yaroslavtsev Columbia University October 26, 2012 With Sofya Raskhodnikova (SODA’13) + Work in progress.
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.
狄彥吾 (Yen-Wu Ti) 華夏技術學院資訊工程系 Property Testing on Combinatorial Objects.
Michael Bender - SUNY Stony Brook Dana Ron - Tel Aviv University Testing Acyclicity of Directed Graphs in Sublinear Time.
Improved Approximation for the Directed Spanner Problem Grigory Yaroslavtsev Penn State + AT&T Labs - Research (intern) Joint work with Berman (PSU), Bhattacharyya.
Approximation for Directed Spanner Grigory Yaroslavtsev Penn State + AT&T Labs (intern) Based on a paper at ICALP’11, joint with Berman (PSU), Bhattacharyya.
Learning and Testing Submodular Functions Grigory Yaroslavtsev Slides at
1 Transitive-Closure Spanners Sofya Raskhodnikova Penn State University Joint work with Arnab Bhattacharyya MIT Elena Grigorescu MIT Kyomin Jung MIT David.
How to Solve Longstanding Open Problems In Quantum Computing Using Only Fourier Analysis Scott Aaronson (MIT) For those who hate quantum: The open problems.
Putting a Junta to the Test Joint work with Eldar Fischer, Dana Ron, Shmuel Safra, and Alex Samorodnitsky Guy Kindler.
Learning Juntas Elchanan Mossel UC Berkeley Ryan O’Donnell MIT Rocco Servedio Harvard.
1 Markov Decision Processes: Approximate Equivalence Michel de Rougemont Université Paris II & LRI
1 On approximating the number of relevant variables in a function Dana Ron & Gilad Tsur Tel-Aviv University.
Testing Metric Properties Michal Parnas and Dana Ron.
Complexity and Efficient Algorithms Group / Department of Computer Science Testing the Cluster Structure of Graphs Christian Sohler joint work with Artur.
Christian Sohler 1 University of Dortmund Testing Expansion in Bounded Degree Graphs Christian Sohler University of Dortmund (joint work with Artur Czumaj,
Dana Moshkovitz MIT Joint work with Subhash Khot, NYU 1.
Approximating the MST Weight in Sublinear Time Bernard Chazelle (Princeton) Ronitt Rubinfeld (NEC) Luca Trevisan (U.C. Berkeley)
Learning, testing, and approximating halfspaces Rocco Servedio Columbia University DIMACS-RUTCOR Jan 2009.
Property testing of Tree Regular Languages Frédéric Magniez, LRI, CNRS Michel de Rougemont, LRI, University Paris II.
1 Algorithmic Aspects in Property Testing of Dense Graphs Oded Goldreich – Weizmann Institute Dana Ron - Tel-Aviv University.
Chris Beck, Russell Impagliazzo, Shachar Lovett. History of Sampling Problems Earliest uses of randomness in algorithms were for sampling, not decision.
Deterministic vs. Non-Deterministic Graph Property Testing Asaf Shapira Tel-Aviv University Joint work with Lior Gishboliner.
Some Techniques in Property Testing Dana Ron Tel Aviv University.
Christian Sohler | Every Property of Hyperfinite Graphs is Testable Ilan Newman and Christian Sohler.
Testing of Clustering Noga Alon, Seannie Dar Michal Parnas, Dana Ron.
Private Analysis of Graph Structure With Vishesh Karwa, Sofya Raskhodnikova and Adam Smith Pennsylvania State University Grigory Yaroslavtsev
New Algorithms and Lower Bounds for Monotonicity Testing of Boolean Functions Rocco Servedio Joint work with Xi Chen and Li-Yang Tan Columbia University.
On the Fourier Tails of Bounded Functions over the Discrete Cube Irit Dinur, Ehud Friedgut, and Ryan O’Donnell Joint work with Guy Kindler Microsoft Research.
1 On the Benefits of Adaptivity in Property Testing of Dense Graphs Joint works with Mira Gonen and Oded Goldreich Dana Ron Tel-Aviv University.
Finding Cycles and Trees in Sublinear Time Oded Goldreich Weizmann Institute of Science Joint work with Artur Czumaj, Dana Ron, C. Seshadhri, Asaf Shapira,
Distributional Property Estimation Past, Present, and Future Gregory Valiant (Joint work w. Paul Valiant)
© 2017 SlidePlayer.com Inc. All rights reserved.