English
Related papers

Related papers: Correlation Testing for Affine Invariant Propertie…

200 papers

Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…

Computational Complexity · Computer Science 2013-01-18 Arnab Bhattacharyya , Eldar Fischer , Hamed Hatami , Pooya Hatami , Shachar Lovett

Let $\{f_i:\mathbb{F}_p^i \to \{0,1\}\}$ be a sequence of functions, where $p$ is a fixed prime and $\mathbb{F}_p$ is the finite field of order $p$. The limit of the sequence can be syntactically defined using the notion of ultralimit.…

Computational Complexity · Computer Science 2015-03-27 Yuichi Yoshida

Let $\mathcal{P}$ be a property of function $\mathbb{F}_p^n \to \{0,1\}$ for a fixed prime $p$. An algorithm is called a tester for $\mathcal{P}$ if, given a query access to the input function $f$, with high probability, it accepts when $f$…

Computational Complexity · Computer Science 2014-02-11 Yuichi Yoshida

Invariance with respect to linear or affine transformations of the domain is arguably the most common symmetry exhibited by natural algebraic properties. In this work, we show that any low complexity affine-invariant property of…

Computational Complexity · Computer Science 2012-10-09 Arnab Bhattacharyya , Eldar Fischer , Shachar Lovett

We consider the problem of testing if a given function f : F_2^n -> F_2 is close to any degree d polynomial in n variables, also known as the Reed-Muller testing problem. The Gowers norm is based on a natural 2^{d+1}-query test for this…

Combinatorics · Mathematics 2010-04-12 Arnab Bhattacharyya , Swastik Kopparty , Grant Schoenebeck , Madhu Sudan , David Zuckerman

Gowers introduced, for d\geq 1, the notion of dimension-d uniformity U^d(f) of a function f: G -> \C, where G is a finite abelian group and \C are the complex numbers. Roughly speaking, if U^d(f) is small, then f has certain…

Combinatorics · Mathematics 2007-05-23 Alex Samorodnitsky , Luca Trevisan

Let $\cal{P}$ be an affine invariant property of functions $\mathbb{F}_p^n \to [R]$ for fixed $p$ and $R$. We show that if $\cal{P}$ is locally testable with a constant number of queries, then one can estimate the distance of a function $f$…

Computational Complexity · Computer Science 2013-06-05 Hamed Hatami , Shachar Lovett

Fix a prime $p$ and a positive integer $R$. We study the property testing of functions $\mathbb F_p^n\to[R]$. We say that a property is testable if there exists an oblivious tester for this property with one-sided error and constant query…

Combinatorics · Mathematics 2022-08-24 Jonathan Tidor , Yufei Zhao

We establish the \emph{inverse conjecture for the Gowers norm over finite fields}, which asserts (roughly speaking) that if a bounded function $f: V \to \C$ on a finite-dimensional vector space $V$ over a finite field $\F$ has large Gowers…

Combinatorics · Mathematics 2011-09-09 Terence Tao , Tamar Ziegler

Let $p$ be a fixed prime number, and $N$ be a large integer. The 'Inverse Conjecture for the Gowers norm' states that if the "$d$-th Gowers norm" of a function $f:\F_p^N \to \F_p$ is non-negligible, that is larger than a constant…

Combinatorics · Mathematics 2008-10-20 Shachar Lovett , Roy Meshulam , Alex Samorodnitsky

The \emph{Gowers uniformity norms} $\|f\|_{U^k(G)}$ of a function $f: G \to \C$ on a finite additive group $G$, together with the slight variant $\|f\|_{U^k([N])}$ defined for functions on a discrete interval $[N] := \{1,...,N\}$, are of…

Combinatorics · Mathematics 2011-06-28 Tanja Eisner , Terence Tao

Correlated observations are ubiquitous phenomena in a plethora of scientific avenues. Tackling this dependence among test statistics has been one of the pertinent problems in simultaneous inference. However, very little literature exists…

Statistics Theory · Mathematics 2024-11-20 Monitirtha Dey

Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions which are far from linear. Linearity tests were first…

Computational Complexity · Computer Science 2008-02-21 Shachar Lovett

Property testers are fast randomized algorithms whose task is to distinguish between inputs satisfying some predetermined property ${\cal P}$ and those that are far from satisfying it. Since these algorithms operate by inspecting a small…

Combinatorics · Mathematics 2020-11-23 Lior Gishboliner , Asaf Shapira , Henrique Stagni

We study property testing of properties that are definable in first-order logic (FO) in the bounded-degree graph and relational structure models. We show that any FO property that is defined by a formula with quantifier prefix…

Logic in Computer Science · Computer Science 2023-04-11 Isolde Adler , Noleen Köhler , Pan Peng

Multiple hypothesis testing is a fundamental problem in high dimensional inference, with wide applications in many scientific fields. In genome-wide association studies, tens of thousands of tests are performed simultaneously to find if any…

Methodology · Statistics 2011-11-16 Jianqing Fan , Xu Han , Weijie Gu

The problem of detecting changes in covariance for a single pair of features has been studied in some detail, but may be limited in importance or general applicability. In contrast, testing equality of covariance matrices of a {\it set} of…

Methodology · Statistics 2017-12-12 Yi-Hui Zhou

The proposed Goodness--of--Fit (GoF) test for checking the linear autocorrelation model in a functional time series is based on an empirical process, whose residual marks and covariate index set are in a separable Hilbert space \mathbb{H}.…

Statistics Theory · Mathematics 2026-05-29 W. González-Manteiga , M. D. Ruiz-Medina , M. Febrero-Bande

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

We prove that the most natural low-degree test for polynomials over finite fields is ``robust'' in the high-error regime for linear-sized fields. Specifically we consider the ``local'' agreement of a function $f: \mathbb{F}_q^m \to…

Computational Complexity · Computer Science 2023-11-22 Prahladh Harsha , Mrinal Kumar , Ramprasad Saptharishi , Madhu Sudan
‹ Prev 1 2 3 10 Next ›