Improved Bounds on Fourier Entropy and Min-Entropy
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10422306" target="_blank" >RIV/00216208:11320/20:10422306 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.4230/LIPIcs.STACS.2020.45" target="_blank" >https://doi.org/10.4230/LIPIcs.STACS.2020.45</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2020.45" target="_blank" >10.4230/LIPIcs.STACS.2020.45</a>
Alternative languages
Result language
angličtina
Original language name
Improved Bounds on Fourier Entropy and Min-Entropy
Original language description
Given a Boolean function f : { -1, l}(n) -> { -1, 1}, define the Fourier distribution to be the distribution on subsets of [n], where each S subset of [n] is sampled with probability (f) over cap (S)(2). The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai [24] seeks to relate two fundamental measures associated with the Fourier distribution: does there exist a universal constant C > 0 such that H((f) over cap (2)) <= C . Inf(f), where H((f) over cap (2)) is the Shannon entropy of the Fourier distribution of f and Inf(f) is the total influence of f? In this paper we present three new contributions towards the FEI conjecture: (i) Our first contribution shows that H((f) over cap (2)) <= 2 . aUC(circle plus) (f), where aUC(circle plus) (f) is the average unambiguous parity-certificate complexity of f . This improves upon several bounds shown by Chakraborty et al. [16]. We further improve this bound for unambiguous DNFs. (ii) We next consider the weaker Fourier Min-entropy-Influence (FMEI) conjecture posed by O'Donnell and others [43, 40] which asks if H-infinity ((f) over cap (2)) <= C . lnf(f), where H-infinity ((f) over cap (2)) is the min-entropy of the Fourier distribution. We show H-infinity ((f) over cap (2)) <= 2 . C-min(circle plus)(f), where C-min(circle plus )(f) is the minimum parity certificate complexity of f. We also show that for all epsilon >= 0, we have H-infinity ((f) over cap (2)) <= 2log(parallel to(f) over cap parallel to(1,epsilon) 1(1 - epsilon)) , where parallel to(f) over cap parallel to(1,epsilon )is the approximate spectral norm of f. As a corollary, we verify the FMEI conjecture for the class of read-k DNFs (for constant k). (iii) Our third contribution is to better understand implications of the FEI conjecture for the structure of polynomials that 1/3-approximate a Boolean function on the Boolean cube. We pose a conjecture: no flat polynomial (whose non-zero Fourier coefficients have the same magnitude) of degree d and sparsity 2(omega(d)) can 1/3-approximate a Boolean function. This conjecture is known to be true assuming FEI and we prove the conjecture unconditionally (i.e., without assuming the FEI conjecture) for a class of polynomials. We discuss an intriguing connection between our conjecture and the constant for the Bohnenblust-Hille inequality, which has been extensively studied in functional analysis.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020)
ISBN
978-3-95977-140-5
ISSN
1868-8969
e-ISSN
—
Number of pages
19
Pages from-to
—
Publisher name
SCHLOSS DAGSTUHL, LEIBNIZ CENTER INFORMATICS
Place of publication
WADEM
Event location
Montpellier
Event date
Mar 10, 2020
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000521377300045