English
Related papers

Related papers: Gaussian Bounds for Noise Correlation of Resilient…

200 papers

In this paper we derive tight bounds on the expected value of products of {\em low influence} functions defined on correlated probability spaces. The proofs are based on extending Fourier theory to an arbitrary number of correlated…

Probability · Mathematics 2009-06-01 Elchanan Mossel

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

A Boolean function $f:\{0,1\}^n \to \{0,1\}$ is said to be noise sensitive if inserting a small random error in its argument makes the value of the function almost unpredictable. Benjamini, Kalai and Schramm showed that if the sum of…

Combinatorics · Mathematics 2010-03-10 Nathan Keller , Guy Kindler

Benjamini, Kalai and Schramm showed that a monotone function $f : \{-1,1\}^n \to \{-1,1\}$ is noise stable if and only if it is correlated with a half-space (a set of the form $\{x: \langle x, a\rangle \le b\}$). We study noise stability in…

Probability · Mathematics 2016-03-08 Elchanan Mossel , Joe Neeman

In the noisy query model, the (binary) return value of every query (possibly repeated) is independently flipped with some fixed probability $p \in (0, 1/2)$. In this paper, we obtain tight bounds on the noisy query complexity of several…

Data Structures and Algorithms · Computer Science 2025-02-17 Yuzhou Gu , Xin Li , Yinzhan Xu

We revisit the problem of computing with noisy information considered in Feige et al. 1994, which includes computing the OR function from noisy queries, and computing the MAX, SEARCH and SORT functions from noisy pairwise comparisons. For…

Data Structures and Algorithms · Computer Science 2023-06-22 Banghua Zhu , Ziao Wang , Nadim Ghaddar , Jiantao Jiao , Lele Wang

This paper considers the problem of approximating a Boolean function $f$ using another Boolean function from a specified class. Two classes of approximating functions are considered: $k$-juntas, and linear Boolean functions. The $n$ input…

Information Theory · Computer Science 2019-07-09 Mohsen Heidari , S. Sandeep Pradhan , Ramji Venkataramanan

We consider the problem of estimating convex boundaries from blurred and noisy observations. In our model, the convolution of an intensity function $f$ is observed with additive Gaussian white noise. The function $f$ is assumed to have…

Statistics Theory · Mathematics 2007-06-13 Alexander Goldenshluger , Assaf Zeevi

We analyze the influence of classical Gaussian noise on Landau-Zener transitions during a two-level crossing in a time-dependent regular external field. Transition probabilities and coherence factors become random due to the noise. We…

Statistical Mechanics · Physics 2009-11-10 V. L. Pokrovsky , S. Scheidl

We present a regularity lemma for Boolean functions $f:\{-1,1\}^n \to \{-1,1\}$ based on noisy influence, a measure of how locally correlated $f$ is with each input bit. We provide an application of the regularity lemma to weaken the…

Computational Complexity · Computer Science 2016-10-25 Chris Jones

We observe that given two (compatible) classes of functions $\mathcal{F}$ and $\mathcal{H}$ with small capacity as measured by their uniform covering numbers, the capacity of the composition class $\mathcal{H} \circ \mathcal{F}$ can become…

Machine Learning · Statistics 2022-06-16 Alireza Fathollah Pour , Hassan Ashtiani

In this paper we study functions with low influences on product probability spaces. The analysis of boolean functions with low influences has become a central problem in discrete Fourier analysis. It is motivated by fundamental questions…

Probability · Mathematics 2007-05-23 Elchanan Mossel , Ryan O'Donnell , Krzysztof Oleszkiewicz

We show that correlation functions have to satisfy contraint relations, owing to the non-negativity of the power spectrum of the underlying random process. Specifically, for any statistically homogeneous and (for more than one spatial…

Cosmology and Nongalactic Astrophysics · Physics 2015-05-13 Peter Schneider , Jan Hartlap

The noise sensitivity of a Boolean function describes its likelihood to flip under small perturbations of its input. Introduced in the seminal work of Benjamini, Kalai and Schramm [Inst. Hautes \'{E}tudes Sci. Publ. Math. 90 (1999) 5-43],…

Probability · Mathematics 2015-12-23 Eyal Lubetzky , Jeffrey E. Steif

The conditional mean is a fundamental and important quantity whose applications include the theories of estimation and rate-distortion. It is also notoriously difficult to work with. This paper establishes novel bounds on the differential…

Information Theory · Computer Science 2022-11-23 Arda Atalik , Alper Köse , Michael Gastpar

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

It has been generally recognized that stochasticity can play an important role in the information processing accomplished by reaction networks in biological cells. Most treatments of that stochasticity employ Gaussian noise even though it…

Molecular Networks · Quantitative Biology 2015-05-30 Neda Bostani , David A. Kessler , Nadav M. Shnerb , Wouter-Jan Rappel , Herbert Levine

Bounds for the correlation functions of identical bosons are discussed for the general case of a Gaussian density matrix. In particular, for a purely chaotic system the two-particle correlation function must always be greater than one. On…

High Energy Physics - Phenomenology · Physics 2009-10-22 M. Plümer , L. V. Razumov , R. M. Weiner

Consider estimation of the regression function based on a model with equidistant design and measurement errors generated from a fractional Gaussian noise process. In previous literature, this model has been heuristically linked to an…

Statistics Theory · Mathematics 2014-12-02 Johannes Schmidt-Hieber

Non-conservative uncertainty bounds are essential for making reliable predictions about latent functions from noisy data, and thus, a key enabler for safe learning-based control. In this domain, kernel methods such as Gaussian process…

Machine Learning · Computer Science 2026-05-26 Amon Lahr , Anna Scampicchio , Johannes Köhler , Melanie N. Zeilinger
‹ Prev 1 2 3 10 Next ›