Abstract
We study local filters for two properties of functions of the form f : {0,1}d → R: the Lipschitz property and monotonicity. A local filter with additive error a is a randomized algorithm that is given black-box access to a function f and a query point x in the domain of f. It outputs a value F(x) such that (i) the reconstructed function F(x) satisfies the property (in our case, is Lipschitz or monotone) and (ii) if the input function f satisfies the property, then for every point x in the domain (with high constant probability) the reconstructed value F(x) differs from f(x) by at most a. Local filters were introduced by Saks and Seshadhri [2010]. The relaxed definition we study is due to Bhattacharyya et al. [2012], except that we further relax it by allowing additive error. Local filters for Lipschitz and monotone functions have applications to areas such as data privacy.
We show that every local filter for Lipschitz or monotone functions runs in time exponential in the dimension d, even when the filter is allowed significant additive error. Prior lower bounds (for local filters with no additive error, that is, with a=0) applied only to a more restrictive class of filters, for example, nonadaptive filters. To prove our lower bounds, we construct families of hard functions and show that lookups of a local filter on these functions are captured by a combinatorial object that we call a c-connector. Then we present a lower bound on the maximum outdegree of a c-connector and show that it implies the desired bounds on the running time of local filters. Our lower bounds, in particular, imply the same bound on the running time for a class of privacy mechanisms.
- Nir Ailon, Bernard Chazelle, Seshadhri Comandur, and Ding Liu. 2008. Property-preserving data reconstruction. Algorithmica 51, 2, 160--182. Google Scholar
Digital Library
- Noga Alon, Ronitt Rubinfeld, Shai Vardi, and Ning Xie. 2012. Space-efficient local computation algorithms. In Proceedings of SODA, Yuval Rabani (Ed.), SIAM, 1132--1139. Google Scholar
Digital Library
- Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung, Sofya Raskhodnikova, and David P. Woodruff. 2012a. Lower bounds for local monotonicity reconstruction from transitive-closure spanners. SIAM J. Disc. Math. 26, 2, 618--646.Google Scholar
Cross Ref
- Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, and David P. Woodruff. 2012b. Transitive-closure spanners. SIAM J. Comput. 41, 6, 1380--1425 .Google Scholar
Cross Ref
- Manuel Blum, Michael Luby, and Ronitt Rubinfeld. 1993. Self-testing/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47, 3, 549--595. Google Scholar
Digital Library
- Cynthia Dwork, Krishnaram Kenthapadi, Frank Mcsherry, and Moni Naor. 2006a.Our data, ourselves: Privacy via distributed noise generation. In Proceedings of EUROCRYPT. Springer, 486--503. Google Scholar
Digital Library
- Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. 2006b. Calibrating noise to sensitivity in private data analysis. In Proceedings of TCC. 265--284. Google Scholar
Digital Library
- Oded Goldreich, Shafi Goldwasser, and Dana Ron. 1998. Property testing and its connection to learning and approximation. J. ACM 45, 4, 653--750. Google Scholar
Digital Library
- Madhav Jha and Sofya Raskhodnikova. 2013. Testing and reconstruction of Lipschitz functions with applications to data privacy. SIAM J. Comput. 42, 2, 700--731.Google Scholar
Digital Library
- Jonathan Katz and Luca Trevisan. 2000. On the efficiency of local decoding procedures for error-correcting codes. In Proceedings of STOC. 80--86. Google Scholar
Digital Library
- Sofya Raskhodnikova. 2010. Transitive-closure spanners: A survey. In Property Testing, Oded Goldreich (Ed.), Lecture Notes in Computer Science, vol. 6390, Springer, 167--196. Google Scholar
Digital Library
- Ronitt Rubinfeld and Madhu Sudan. 1996. Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25, 2, 252--271. Google Scholar
Digital Library
- Ronitt Rubinfeld, Gil Tamir, Shai Vardi, and Ning Xie. 2011. Fast local computation algorithms. In Proceedings of ICS. 223--238.Google Scholar
- Michael E. Saks and C. Seshadhri. 2010. Local monotonicity reconstruction. SIAM J. Comput. 39, 7, 2897--2926. Google Scholar
Digital Library
Index Terms
Limitations of Local Filters of Lipschitz and Monotone Functions
Recommendations
Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids
STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingThe problem of monotonicity testing over the hypergrid and its special case, the hypercube, is a classic question in property testing. We are given query access to f:[k]n -> R (for some ordered range R). The hypergrid/cube has a natural partial order ...
A descent algorithm for solving monotone variational inequalities and monotone complementarity problems
The paper provides a descent algorithm for solving certain monotone variational inequalities and shows how this algorithm may be used for solving certain monotone complementarity problems. Convergence is proved under natural monotonicity and smoothness ...
Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
FOCS '11: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer ScienceA function f : D ? R has Lipschitz constant c if dR(f(x),f(y)) = c· dD(x,y) for all x,y in D, where dR and dD denote the distance functions on the range and domain of f, respectively. We say a function is Lipschitz if it has Lipschitz constant 1. (Note ...






Comments