Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH scholarly article en Haviv, Ishay; Regev, Oded http://www.dagstuhl.de/lipics License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-50600
URL:

;

The List-Decoding Size of Fourier-Sparse Boolean Functions

pdf-format:


Abstract

A function defined on the Boolean hypercube is k-Fourier-sparse if it has at most k nonzero Fourier coefficients. For a function f: F_2^n -> R 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 * k * log(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 [Chicago J. Theor. Comput. Sci.,2013].

BibTeX - Entry

@InProceedings{haviv_et_al:LIPIcs:2015:5060,
  author =	{Ishay Haviv and Oded Regev},
  title =	{{The List-Decoding Size of Fourier-Sparse Boolean Functions}},
  booktitle =	{30th Conference on Computational Complexity (CCC 2015)},
  pages =	{58--71},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-81-1},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{33},
  editor =	{David Zuckerman},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5060},
  URN =		{urn:nbn:de:0030-drops-50600},
  doi =		{10.4230/LIPIcs.CCC.2015.58},
  annote =	{Keywords: Fourier-sparse functions, list-decoding, learning theory, property testing}
}

Keywords: Fourier-sparse functions, list-decoding, learning theory, property testing
Seminar: 30th Conference on Computational Complexity (CCC 2015)
Issue date: 2015
Date of publication: 2015


DROPS-Home | Fulltext Search | Imprint Published by LZI