Learning and Testing Junta Distributions Maryam Aliakbarpour (MIT) Joint work with: Eric Blais (U Waterloo) and Ronitt Rubinfeld (MIT and TAU) 1.

Slides:



Advertisements
Similar presentations
The Polynomial Method In Quantum and Classical Computing Scott Aaronson (MIT) OPEN PROBLEM.
Advertisements

Property Testing and Communication Complexity Grigory Yaroslavtsev
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.
Mechanism Design, Machine Learning, and Pricing Problems Maria-Florina Balcan.
Learning Juntas Elchanan Mossel UC Berkeley Ryan O’Donnell MIT Rocco Servedio Harvard.
1 Distribution-free testing algorithms for monomials with a sublinear number of queries Elya Dolev & Dana Ron Tel-Aviv University.
Distribution-free testing algorithms for monomials with a sublinear number of queries Elya Dolev & Dana Ron Tel-Aviv University.
Learning and Fourier Analysis Grigory Yaroslavtsev CIS 625: Computational Learning Theory.
A Study on Feature Selection for Toxicity Prediction*
Putting a Junta to the Test Joint work with Eldar Fischer, Dana Ron, Shmuel Safra, and Alex Samorodnitsky Guy Kindler.
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.
CSCI 3 Introduction to Computer Science. CSCI 3 Course Description: –An overview of the fundamentals of computer science. Topics covered include number.
Exact Learning of Boolean Functions with Queries Lisa Hellerstein Polytechnic University Brooklyn, NY AMS Short Course on Statistical Learning Theory,
Michael Bender - SUNY Stony Brook Dana Ron - Tel Aviv University Testing Acyclicity of Directed Graphs in Sublinear Time.
Vapnik-Chervonenkis Dimension Definition and Lower bound Adapted from Yishai Mansour.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Continuous random variables Uniform and Normal distribution (Sec. 3.1, )
Dasgupta, Kalai & Monteleoni COLT 2005 Analysis of perceptron-based active learning Sanjoy Dasgupta, UCSD Adam Tauman Kalai, TTI-Chicago Claire Monteleoni,
Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.
Correlation Immune Functions and Learning Lisa Hellerstein Polytechnic Institute of NYU Brooklyn, NY Includes joint work with Bernard Rosell (AT&T), Eric.
Introduction to Boosting Aristotelis Tsirigos SCLT seminar - NYU Computer Science.
Christian Sohler 1 University of Dortmund Testing Expansion in Bounded Degree Graphs Christian Sohler University of Dortmund (joint work with Artur Czumaj,
1 On The Learning Power of Evolution Vitaly Feldman.
Lecture 6: Causal Discovery Isabelle Guyon
Learning and testing k-modal distributions Rocco A. Servedio Columbia University Joint work (in progress) with Ilias Diakonikolas UC Berkeley Costis Daskalakis.
Chapter 5. Operations on Multiple R. V.'s 1 Chapter 5. Operations on Multiple Random Variables 0. Introduction 1. Expected Value of a Function of Random.
Maria-Florina Balcan A Theoretical Model for Learning from Labeled and Unlabeled Data Maria-Florina Balcan & Avrim Blum Carnegie Mellon University, Computer.
Dana Moshkovitz, MIT Joint work with Subhash Khot, NYU.
Kansas State University Department of Computing and Information Sciences CIS 830: Advanced Topics in Artificial Intelligence Monday, April 3, 2000 DingBing.
Institute for Applied Information Processing and Communications 1 Karin Greimel Semmering, Open Implication.
Correlated Topic Models By Blei and Lafferty (NIPS 2005) Presented by Chunping Wang ECE, Duke University August 4 th, 2006.
Approximation Algorithms Pages ADVANCED TOPICS IN COMPLEXITY THEORY.
Testing Collections of Properties Reut Levi Dana Ron Ronitt Rubinfeld ICS 2011.
ECE 8443 – Pattern Recognition Objectives: Error Bounds Complexity Theory PAC Learning PAC Bound Margin Classifiers Resources: D.M.: Simplified PAC-Bayes.
Distributed Computing 3. Leader Election – lower bound for ring networks Shmuel Zaks ©
1 Effective Feature Selection Framework for Cluster Analysis of Microarray Data Gouchol Pok Computer Science Dept. Yanbian University China Keun Ho Ryu.
1 Chapter 6. Classification and Prediction Overview Classification algorithms and methods Decision tree induction Bayesian classification Lazy learning.
Lecture 5: Causality and Feature Selection Isabelle Guyon
Copyright © 2013 Pearson Education. All rights reserved. Chapter 1 Introduction to Statistics and Probability.
Finding Correlations in Subquadratic Time Gregory Valiant.
Massive Data Sets and Information Theory Ziv Bar-Yossef Department of Electrical Engineering Technion.
Feature Selection and Weighting using Genetic Algorithm for Off-line Character Recognition Systems Faten Hussein Presented by The University of British.
Distribution Specific Learnability – an Open Problem in Statistical Learning Theory M. Hassan Zokaei-Ashtiani December 2013.
Complexity and Efficient Algorithms Group / Department of Computer Science Testing the Cluster Structure of Graphs Christian Sohler joint work with Artur.
Feature Selction for SVMs J. Weston et al., NIPS 2000 오장민 (2000/01/04) Second reference : Mark A. Holl, Correlation-based Feature Selection for Machine.
Learnability of DNF with Representation-Specific Queries Liu Yang Joint work with Avrim Blum & Jaime Carbonell Carnegie Mellon University 1© Liu Yang 2012.
Separations inQuery Complexity Pointer Functions Basedon Andris Ambainis University of Latvia Joint work with: Kaspars Balodis, Aleksandrs Belovs Troy.
Complexity ©D.Moshkovitz 1 Our First NP-Complete Problem The Cook-Levin theorem A B C.
Complexity and Efficient Algorithms Group / Department of Computer Science Testing the Cluster Structure of Graphs Christian Sohler joint work with Artur.
CS623: Introduction to Computing with Neural Nets (lecture-18) Pushpak Bhattacharyya Computer Science and Engineering Department IIT Bombay.
Latent variable discovery in classification models
Property Testing (a.k.a. Sublinear Algorithms )
Dana Ron Tel Aviv University
By Eliezer Yucht Prepared under the supervision of Prof. Dana Ron
Presented by Jingting Zeng 11/26/2007
Statistical Cost Sharing: Learning Fair Cost Allocations from Samples
Vitaly Feldman and Jan Vondrâk IBM Research - Almaden
On Approximating the Number of Relevant Variables in a Function
2018/9/16 Distributed Source Coding Using Syndromes (DISCUS): Design and Construction S.Sandeep Pradhan, Kannan Ramchandran IEEE Transactions on Information.
A Consensus-Based Clustering Method
Implications of the ETH
Lecture 3: Causality and Feature Selection
Warren Center for Network and Data Sciences
CIS 700: “algorithms for Big Data”
Mechanism Design via Machine Learning
Gautam Kamath Simons Institute  University of Waterloo
“Hard” Optimization Problems
Correlation Immune Functions and Learning
including joint work with:
Research Paper Overview.
Presentation transcript:

Learning and Testing Junta Distributions Maryam Aliakbarpour (MIT) Joint work with: Eric Blais (U Waterloo) and Ronitt Rubinfeld (MIT and TAU) 1

The Problem 2

Relevant features in distributions Smokes Does not regularly exercise Gender: male Correlates with heart attack Irrelevant to heart attack Binary features list: distributed the same Distribution over heart attack patients. Junta coordinates 3

Non-smoker smoker Relevant features in distributions Heart attack correlates Irrelevant to heart attack ExercisesDoes not exercise 4 Assumption: Irrelevant features are uniformly distributed.

Problem Definition 5

Relevant features in distributions Heart attack correlates Irrelevant to heart attack and uniformly distributed. is there a small such set? Which set is it? Testing problem Learning problem 6

Lots of related work Feature selection: Guyon-Elissee ff ’03, Liu-Motoda’12, and Chandrashekar-Sahin’14. Junta functions: A. Blum’94 and A. Blum-Langley’97, …., Blais’09, G. Valiant’12 Property testing of distribution: GR00, BFR+00, BFF+01, Bat01, BDKR02, BKR04, Val08, Pan08, Val11, DDS+13, ADJ+11, LRR11, ILR12, CDVV14, VV14, DKN15b, DKN15a, ADK15, and CDGR16 Testing properties of collection of distributions: Levi-Ron- Rubinfeld’13, and Diakonikolas-Kane’16 7

Learning Algorithm 8

PAC learning 9

Our results on Learning 10 Sample complexityRunning time Lower boundUpper bound Running time Cover method Our work

Our results on Learning 11 Sample complexityRunning time Lower boundUpper bound Running time Cover method Our work

12 Theorem

Overview of the Fourier analysis on Boolean cube 13 We can estimate!

Lemma 1 14 Corollary :

15 Lemma 2

Learning Algorithm 16

Testing Algorithm 17

What does it mean to test? accept reject 18

Our results on Testing 19 Sample ComplexityTime complexity Lower boundUpper bound Our work

Our results on Testing 20 Sample ComplexityTime complexity Lower boundUpper bound

Reduction 21

Testing Algorithm 22

Conclusion Summary: Introduced junta distributions How to learn junta distributions How to test junta distributions Future directions Tighter results Removing uniformity assumption 23

Reference Isabelle Guyon and Andr´e Elissee ff. An introduction to variable and feature selection. Journal of Machine Learning Research, 3:1157–1182, Huan Liu and Hiroshi Motoda. Feature selection for knowledge discovery and data mining, volume 454. Springer Science & Business Media, Girish Chandrashekar and Ferat Sahin. A survey on feature selection methods. Computers & Electrical Engineering, 40(1):16 – 28, Avrim Blum. Relevant examples and relevant features: Thoughts from computational learning theory. In AAAI Fall Symposium on ‘Relevance’, volume 5, Avrim Blum and Pat Langley. Selection of relevant features and examples in machine learning. Artificial Intelligence, 97(1-2):245–271, December Reut Levi, Dana Ron, and Ronitt Rubinfeld. Testing properties of collections of distributions. Theory of Computing, 9(8):295–347, Ilias Diakonikolas and Daniel M. Kane. A new approach for testing properties of discrete distributions. CoRR, abs/ , URL 24

Reference Gregory Valiant. Finding correlations in subquadratic time, with applications to learning parities and juntas. FOCS, pages 11–20, Blais, E.: Testing juntas nearly optimally. In: Proc. 41st Symposium on Theory of Computing, pp. 151–158 (2009) 25