English
Related papers

Related papers: Low-Degree Fourier Threshold for Random Boolean Fu…

200 papers

We show that for a uniformly irreducible random walk on a graph, with bounded range, there is a Floyd function for which the random walk converges to its corresponding Floyd boundary. Moreover if we add the assumptions, $p^{(n)}(v,w)\leq C…

Probability · Mathematics 2021-04-29 Panagiotis Spanos

We prove lower bounds on the complexity of finding $\epsilon$-stationary points (points $x$ such that $\|\nabla f(x)\| \le \epsilon$) of smooth, high-dimensional, and potentially non-convex functions $f$. We consider oracle-based complexity…

Optimization and Control · Mathematics 2019-08-16 Yair Carmon , John C. Duchi , Oliver Hinder , Aaron Sidford

In this paper we investigate the uniform distribution properties of polynomials in many variables and bounded degree over a fixed finite field F of prime order. Our main result is that a polynomial P : F^n -> F is poorly-distributed only if…

Combinatorics · Mathematics 2007-11-21 Ben Green , Terence Tao

It is well known that the entropy $H(X)$ of a discrete random variable $X$ is always greater than or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tight…

Information Theory · Computer Science 2017-12-22 Ferdinando Cicalese , Luisa Gargano , Ugo Vaccaro

This paper describes a purely functional library for computing level-$p$-complexity of Boolean functions, and applies it to two-level iterated majority. Boolean functions are simply functions from $n$ bits to one bit, and they can describe…

Programming Languages · Computer Science 2023-12-13 Julia Jansson , Patrik Jansson

We establish lower bounds on the complexity of finding $\epsilon$-stationary points of smooth, non-convex high-dimensional functions using first-order methods. We prove that deterministic first-order methods, even applied to arbitrarily…

Optimization and Control · Mathematics 2017-11-03 Yair Carmon , John C. Duchi , Oliver Hinder , Aaron Sidford

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

We define the pivotal set of a Boolean function and we prove a fundamental inequality on its expected size, when the inputs are independent random coins of parameter~$p$. We give two complete proofs of this inequality. Along the way, we…

Probability · Mathematics 2024-05-31 Raphaël Cerf

Say $X_1,X_2,\ldots$ are independent identically distributed Bernoulli random variables with mean $p$. This paper builds a new estimate $\hat p$ of $p$ that has the property that the relative error, $\hat p /p - 1$, of the estimate does not…

Statistics Theory · Mathematics 2015-11-18 Mark Huber

We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \emph{arbitrary} critical density cannot be…

Computational Complexity · Computer Science 2024-07-17 David Gamarnik , Elchanan Mossel , Ilias Zadik

We study the $\textit{average-case deterministic query complexity}$ of boolean functions under a $\textit{uniform input distribution}$, denoted by $\mathrm{D}_\mathrm{ave}(f)$, the minimum average depth of zero-error decision trees that…

Computational Complexity · Computer Science 2025-06-12 Yuan Li , Haowei Wu , Yi Yang

We prove a weak-$L^p$ bound for the Walsh-Carleson operator for $p $ near 1, improving on a theorem of Sjolin. We relate our result to the conjectures that the Walsh-Fourier and Fourier series of a function $f\in L\log L(\mathbb T)$…

Classical Analysis and ODEs · Mathematics 2014-03-25 Francesco Di Plinio

We analyze the Fourier growth, i.e. the $L_1$ Fourier weight at level $k$ (denoted $L_{1,k}$), of various well-studied classes of "structured" $\mathbb{F}_2$-polynomials. This study is motivated by applications in pseudorandomness, in…

Computational Complexity · Computer Science 2024-10-15 Jarosław Błasiok , Peter Ivanov , Yaonan Jin , Chin Ho Lee , Rocco A. Servedio , Emanuele Viola

Let $k\leq n$. Each polynomial $p\in\oR[x_1,...,x_n]$ can be uniquely written as $p=\sum_{\mu}\mu p_{\mu}$, where $\mu$ ranges over the set $M$ of all monomials in $\oR[x_1,...,x_k]$ and where $p_{\mu}\in\oR[x_{k+1},...,x_n]$. If $p$ is…

Combinatorics · Mathematics 2012-11-16 Alexander Schrijver

We compute the one-level density for the family of cubic Dirichlet $L$-functions when the support of the Fourier transform of a test function is in $(-1,1)$. We also establish the Ratios conjecture prediction for the one-level density for…

Number Theory · Mathematics 2019-01-23 Peter J. Cho , Jeongho Park

We prove that, given $2<p<\infty$, the Fourier coefficients of functions in $L_2(\mathbb{T}, \lvert t \rvert^{1-2/p}\, dt)$ belong to $\ell_p$, and that, given $1<p<2$, the Fourier series of sequences in $\ell_p$ belong $L_2(\mathbb{T},…

Functional Analysis · Mathematics 2021-09-21 Jose L. Ansorena

We find asymptotic equalities for the exact upper bounds of approximations by Fourier sums of Weyl-Nagy classes $W^r_{\beta,p}, 1\le p\le\infty,$ for rapidly growing exponents of smoothness $r$ $(r/n\rightarrow\infty)$ in the uniform…

Classical Analysis and ODEs · Mathematics 2019-06-07 A. S. Serdyuk , I. V. Sokolenko

We consider Gaussian signals, i.e. random functions $u(t)$ ($t/L \in [0,1]$) with independent Gaussian Fourier modes of variance $\sim 1/q^{\alpha}$, and compute their statistical properties in small windows $[x, x+\delta]$. We determine…

Disordered Systems and Neural Networks · Physics 2010-09-16 Alberto Rosso , Raoul Santachiara , Werner Krauth

We give a non-adaptive algorithm that makes $2^{\tilde{O}(\sqrt{k\log(1/\varepsilon_2 - \varepsilon_1)})}$ queries to a Boolean function $f:\{\pm 1\}^n \rightarrow \{\pm 1\}$ and distinguishes between $f$ being $\varepsilon_1$-close to some…

Data Structures and Algorithms · Computer Science 2024-04-23 Shivam Nadimpalli , Shyamal Patel

We find a formula, in terms of n, d and p, for the value of the F-pure threshold for the generic homogeneous polynomial of degree d in n variables over an algebraically closed field of characteristic p. We also show that, in every…

Commutative Algebra · Mathematics 2022-07-26 Karen E. Smith , Adela Vraciu