On the Optimal Bounds for Noisy Computing

by   Banghua Zhu, et al.

We revisit the problem of computing with noisy information considered in Feige et al. 1994, which includes computing the OR function from noisy queries, and computing the MAX, SEARCH and SORT functions from noisy pairwise comparisons. For K given elements, the goal is to correctly recover the desired function with probability at least 1-δ when the outcome of each query is flipped with probability p. We consider both the adaptive sampling setting where each query can be adaptively designed based on past outcomes, and the non-adaptive sampling setting where the query cannot depend on past outcomes. The prior work provides tight bounds on the worst-case query complexity in terms of the dependence on K. However, the upper and lower bounds do not match in terms of the dependence on δ and p. We improve the lower bounds for all the four functions under both adaptive and non-adaptive query models. Most of our lower bounds match the upper bounds up to constant factors when either p or δ is bounded away from 0, while the ratio between the best prior upper and lower bounds goes to infinity when p→ 0 or p→ 1/2. On the other hand, we also provide matching upper and lower bounds for the number of queries in expectation, improving both the upper and lower bounds for the variable-length query model.


page 1

page 2

page 3

page 4


Noisy Computing of the 𝖮𝖱 and 𝖬𝖠𝖷 Functions

We consider the problem of computing a function of n variables using noi...

Optimal Query Complexities for Dynamic Trace Estimation

We consider the problem of minimizing the number of matrix-vector querie...

The Query Complexity of Mastermind with ℓ_p Distances

Consider a variant of the Mastermind game in which queries are ℓ_p dista...

Better Sum Estimation via Weighted Sampling

Given a large set U where each item a∈ U has weight w(a), we want to est...

Discriminative Learning via Adaptive Questioning

We consider the problem of designing an adaptive sequence of questions t...

Order-Optimal Error Bounds for Noisy Kernel-Based Bayesian Quadrature

In this paper, we study the sample complexity of noisy Bayesian quadratu...

Nearly Optimal Algorithms for Level Set Estimation

The level set estimation problem seeks to find all points in a domain X ...

Please sign up or login with your details

Forgot password? Click here to reset