Local Correction with Constant Error Rate
Noga Alon, Amit Weinstein

TL;DR
This paper extends local correction techniques to functions with a constant error rate, focusing on juntas and partially symmetric functions, and introduces algorithms with non-adaptive queries that work for most functions in these families.
Contribution
It relaxes the closeness requirement for local correction to a constant error rate and provides algorithms for almost all juntas and partially symmetric functions.
Findings
Almost every k-junta is O(k log^2 k)-locally correctable for epsilon < 0.001.
Similar correction results are shown for partially symmetric functions.
The algorithms use non-adaptive queries and are applicable to most functions in these families.
Abstract
A Boolean function f of n variables is said to be q-locally correctable if, given a black-box access to a function g which is "close" to an isomorphism f_sigma(x)=f_sigma(x_1, ..., x_n) = f(x_sigma(1), ..., x_sigma(n)) of f, we can compute f_sigma(x) for any x in {0,1}^n with good probability using q queries to g. It is known that degree d polynomials are O(2^d)-locally correctable, and that most k-juntas are O(k log k)-locally correctable, where the closeness parameter, or more precisely the distance between g and f_sigma, is required to be exponentially small (in d and k respectively). In this work we relax the requirement for the closeness parameter by allowing the distance between the functions to be a constant. We first investigate the family of juntas, and show that almost every k-junta is O(k log^2 k)-locally correctable for any distance epsilon < 0.001. A similar result is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Machine Learning and Algorithms · Algorithms and Data Compression
