Abstract
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor approximation is hard in general, we consider several relaxations of the problem. In particular, we consider a relaxation of the property testing variant of the problem and we consider relaxations in which we have a promise that the function belongs to a certain family of functions (e.g., linear functions). In the former relaxation the task is to distinguish between the case that the number of relevant variables is at most k, and the case in which it is far from any function in which the number of relevant variables is more than (1 + γ)k for a parameter γ. We give both upper bounds and almost matching lower bounds for the relaxations we study.
- Alon, N., Dar, S., Parnas, M., and Ron, D. 2003. Testing of clustering. SIAM J. Discr. Math. 16, 3, 393--417. Google Scholar
Digital Library
- Blais, E. 2008. Improved bounds for testing juntas. In Proceedings of the 12th International Workshop on Randomization and Computation (RANDOM’08). 317--330. Google Scholar
Digital Library
- Blais, E. 2009. Testing juntas nearly optimally. In Proceedings of the 41st Annual ACM Symposium on the Theory of Computing (STOC’09). 151--158. Google Scholar
Digital Library
- Blais, E., Brody, J., and Matulef, K. 2012. Property testing lower bounds via communication complexity. Comput. Complex. 21, 2, 311--358. Google Scholar
Digital Library
- Chakraborty, S., García-Soriano, D., and Matsliah, A. 2010. Private communication.Google Scholar
- Chockler, H. and Gutfreund, D. 2004. A lower bound for testing juntas. Inf. Process. Lett. 90, 6, 301--305. Google Scholar
Digital Library
- Fischer, E., Kindler, G., Ron, D., Safra, S., and Samorodnitsky, S. 2004. Testing juntas. J. Comput. Syst. Sci. 68, 4, 753--787. Google Scholar
Digital Library
- Goldreich, O. 2010. On testing computability by small width OBDDs. In Proceedings of the 14th International Workshop on Randomization and Computation (RANDOM’10). 574--587. Google Scholar
Digital Library
- Goldreich, O., Goldwasser, S., and Ron, D. 1998. Property testing and its connection to learning and approximation. J. ACM 45, 4, 653--750. Google Scholar
Digital Library
- Kearns, M. and Ron, D. 2000. Testing problems with sub-learning sample complexity. J. Comput. Syst. Sci. 61, 3, 428--456. Google Scholar
Digital Library
- Parnas, M. and Ron, D. 2002. Testing the diameter of graphs. Random Struct. Algor. 20, 2, 165--183. Google Scholar
Digital Library
- Raskhodnikova, S., Ron, D., Shpilka, A., and Smith, A. 2009. Strong lower bonds for approximating distributions support size and the distinct elements problem. SIAM J. Comput. 39, 3, 813--842. Google Scholar
Digital Library
- Ron, D., Rubinfeld, R., Safra, M., and Weinstein, O. 2012. Approximating the influence of a monotone boolean function in o(√n) query complexity. ACM Trans. Comput. Theory 4, 4, 11. Google Scholar
Digital Library
- Rubinfeld, R. and Sudan, M. 1996. Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25, 2, 252--271. Google Scholar
Digital Library
- Valiant, G. 2012. Algorithmic solutions to some statistical questions. Ph.D. thesis, University of California at Berkeley.Google Scholar
- Valiant, G. and Valiant, P. 2011. Estimating the unseen: An n/log(n)-sample estimator for entropy and support size, shown optimal via new CLTs. In Proceedings of the 43rd Annual ACM Symposium on the Theory of Computing (STOC’11). 685--694. Google Scholar
Digital Library
- Valiant, P. 2011. Testing symmetric properties of distributions. SIAM J. Comput. 40, 6, 1927--1968. Google Scholar
Digital Library
- Wegener, I. 1985. The critical complexity of all (monotone) boolean functions and monotone graph properties. Inf. Control 67, 1--3, 212--222. Google Scholar
Digital Library
Index Terms
On Approximating the Number of Relevant Variables in a Function
Recommendations
On approximating the number of relevant variables in a function
APPROX'11/RANDOM'11: Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniquesIn this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor approximation is hard in general, we consider several relaxations of the ...
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
For Boolean functions that are $\epsilon$-far from the set of linear functions, we study the lower bound on the rejection probability (denoted by $\textsc{rej}(\epsilon)$) of the linearity test suggested by Blum, Luby, and Rubinfeld [J. Comput. System ...
Lower Bounds for Testing Function Isomorphism
CCC '10: Proceedings of the 2010 IEEE 25th Annual Conference on Computational ComplexityWe prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function $f$ is isomorphic to a fixed function $g$ (i.e., is equal to $g$ up to permutation of the input ...






Comments