English
Related papers

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

200 papers

Gaussian bounds on noise correlation of functions play an important role in hardness of approximation, in quantitative social choice theory and in testing. The author (2008) obtained sharp gaussian bounds for the expected correlation of…

Probability · Mathematics 2017-10-25 Elchanan Mossel

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 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

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

Computational Complexity · Computer Science 2015-02-05 Chia-Jung Lee , Satya V. Lokam , Shi-Chun Tsai , Ming-Chuan Yang

Submodular and fractionally subadditive (or equivalently XOS) functions play a fundamental role in combinatorial optimization, algorithmic game theory and machine learning. Motivated by learnability of these classes of functions from random…

Data Structures and Algorithms · Computer Science 2015-08-04 Vitaly Feldman , Jan Vondrak

We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…

Probability · Mathematics 2015-12-31 Aviad Rubinstein , Muli Safra

We study the $1$-level density and the pair correlation of zeros of quadratic Dirichlet $L$-functions in function fields, as we average over the ensemble $\mathcal{H}_{2g+1}$ of monic, square-free polynomials with coefficients in…

Number Theory · Mathematics 2016-05-24 Hung M. Bui , Alexandra Florea

Niederreiter [H.Niederreiter, Error bounds for quasi-Monte Carlo integration with uniform point sets, Journal of computational and applied mathematics 150 (2003), 283-292] established new bounds for quasi-Monte Carlo integration for nodes…

Number Theory · Mathematics 2010-12-01 Su Hu , Yan Li

In this paper, we construct some piecewise defined functions, and study their $c$-differential uniformity. As a by-product, we improve upon several prior results. Further, we look at concatenations of functions with low differential…

Information Theory · Computer Science 2021-12-07 Daniele Bartoli , Marco Calderini , Constanza Riera , Pantelimon Stanica

We investigate the approximability of several classes of real-valued functions by functions of a small number of variables ({\em juntas}). Our main results are tight bounds on the number of variables required to approximate a function…

Data Structures and Algorithms · Computer Science 2015-03-31 Vitaly Feldman , Jan Vondrak

Consider the problem of drawing random variates $(X_1,\ldots,X_n)$ from a distribution where the marginal of each $X_i$ is specified, as well as the correlation between every pair $X_i$ and $X_j$. For given marginals, the…

Probability · Mathematics 2016-12-30 Mark Huber , Nevena Maric

For $s \geq 0$ and a parameter $0 < \beta < 1$, the weak pair correlation function $f_{N,\beta}(s)$ for the first $N \in \mathbb{N}$ elements of a sequence $(x_n)_{n \in \mathbb{N}} \subset[0,1]$ is evidently non-decreasing in $s$.…

Number Theory · Mathematics 2026-04-28 Christian Weiß

We improve both upper and lower bounds for the distribution-free testing of monotone conjunctions. Given oracle access to an unknown Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ and sampling oracle access to an unknown distribution…

Discrete Mathematics · Computer Science 2015-11-12 Xi Chen , Jinyu Xie

Recently there has been much interest in Gowers uniformity norms from the perspective of theoretical computer science. This is mainly due to the fact that these norms provide a method for testing whether the maximum correlation of a…

Computational Complexity · Computer Science 2013-08-14 Hamed Hatami , Shachar Lovett

A bound for functional $\Delta(F)=\sup_{x\in\mathbb R}|F(x)-\Phi(x)|$ is obtained, which is uniform for all distribution functions $F$ of random variables with zero mean-value and unity variance. Moreover, a two-point distribution is found,…

Probability · Mathematics 2007-10-19 V. I. Chebotarev , A. S. Kondrik , K. V. Mikhaylov

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

Data Structures and Algorithms · Computer Science 2015-04-08 Ishay Haviv , Oded Regev

Let $\lambda$ denote the Liouville function. We show that as $X \rightarrow \infty$, $$ \int_{X}^{2X} \sup_{\alpha} \left | \sum_{x < n \leq x + H} \lambda(n) e(-\alpha n) \right | dx = o ( X H) $$ for all $H \geq X^{\theta}$ with $\theta >…

Number Theory · Mathematics 2018-12-05 Kaisa Matomäki , Maksym Radziwiłł , Terence Tao

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

We investigate Bose-Einstein condensation for interacting bosons at zero and nonzero temperature. Functional renormalization provides us with a consistent method to compute the effect of fluctuations beyond the Bogoliubov approximation. For…

Superconductivity · Physics 2009-01-28 S. Floerchinger , C. Wetterich

We show that if a closed discrete subset $A \subseteq \mathbf{R}^d$ is denser than a certain critical threshold, then $A$ is a Fourier uniqueness set, while if $A$ is sparser, then uniqueness fails and one can prescribe arbitrary values for…

Classical Analysis and ODEs · Mathematics 2023-06-14 Anshul Adve
‹ Prev 1 2 3 10 Next ›