We consider the problem of testing whether an unknown n-variable Boolean function is a k-junta in the distribution-free property testing model, where the distance between functions is measured with respect to an arbitrary and unknown probability distribution over {0,1}^n. Chen, Liu, Servedio, Sheng and Xie [Zhengyang Liu et al., 2018] showed that the distribution-free k-junta testing can be performed, with one-sided error, by an adaptive algorithm that makes O~(k^2)/epsilon queries. In this paper, we give a simple two-sided error adaptive algorithm that makes O~(k/epsilon) queries
We consider a fundamental problem in computational learning theory: learning in the presence of irr...
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called dis...
We present an adaptive tester for the unateness property of Boolean functions. Given a function f:{0...
We present an adaptive algorithm with one-sided error for the problem of junta testing for Boolean f...
We give a new lower bound on the query complexity of any non-adaptive algorithm for testing whether ...
We prove that any non-adaptive algorithm that tests whether an unknown Boolean function f is a k-jun...
AbstractWe show that a boolean valued function over n variables, where each variable ranges in an ar...
Abstract. We consider the problem of testing functions for the property of being a k-junta (i.e., of...
The field of property testing has been studied for decades, and Boolean functions are among the most...
We introduce a new model for testing graph properties which we call the rejection sampling model. We...
We give the first super-polynomial (in fact, mildly exponential) lower bounds for tolerant testing (...
A Boolean function f:{0,1}^n->{0,1} is called a dictator if it depends on exactly one variable i.e f...
We study the problem of testing whether a function f:?? ? ? is linear (i.e., both additive and homog...
Over the past few decades property testing has became an active field of study in theoretical comput...
We study the problem of learning k-juntas given access to examples drawn from a number of different ...
We consider a fundamental problem in computational learning theory: learning in the presence of irr...
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called dis...
We present an adaptive tester for the unateness property of Boolean functions. Given a function f:{0...
We present an adaptive algorithm with one-sided error for the problem of junta testing for Boolean f...
We give a new lower bound on the query complexity of any non-adaptive algorithm for testing whether ...
We prove that any non-adaptive algorithm that tests whether an unknown Boolean function f is a k-jun...
AbstractWe show that a boolean valued function over n variables, where each variable ranges in an ar...
Abstract. We consider the problem of testing functions for the property of being a k-junta (i.e., of...
The field of property testing has been studied for decades, and Boolean functions are among the most...
We introduce a new model for testing graph properties which we call the rejection sampling model. We...
We give the first super-polynomial (in fact, mildly exponential) lower bounds for tolerant testing (...
A Boolean function f:{0,1}^n->{0,1} is called a dictator if it depends on exactly one variable i.e f...
We study the problem of testing whether a function f:?? ? ? is linear (i.e., both additive and homog...
Over the past few decades property testing has became an active field of study in theoretical comput...
We study the problem of learning k-juntas given access to examples drawn from a number of different ...
We consider a fundamental problem in computational learning theory: learning in the presence of irr...
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called dis...
We present an adaptive tester for the unateness property of Boolean functions. Given a function f:{0...