Related papers: Noise Correlation Bounds for Uniform Low Degree Fu…

In this paper an analytic expression is given for the bounds of the distribution function of the sum of dependent normally distributed random variables. Using the theory of copulas and the important Frechet bounds the dependence structure…

Fill an n x n matrix with independent complex Gaussians of variance 1/n. As n approaches infinity, the eigenvalues {z_k} converge to a sum of an H^1-noise on the unit disk and an independent H^{1/2}-noise on the unit circle. More precisely,…

Providing non-conservative uncertainty quantification for function estimates derived from noisy observations remains a fundamental challenge in statistical machine learning, particularly for applications in safety-critical domains. In this…

The probabilistic degree of a Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is defined to be the smallest $d$ such that there is a random polynomial $\mathbf{P}$ of degree at most $d$ that agrees with $f$ at each point with high…

We give improved and almost optimal testers for several classes of Boolean functions on $n$ inputs that have concise representation in the uniform and distribution-free model. Classes, such as $k$-junta, $k$-linear functions, $s$-term DNF,…

The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…

We present a self-consistent analytic theory of the intra-layer and inter-layer pair correlation functions in electron-electron and electron-hole fluid bilayer systems. Our approach involves the solution of a zero-energy scattering…

Given a function $f$ on $\mathbb{F}_2^n$, we study the following problem. What is the largest affine subspace $\mathcal{U}$ such that when restricted to $\mathcal{U}$, all the non-trivial Fourier coefficients of $f$ are very small? For the…

We study the arithmetic (real) function f=g*1, with g "essentially bounded" and supported over the integers of [1,Q]. In particular, we obtain non-trivial bounds, through f "correlations", for the "Selberg integral" and the "symmetry…

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…

We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…

A generic uniformly distributed random sequence on the unit interval has Poissonian pair correlations. At the same time, there are only very few explicitly known examples of sequences with this property. Moreover, many types of…

In this paper,our main focus is to obtain an asymptotic bound on the family wise error rate (FWER) for Bonferroni-type procedure in the simultaneous hypotheses testing problem when the observations corresponding to individual hypothesis are…

We study whether a uniformly random Boolean function $f : \{-1,1\}^p \to \{-1,1\}$ is determined by its Walsh--Fourier coefficients of degree at most $d$. We show that the threshold lies at $p/2$ up to an $O(\sqrt{p \log p})$ window: if \[…

We consider the probability distributions of values in the complex plane attained by Fourier sums of the form \sum_{j=1}^n a_j exp(-2\pi i j nu) /sqrt{n} when the frequency nu is drawn uniformly at random from an interval of length 1. If…

Let $\mathbb{F}$ be a fixed finite field, and let $A \subset \mathbb{F}^n$. It is a well-known fact that there is a subspace $V \leq \mathbb{F}^n$, $\mbox{codim} V \ll_{\delta} 1$, and an $x$, such that $A$ is $\delta$-uniform when…

The approximate degree of a Boolean function $f \colon \{-1, 1\}^n \rightarrow \{-1, 1\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the…

We establish asymptotic estimates for the least upper bounds of approximations in the uniform metric by Fourier sums of order $n-1$ of classes of $2\pi$-periodic Weyl--Nagy differentiable functions, $W^r_{\beta,p}, 1\le p\le \infty,…

In functional data analysis (FDA), covariance function is fundamental not only as a critical quantity for understanding elementary aspects of functional data but also as an indispensable ingredient for many advanced FDA methods. This paper…

We present a technique of proving lower bounds for noisy computations. This is achieved by a theorem connecting computations on a kind of randomized decision trees and sampling based algorithms. This approach is surprisingly powerful, and…