English
Related papers

Related papers: Distribution-Free Testing of Linear Functions on R…

200 papers

We study the problem of testing whether a function $f: \mathbb{R}^n \to \mathbb{R}$ is a polynomial of degree at most $d$ in the \emph{distribution-free} testing model. Here, the distance between functions is measured with respect to an…

Data Structures and Algorithms · Computer Science 2022-04-19 Vipul Arora , Arnab Bhattacharyya , Noah Fleming , Esty Kelman , Yuichi Yoshida

Call a function f : F_2^n -> {0,1} odd-cycle-free if there are no x_1, ..., x_k in F_2^n with k an odd integer such that f(x_1) = ... = f(x_k) = 1 and x_1 + ... + x_k = 0. We show that one can distinguish odd-cycle-free functions from those…

Data Structures and Algorithms · Computer Science 2012-07-16 Arnab Bhattacharyya , Elena Grigorescu , Prasad Raghavendra , Asaf Shapira

We consider linear models with scalar responses and covariates from a separable Hilbert space. The aim is to detect change points in the error distribution, based on sequential residual empirical distribution functions. Expansions for those…

Statistics Theory · Mathematics 2024-11-08 Natalie Neumeyer , Leonie Selk

A Boolean function $f:\{0,1\}^n\to \{0,1\}$ is $k$-linear if it returns the sum (over the binary field $F_2$) of $k$ coordinates of the input. In this paper, we study property testing of the classes $k$-Linear, the class of all $k$-linear…

Computational Complexity · Computer Science 2020-06-09 Nader H. Bshouty

We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the…

Computational Complexity · Computer Science 2019-08-08 Aleksandrs Belovs , Eric Blais , Abhinav Bommireddi

We consider the error distribution in functional linear models with scalar response and functional covariate. Different asymptotic expansions of the empirical distribution function and the empirical characteristic function based on…

Methodology · Statistics 2025-12-01 Natalie Neumeyer , Leonie Selk

We study the problem of testing whether an unknown $n$-variable Boolean function is a $k$-junta in the distribution-free property testing model, where the distance between functions is measured with respect to an arbitrary and unknown…

Computational Complexity · Computer Science 2018-02-15 Xi Chen , Zhengyang Liu , Rocco A. Servedio , Ying Sheng , Jinyu Xie

Motivated by the fact that input distributions are often unknown in advance, distribution-free property testing considers a setting where the algorithmic task is to accept functions $f : [n] \to \{0,1\}$ with a certain property P and reject…

Computational Complexity · Computer Science 2024-02-19 Hugo Aaronson , Tom Gur , Ninad Rajgopal , Ron D. Rothblum

We present an algorithm for testing halfspaces over arbitrary, unknown rotation-invariant distributions. Using $\tilde O(\sqrt{n}\epsilon^{-7})$ random examples of an unknown function $f$, the algorithm determines with high probability…

Data Structures and Algorithms · Computer Science 2018-11-02 Nathaniel Harms

We consider the problem of testing whether an unknown $n$-variable Boolean function is a $k$-junta in the distribution-free property testing model, where the distance between function is measured with respect to an arbitrary and unknown…

Data Structures and Algorithms · Computer Science 2020-06-09 Nader H. Bshouty

A Boolean function $f:\{0,1\}^n \mapsto \{0,1\}$ is said to be $\eps$-far from monotone if $f$ needs to be modified in at least $\eps$-fraction of the points to make it monotone. We design a randomized tester that is given oracle access to…

Discrete Mathematics · Computer Science 2014-01-14 Deeparnab Chakrabarty , C. Seshadhri

Over the last three decades, function testing has been extensively studied over Boolean, finite fields, and discrete settings. However, to encode the real-world applications more succinctly, function testing over the reals (where the domain…

Data Structures and Algorithms · Computer Science 2026-03-31 Vipul Arora , Arnab Bhattacharyya , Philips George John , Sayantan Sen

We give a distribution-free testing algorithm for decision lists with $\tilde{O}(n^{11/12}/\varepsilon^3)$ queries. This is the first sublinear algorithm for this problem, which shows that, unlike halfspaces, testing is strictly easier than…

Data Structures and Algorithms · Computer Science 2024-04-18 Xi Chen , Yumou Fei , Shyamal Patel

We examine the extent to which sublinear-sample property testing and estimation apply to settings where samples are independently but not identically distributed. Specifically, we consider the following distributional property testing…

Data Structures and Algorithms · Computer Science 2025-11-05 Shivam Garg , Chirag Pabbaraju , Kirankumar Shiragur , Gregory Valiant

We propose a procedure for testing the linearity of a scalar-on-function regression relationship. To do so, we use the functional generalized additive model (FGAM), a recently developed extension of the functional linear model. For a…

Methodology · Statistics 2014-04-24 Mathew W. McLean , Giles Hooker , David Ruppert

Recently a distribution free approach for testing parametric hypotheses based on unitary transformations has been suggested in \cite{Khm13, Khm16, Khm17} and further studied in \cite{Ngu17} and \cite{Rob19}. In this note we show that the…

Methodology · Statistics 2020-02-10 Estate V. Khmaladze

The Huge Object model is a distribution testing model in which we are given access to independent samples from an unknown distribution over the set of strings $\{0,1\}^n$, but are only allowed to query a few bits from the samples. We…

Data Structures and Algorithms · Computer Science 2024-09-18 Tomer Adar , Eldar Fischer , Amit Levi

Uniformity testing is arguably one of the most fundamental distribution testing problems. Given sample access to an unknown distribution $\mathbf{p}$ on $[n]$, one must decide if $\mathbf{p}$ is uniform or $\varepsilon$-far from uniform (in…

Machine Learning · Statistics 2024-10-16 Sihan Liu , Christopher Ye

Given samples from an unknown multivariate distribution $p$, is it possible to distinguish whether $p$ is the product of its marginals versus $p$ being far from every product distribution? Similarly, is it possible to distinguish whether…

Data Structures and Algorithms · Computer Science 2019-07-12 Constantinos Daskalakis , Nishanth Dikkala , Gautam Kamath

Given Boolean functions \( f, g : \mathbb{F}_2^n \to \{-1,+1\} \), we say they are {\em linearly isomorphic} if there exists \( A \in \mathrm{GL}_n(\mathbb{F}_2) \) such that \( f(x)=g(Ax) \) for all \( x \). We study this problem in the…

Computational Complexity · Computer Science 2026-01-14 Swarnalipa Datta , Arijit Ghosh , Chandrima Kayal , Manaswi Paraashar , Manmatha Roy
‹ Prev 1 2 3 10 Next ›