English
Related papers

Related papers: An $\widetilde{O}(n)$ Queries Adaptive Tester for …

200 papers

In the problem of classical group testing one aims to identify a small subset (of size $d$) diseased individuals/defective items in a large population (of size $n$). This process is based on a minimal number of suitably-designed group tests…

Information Theory · Computer Science 2022-09-26 Xiwei Cheng , Sidharth Jaggi , Qiaoqiao Zhou

A Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is called a dictator if it depends on exactly one variable i.e $f(x_1, x_2, \ldots, x_n) = x_i$ for some $i\in [n]$. In this work, we study a $k$-query dictatorship test. Dictatorship…

Computational Complexity · Computer Science 2017-02-17 Amey Bhangale , Subhash Khot , Devanathan Thiruvenkatachari

A Boolean function $f:\{0,1\}^n \to \{0,1\}$ is said to be noise sensitive if inserting a small random error in its argument makes the value of the function almost unpredictable. Benjamini, Kalai and Schramm showed that if the sum of…

Combinatorics · Mathematics 2010-03-10 Nathan Keller , Guy Kindler

Outlier hypothesis testing is studied in a universal setting. Multiple sequences of observations are collected, a small subset of which are outliers. A sequence is considered an outlier if the observations in that sequence are distributed…

Information Theory · Computer Science 2014-04-02 Yun Li , Sirin Nitinawarat , Venugopal V. Veeravalli

In this work, we give the first algorithms for tolerant testing of nontrivial classes in the active model: estimating the distance of a target function to a hypothesis class C with respect to some arbitrary distribution D, using only a…

Machine Learning · Statistics 2017-11-02 Avrim Blum , Lunjia Hu

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

Let $X$ be a set of items of size $n$ , which may contain some defective items denoted by $I$, where $I \subseteq X$. In group testing, a {\it test} refers to a subset of items $Q \subset X$. The test outcome is $1$ (positive) if $Q$…

Data Structures and Algorithms · Computer Science 2023-09-19 Nader H. Bshouty , Gergely Harcos

We prove that the following problem is decidable: given a finite set of relations, decide whether this set admits a near-unanimity function.

Logic · Mathematics 2011-08-09 Dmitriy Zhuk

This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their…

We report an experimental realization of an adaptive quantum state tomography protocol. Our method takes advantage of a Bayesian approach to statistical inference and is naturally tailored for adaptive strategies. For pure states we observe…

The equivalence of the characteristic function approach and the probabilistic approach to monotone and boolean convolutions is proven for non-compactly supported probability measures. A probabilistically motivated definition of the…

Functional Analysis · Mathematics 2021-04-21 Uwe Franz

In this paper a new class of uniformity tests is proposed. It is shown that those tests are applicable to the cases of any simple null hypothesis as well as for the composite null hypothesis of rectangular distributions on arbitrary…

Methodology · Statistics 2018-08-21 Bojana Milošević

Understanding the query complexity for testing linear-invariant properties has been a central open problem in the study of algebraic property testing. Triangle-freeness in Boolean functions is a simple property whose testing complexity is…

Computational Complexity · Computer Science 2013-08-08 Hu Fu , Robert Kleinberg

We study distribution testing without direct access to a source of relevant data, but rather to one where only a tiny fraction is relevant. To enable this, we introduce the following verification query model. The goal is to perform a…

Data Structures and Algorithms · Computer Science 2025-09-23 Hadley Black , Christopher Ye

We study the problem of estimating the value of a known smooth function $f$ at an unknown point $\boldsymbol{\mu} \in \mathbb{R}^n$, where each component $\mu_i$ can be sampled via a noisy oracle. Sampling more frequently components of…

Machine Learning · Computer Science 2022-03-22 Tavor Z. Baharav , Gary Cheng , Mert Pilanci , David Tse

Given an i.i.d. sample drawn from a density $f$, we propose to test that $f$ equals some prescribed density $f_0$ or that $f$ belongs to some translation/scale family. We introduce a multiple testing procedure based on an estimation of the…

Statistics Theory · Mathematics 2016-08-16 Magalie Fromont , Béatrice Laurent

The framework of distribution testing is currently ubiquitous in the field of property testing. In this model, the input is a probability distribution accessible via independently drawn samples from an oracle. The testing task is to…

Data Structures and Algorithms · Computer Science 2022-09-22 Sourav Chakraborty , Eldar Fischer , Arijit Ghosh , Gopinath Mishra , Sayantan Sen

A natural problem in high-dimensional inference is to decide if a classifier $f:\mathbb{R}^n \rightarrow \{-1,1\}$ depends on a small number of linear directions of its input data. Call a function $g: \mathbb{R}^n \rightarrow \{-1,1\}$, a…

Computational Complexity · Computer Science 2021-01-14 Anindya De , Elchanan Mossel , Joe Neeman

The relative-error property testing model was introduced in [CDHLNSY24] to facilitate the study of property testing for "sparse" Boolean-valued functions, i.e. ones for which only a small fraction of all input assignments satisfy the…

Data Structures and Algorithms · Computer Science 2026-04-03 Xi Chen , Anindya De , Yizhi Huang , Shivam Nadimpalli , Rocco A. Servedio , Tianqi Yang

The role of symmetry in Boolean functions $f:\{0,1\}^n \to \{0,1\}$ has been extensively studied in complexity theory. For example, symmetric functions, that is, functions that are invariant under the action of $S_n$, is an important class…

Computational Complexity · Computer Science 2025-10-01 Sourav Chakraborty , Chandrima Kayal , Manaswi Paraashar
‹ Prev 1 8 9 10 Next ›