skip to main content
research-article

Limitations of Local Filters of Lipschitz and Monotone Functions

Published:13 January 2015Publication History
Skip Abstract Section

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.

References

  1. Nir Ailon, Bernard Chazelle, Seshadhri Comandur, and Ding Liu. 2008. Property-preserving data reconstruction. Algorithmica 51, 2, 160--182. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle ScholarCross RefCross Ref
  4. Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, and David P. Woodruff. 2012b. Transitive-closure spanners. SIAM J. Comput. 41, 6, 1380--1425 .Google ScholarGoogle ScholarCross RefCross Ref
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  8. Oded Goldreich, Shafi Goldwasser, and Dana Ron. 1998. Property testing and its connection to learning and approximation. J. ACM 45, 4, 653--750. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. Jonathan Katz and Luca Trevisan. 2000. On the efficiency of local decoding procedures for error-correcting codes. In Proceedings of STOC. 80--86. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  12. Ronitt Rubinfeld and Madhu Sudan. 1996. Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25, 2, 252--271. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Ronitt Rubinfeld, Gil Tamir, Shai Vardi, and Ning Xie. 2011. Fast local computation algorithms. In Proceedings of ICS. 223--238.Google ScholarGoogle Scholar
  14. Michael E. Saks and C. Seshadhri. 2010. Local monotonicity reconstruction. SIAM J. Comput. 39, 7, 2897--2926. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Limitations of Local Filters of Lipschitz and Monotone Functions

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Computation Theory
      ACM Transactions on Computation Theory  Volume 7, Issue 1
      December 2014
      104 pages
      ISSN:1942-3454
      EISSN:1942-3462
      DOI:10.1145/2692372
      Issue’s Table of Contents

      Copyright © 2015 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 13 January 2015
      • Revised: 1 May 2014
      • Accepted: 1 May 2014
      • Received: 1 April 2013
      Published in toct Volume 7, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!