The list-decoding size of fourier-sparse Boolean functions

Ishay Haviv, Oded Regev

Research output: Contribution to journalArticle

Abstract

A function defined on the Boolean hypercube is k-Fourier-sparse if it has at most knonzero Fourier coefficients. For a function f: Fn 2 → ℝ and parameters k and d, we prove a strong upper bound on the number of k-Fourier-sparse Boolean functions that disagree with f on at most d inputs. Our bound implies that the number of uniform and independent random samples needed for learning the class of k-Fourier-sparse Boolean functions on n variables exactly is at most O(n·klog k). As an application, we prove an upper bound on the query complexity of testing Booleanity of Fourier-sparse functions. Our bound is tight up to a logarithmic factor and quadratically improves on a result due to Gur and Tamuz [2013].

Original languageEnglish (US)
Article number10
JournalACM Transactions on Computation Theory
Volume8
Issue number3
DOIs
StatePublished - May 1 2016

Fingerprint

List Decoding
Boolean functions
Boolean Functions
Decoding
Upper bound
Query Complexity
Fourier coefficients
Hypercube
Logarithmic
Testing
Imply

Keywords

  • Fourier-sparse Boolean functions
  • Learning theory
  • Property testing

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

The list-decoding size of fourier-sparse Boolean functions. / Haviv, Ishay; Regev, Oded.

In: ACM Transactions on Computation Theory, Vol. 8, No. 3, 10, 01.05.2016.

Research output: Contribution to journalArticle

@article{ad26116293f5491aaed90c2d14de3721,
title = "The list-decoding size of fourier-sparse Boolean functions",
abstract = "A function defined on the Boolean hypercube is k-Fourier-sparse if it has at most knonzero Fourier coefficients. For a function f: Fn 2 → ℝ and parameters k and d, we prove a strong upper bound on the number of k-Fourier-sparse Boolean functions that disagree with f on at most d inputs. Our bound implies that the number of uniform and independent random samples needed for learning the class of k-Fourier-sparse Boolean functions on n variables exactly is at most O(n·klog k). As an application, we prove an upper bound on the query complexity of testing Booleanity of Fourier-sparse functions. Our bound is tight up to a logarithmic factor and quadratically improves on a result due to Gur and Tamuz [2013].",
keywords = "Fourier-sparse Boolean functions, Learning theory, Property testing",
author = "Ishay Haviv and Oded Regev",
year = "2016",
month = "5",
day = "1",
doi = "10.1145/2898439",
language = "English (US)",
volume = "8",
journal = "ACM Transactions on Computation Theory",
issn = "1942-3454",
publisher = "Association for Computing Machinery (ACM)",
number = "3",

}

TY - JOUR

T1 - The list-decoding size of fourier-sparse Boolean functions

AU - Haviv, Ishay

AU - Regev, Oded

PY - 2016/5/1

Y1 - 2016/5/1

N2 - A function defined on the Boolean hypercube is k-Fourier-sparse if it has at most knonzero Fourier coefficients. For a function f: Fn 2 → ℝ and parameters k and d, we prove a strong upper bound on the number of k-Fourier-sparse Boolean functions that disagree with f on at most d inputs. Our bound implies that the number of uniform and independent random samples needed for learning the class of k-Fourier-sparse Boolean functions on n variables exactly is at most O(n·klog k). As an application, we prove an upper bound on the query complexity of testing Booleanity of Fourier-sparse functions. Our bound is tight up to a logarithmic factor and quadratically improves on a result due to Gur and Tamuz [2013].

AB - A function defined on the Boolean hypercube is k-Fourier-sparse if it has at most knonzero Fourier coefficients. For a function f: Fn 2 → ℝ and parameters k and d, we prove a strong upper bound on the number of k-Fourier-sparse Boolean functions that disagree with f on at most d inputs. Our bound implies that the number of uniform and independent random samples needed for learning the class of k-Fourier-sparse Boolean functions on n variables exactly is at most O(n·klog k). As an application, we prove an upper bound on the query complexity of testing Booleanity of Fourier-sparse functions. Our bound is tight up to a logarithmic factor and quadratically improves on a result due to Gur and Tamuz [2013].

KW - Fourier-sparse Boolean functions

KW - Learning theory

KW - Property testing

UR - http://www.scopus.com/inward/record.url?scp=84969924819&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84969924819&partnerID=8YFLogxK

U2 - 10.1145/2898439

DO - 10.1145/2898439

M3 - Article

VL - 8

JO - ACM Transactions on Computation Theory

JF - ACM Transactions on Computation Theory

SN - 1942-3454

IS - 3

M1 - 10

ER -