English
Related papers

Related papers: Low Soundness Linearity Testing on the Half-Slice

200 papers

New results regarding the Sobolev regularity of the principal solution of the linear Beltrami equation $\bar{\partial} f = \mu \partial f + \nu \overline{\partial f}$ for discontinuous Beltrami coefficients $\mu$ and $\nu$ are obtained,…

Analysis of PDEs · Mathematics 2017-02-02 Martí Prats

Suppose $X$ is a uniformly distributed $n$-dimensional binary vector and $Y$ is obtained by passing $X$ through a binary symmetric channel with crossover probability $\alpha$. A recent conjecture by Courtade and Kumar postulates that…

Information Theory · Computer Science 2015-06-02 Or Ordentlich , Ofer Shayevitz , Omri Weinstein

We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of polynomial threshold functions. More specifically, for a Boolean function f on n variables equal to the sign of a real, multivariate polynomial…

Computational Complexity · Computer Science 2014-03-28 Prahladh Harsha , Adam Klivans , Raghu Meka

A halfspace is a function $f\colon\{-1,1\}^n \rightarrow \{0,1\}$ of the form $f(x)=\mathbb{1}(a\cdot x>t)$, where $\sum_i a_i^2=1$. We show that if $f$ is a halfspace with $\mathbb{E}[f]=\epsilon$ and $a'=\max_i |a_i|$, then the degree-1…

Combinatorics · Mathematics 2019-09-26 Nathan Keller , Ohad Klein

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 study the almost sure behavior of solutions of stochastic differential equations (SDEs) as time goes to zero. Our main general result establishes a functional law of the iterated logarithm (LIL) that applies in the setting of SDEs with…

Probability · Mathematics 2021-06-28 Marco Carfagnini , Juraj Foldes , David P. Herzog

We consider the task of locally correcting, and locally list-correcting, multivariate linear functions over the domain $\{0,1\}^n$ over arbitrary fields and more generally Abelian groups. Such functions form error-correcting codes of…

Computational Complexity · Computer Science 2024-04-29 Prashanth Amireddy , Amik Raj Behera , Manaswi Paraashar , Srikanth Srinivasan , Madhu Sudan

In this paper, we prove uniform bounds for $\rm GL (3)\times GL(2)$ $L$-functions in the $\rm GL(2)$ spectral aspect and the $t$ aspect by a delta method. More precisely, let $\phi$ be a Hecke--Maass cusp form for $\rm SL(3,\mathbb{Z})$ and…

Number Theory · Mathematics 2022-01-03 Bingrong Huang

The Nyman-Beurling criterion, equivalent to the Riemann hypothesis (RH), is an approximation problem in the space of square integrable functions on $(0,\infty)$, involving dilations of the fractional part function by factors…

Functional Analysis · Mathematics 2022-06-02 François Alouges , Sébastien Darses , Erwan Hillion

Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…

Computational Complexity · Computer Science 2021-07-08 Srikanth Srinivasan , S. Venkitesh

Let $(\mathfrak{M},\rho,\mu)$ be a metric measure space satisfying a doubling condition, $p_0\in (1,\infty)$, and $T(t):L^{p_0}(\mathfrak{M},\mu)\rightarrow L^{p_0}(\mathfrak{M},\mu)$, $t\geq 0$, a strongly continuous semi-group. We provide…

Analysis of PDEs · Mathematics 2026-01-13 Brian Street

In this paper we are interested on solvability of the problem \begin{align*} \begin{cases} -\Delta u=0 & \text{in} \;\;\;\mathbb{R}^{n+1}_{+}\;\;\;\;\;\;\;\;\;\\ \;\;\displaystyle{\frac{\partial u}{\partial \nu}} = V(x)u+b \vert…

Analysis of PDEs · Mathematics 2021-04-27 Marcelo F. de Almeida , Lidiane S. M. Lima

Let a Boolean function be available as a black-box (oracle) and one likes to devise an algorithm to test whether it has certain property or it is $\epsilon$-far from having that property. The efficiency of the algorithm is judged by the…

Quantum Physics · Physics 2013-06-27 Kaushik Chakraborty , Subhamoy Maitra

Let $\{\lambda_f(n)\}_{n \geq 1}$ be the normalized Hecke eigenvalues of a given holomorphic cusp form $f$ of even weight $k$. We show under the assumption of the existence of Littlewood's type zero free region for $L(s, f, \chi)$, where…

Number Theory · Mathematics 2025-11-14 Jiseong Kim , Kunjakanan Nath

Items in a test are often used as a basis for making decisions and such tests are therefore required to have good psychometric properties, like unidimensionality. In many cases the sum score is used in combination with a threshold to decide…

Methodology · Statistics 2020-07-14 Lourens Waldorp , Maarten Marsman , Denny Borsboom

We prove that the Fourier dimension of any Boolean function with Fourier sparsity $s$ is at most $O\left(s^{2/3}\right)$. Our proof method yields an improved bound of $\widetilde{O}(\sqrt{s})$ assuming a conjecture of…

Computational Complexity · Computer Science 2014-07-15 Swagato Sanyal

Variable selection in linear models plays a pivotal role in modern statistics. Hard-thresholding methods such as $l_0$ regularization are theoretically ideal but computationally infeasible. In this paper, we propose a new approach, called…

Machine Learning · Statistics 2015-03-20 Kun Yang

We prove that for certain positive operators $T$, such as the Hardy-Littlewood maximal function and fractional integrals, there is a constant $D>1$, depending only on the dimension $n$, such that the two weight norm inequality…

Classical Analysis and ODEs · Mathematics 2019-09-13 Tuomas P. Hytönen , Kangwei Li , Eric T. Sawyer

We study functions on the infinite-dimensional Hamming cube $\{-1,1\}^\infty$, in particular Boolean functions into $\{-1,1\}$, generalising results on analysis of Boolean functions on $\{-1,1\}^n$ for $n\in\mathbb{N}$. The notion of noise…

Probability · Mathematics 2019-06-11 Vilhelm Agdur

Sparse linear regression (SLR) is a well-studied problem in statistics where one is given a design matrix $X\in\mathbb{R}^{m\times n}$ and a response vector $y=X\theta^*+w$ for a $k$-sparse vector $\theta^*$ (that is, $\|\theta^*\|_0\leq…

Machine Learning · Computer Science 2025-02-06 Aparna Gupte , Neekon Vafa , Vinod Vaikuntanathan