{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article12915","name":"Approximating the Noise Sensitivity of a Monotone Boolean Function","abstract":"The noise sensitivity of a Boolean function f: {0,1}^n - > {0,1} is one of its fundamental properties. For noise parameter delta, the noise sensitivity is denoted as NS_{delta}[f]. This quantity is defined as follows: First, pick x = (x_1,...,x_n) uniformly at random from {0,1}^n, then pick z by flipping each x_i independently with probability delta. NS_{delta}[f] is defined to equal Pr [f(x) != f(z)]. Much of the existing literature on noise sensitivity explores the following two directions: (1) Showing that functions with low noise-sensitivity are structured in certain ways. (2) Mathematically showing that certain classes of functions have low noise sensitivity. Combined, these two research directions show that certain classes of functions have low noise sensitivity and therefore have useful structure. \r\nThe fundamental importance of noise sensitivity, together with this wealth of structural results, motivates the algorithmic question of approximating NS_{delta}[f] given an oracle access to the function f. We show that the standard sampling approach is essentially optimal for general Boolean functions. Therefore, we focus on estimating the noise sensitivity of monotone functions, which form an important subclass of Boolean functions, since many functions of interest are either monotone or can be simply transformed into a monotone function (for example the class of unate functions consists of all the functions that can be made monotone by reorienting some of their coordinates [O'Donnell, 2014]). \r\nSpecifically, we study the algorithmic problem of approximating NS_{delta}[f] for monotone f, given the promise that NS_{delta}[f] >= 1\/n^{C} for constant C, and for delta in the range 1\/n <= delta <= 1\/2. For such f and delta, we give a randomized algorithm performing O((min(1,sqrt{n} delta log^{1.5} n))\/(NS_{delta}[f]) poly (1\/epsilon)) queries and approximating NS_{delta}[f] to within a multiplicative factor of (1 +\/- epsilon). Given the same constraints on f and delta, we also prove a lower bound of Omega((min(1,sqrt{n} delta))\/(NS_{delta}[f] * n^{xi})) on the query complexity of any algorithm that approximates NS_{delta}[f] to within any constant factor, where xi can be any positive constant. Thus, our algorithm\u2019s query complexity is close to optimal in terms of its dependence on n.\r\nWe introduce a novel descending-ascending view of noise sensitivity, and use it as a central tool for the analysis of our algorithm. To prove lower bounds on query complexity, we develop a technique that reduces computational questions about query complexity to combinatorial questions about the existence of \"thin\" functions with certain properties. The existence of such \"thin\" functions is proved using the probabilistic method. These techniques also yield new lower bounds on the query complexity of approximating other fundamental properties of Boolean functions: the total influence and the bias.","keywords":["Monotone Boolean functions","noise sensitivity","influence"],"author":[{"@type":"Person","name":"Rubinfeld, Ronitt","givenName":"Ronitt","familyName":"Rubinfeld","email":"mailto:ronitt@csail.mit.edu","affiliation":"CSAIL at MIT, Cambridge, MA, USA","funding":"NSF grants CCF-1650733, CCF-1733808, IIS-1741137 and CCF-1740751"},{"@type":"Person","name":"Vasilyan, Arsen","givenName":"Arsen","familyName":"Vasilyan","email":"mailto:vasilyan@mit.edu","affiliation":"CSAIL at MIT, Cambridge, MA, USA","funding":"NSF grant IIS-1741137, EECS SuperUROP program, the MIT Summer UROP program and the DeFlorez Endowment Fund"}],"position":52,"pageStart":"52:1","pageEnd":"52:17","dateCreated":"2019-09-17","datePublished":"2019-09-17","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Rubinfeld, Ronitt","givenName":"Ronitt","familyName":"Rubinfeld","email":"mailto:ronitt@csail.mit.edu","affiliation":"CSAIL at MIT, Cambridge, MA, USA","funding":"NSF grants CCF-1650733, CCF-1733808, IIS-1741137 and CCF-1740751"},{"@type":"Person","name":"Vasilyan, Arsen","givenName":"Arsen","familyName":"Vasilyan","email":"mailto:vasilyan@mit.edu","affiliation":"CSAIL at MIT, Cambridge, MA, USA","funding":"NSF grant IIS-1741137, EECS SuperUROP program, the MIT Summer UROP program and the DeFlorez Endowment Fund"}],"copyrightYear":"2019","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2019.52","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["https:\/\/doi.org\/10.1137\/110855223","https:\/\/doi.org\/10.1007\/s00037-011-0012-6","https:\/\/doi.org\/10.1145\/2591796.2591798","http:\/\/arxiv.org\/abs\/math\/0412377","https:\/\/doi.org\/10.1145\/2382559.2382562"],"isPartOf":{"@type":"PublicationVolume","@id":"#volume6348","volumeNumber":145,"name":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2019)","dateCreated":"2019-09-17","datePublished":"2019-09-17","editor":[{"@type":"Person","name":"Achlioptas, Dimitris","givenName":"Dimitris","familyName":"Achlioptas","email":"mailto:optas@soe.ucsc.edu","affiliation":"UC Santa Cruz, California, USA"},{"@type":"Person","name":"V\u00e9gh, L\u00e1szl\u00f3 A.","givenName":"L\u00e1szl\u00f3 A.","familyName":"V\u00e9gh","email":"mailto:L.Vegh@lse.ac.uk","affiliation":"London School of Economics and Political Science, London, UK"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article12915","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6348"}}}