English
Related papers

Related papers: Quantitative relation between noise sensitivity an…

200 papers

A celebrated theorem of Friedgut says that every function $f:\{0,1\}^n \to \{0,1\}$ can be approximated by a function $g:\{0,1\}^n \to \{0,1\}$ with $\|f-g\|_2^2 \le \epsilon$ which depends only on $e^{O(I_f/\epsilon)}$ variables where…

Probability · Mathematics 2009-03-14 Hamed Hatami

We study correlation bounds under pairwise independent distributions for functions with no large Fourier coefficients. Functions in which all Fourier coefficients are bounded by $\delta$ are called $\delta$-{\em uniform}. The search for…

Probability · Mathematics 2010-11-09 Per Austrin , Elchanan Mossel

The influence of a variable is an important concept in the analysis of Boolean functions. The more general notion of influence of a set of variables on a Boolean function has four separate definitions in the literature. In the present work,…

Information Theory · Computer Science 2023-02-15 Aniruddha Biswas , Palash Sarkar

We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube ${0,1}^n$. Informally, a function $f:{0,1}^n \rightarrow \mathbb{R}$ is self-bounding if for every $x…

Machine Learning · Computer Science 2019-06-04 Vitaly Feldman , Pravesh Kothari , Jan Vondrák

For any Boolean function $f:\{0,1\}^n \to \{0,1\}$ with a complexity measure having value $k \ll n$, is it possible to restrict the function $f$ to $\Theta(k)$ variables while keeping the complexity preserved at $\Theta(k)$? This question,…

Computational Complexity · Computer Science 2026-05-22 Chandrima Kayal , Rajat Mittal , Sai Soumya Nalli , Manaswi Paraashar , Karthikeya Polisetty , Jayalal Sarma , Nitin Saurabh

Consider a monotone Boolean function $f:\{0,1\}^n\to\{0,1\}$ and the canonical monotone coupling $\{\eta_p:p\in[0,1]\}$ of an element in $\{0,1\}^n$ chosen according to product measure with intensity $p\in[0,1]$. The random point…

Probability · Mathematics 2018-10-08 Daniel Ahlberg , Jeffrey E. Steif , Gábor Pete

We demonstrate how the ineluctable presence of thermal noise alters the measurement of forces acting on microscopic and nanoscopic objects. We quantify this effect exemplarily for a Brownian particle near a wall subjected to gravitational…

Soft Condensed Matter · Physics 2015-05-18 Giovanni Volpe , Laurent Helden , Thomas Brettschneider , Jan Wehr , Clemens Bechinger

Let $T_{\epsilon}$ be the noise operator acting on Boolean functions $f:\{0, 1\}^n\to \{0, 1\}$, where $\epsilon\in[0, 1/2]$ is the noise parameter. Given $\alpha>1$ and fixed mean $\mathbb{E} f$, which Boolean function $f$ has the largest…

Probability · Mathematics 2021-01-27 Jiange Li , Muriel Medard

The Courtade-Kumar conjecture posits that dictatorship functions maximize the mutual information between the function's output and a noisy version of its input over the Boolean hypercube. We present two significant advancements related to…

Information Theory · Computer Science 2026-01-15 Adel Javanmard , David P. Woodruff

It is shown that a class of optical physical unclonable functions (PUFs) can be learned to arbitrary precision with arbitrarily high probability, even in the presence of noise, given access to polynomially many challenge-response pairs and…

Machine Learning · Computer Science 2023-09-08 Apollo Albright , Boris Gelfand , Michael Dixon

Consider an unknown smooth function $f: [0,1]^d \rightarrow \mathbb{R}$, and say we are given $n$ noisy mod 1 samples of $f$, i.e., $y_i = (f(x_i) + \eta_i)\mod 1$, for $x_i \in [0,1]^d$, where $\eta_i$ denotes the noise. Given the samples…

Machine Learning · Statistics 2019-10-29 Mihai Cucuringu , Hemant Tyagi

We study two conjectures posed in the analysis of Boolean functions $f : \{-1, 1\}^n \to \{-1, 1\}$, in both of which, the Majority function plays a central role: the "Majority is Least Stable" (Benjamini et al., 1999) and the…

Computational Complexity · Computer Science 2026-04-09 Pritish Kamath , Ravi Kumar , Pasin Manurangsi

Let $\R(\cdot)$ stand for the bounded-error randomized query complexity. We show that for any relation $f \subseteq \{0,1\}^n \times \mathcal{S}$ and partial Boolean function $g \subseteq \{0,1\}^n \times \{0,1\}$, $\R_{1/3}(f \circ g^n) =…

Computational Complexity · Computer Science 2018-01-11 Swagato Sanyal

In this paper we introduce the study of quantum boolean functions, which are unitary operators f whose square is the identity: f^2 = I. We describe several generalisations of well-known results in the theory of boolean functions, including…

Quantum Physics · Physics 2010-12-20 Ashley Montanaro , Tobias J. Osborne

The study of random Fourier series, linear combinations of trigonometric functions whose coefficients are independent (in our case Gaussian) random variables with polynomially bounded means and standard deviations, dates back to Norbert…

Spectral Theory · Mathematics 2023-01-10 Ethan Sussman

We study theoretical predictive performance of ridge and ridge-less least-squares regression when covariate vectors arise from evaluating $p$ random, means-square continuous functions over a latent metric space at $n$ random and unobserved…

Machine Learning · Statistics 2025-08-20 Andrew Jones , Nick Whiteley

The seminal result of Kahn, Kalai and Linial shows that a coalition of $O(\frac{n}{\log n})$ players can bias the outcome of any Boolean function $\{0,1\}^n \to \{0,1\}$ with respect to the uniform measure. We extend their result to…

Discrete Mathematics · Computer Science 2019-02-21 Yuval Filmus , Lianna Hambardzumyan , Hamed Hatami , Pooya Hatami , David Zuckerman

Let $[q] = \{0,1,\ldots,q-1\}$, let $\Delta[q]$ denote the simplex of probability measures on $[q]$, and let $\gamma$ denote the Lebesgue measure normalized on $\Delta[q]$. We prove that for any symmetric monotone function $f \colon[q]^n…

Probability · Mathematics 2026-05-20 Saba Lepsveridze , Allen Lin

We investigate the effect of noise on Random Boolean Networks. Noise is implemented as a probability $p$ that a node does not obey its deterministic update rule. We define two order parameters, the long-time average of the Hamming distance…

Biological Physics · Physics 2009-11-13 Tiago P. Peixoto , Barbara Drossel

We present a new definition of influences in product spaces of continuous distributions. Our definition is geometric, and for monotone sets it is identical with the measure of the boundary with respect to uniform enlargement. We prove…

Probability · Mathematics 2012-05-25 Nathan Keller , Elchanan Mossel , Arnab Sen
‹ Prev 1 3 4 5 6 7 10 Next ›