Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem

08/07/2022
by   Lisa Hellerstein, et al.
0

We consider the Stochastic Boolean Function Evaluation (SBFE) problem where the task is to efficiently evaluate a known Boolean function f on an unknown bit string x of length n. We determine f(x) by sequentially testing the variables of x, each of which is associated with a cost of testing and an independent probability of being true. If a strategy for solving the problem is adaptive in the sense that its next test can depend on the outcomes of previous tests, it has lower expected cost but may take up to exponential space to store. In contrast, a non-adaptive strategy may have higher expected cost but can be stored in linear space and benefit from parallel resources. The adaptivity gap, the ratio between the expected cost of the optimal non-adaptive and adaptive strategies, is a measure of the benefit of adaptivity. We present lower bounds on the adaptivity gap for the SBFE problem for popular classes of Boolean functions, including read-once DNF formulas, read-once formulas, and general DNFs. Our bounds range from Ω(log n) to Ω(n/log n), contrasting with recent O(1) gaps shown for symmetric functions and linear threshold functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/16/2021

The Stochastic Boolean Function Evaluation Problem for Symmetric Boolean Functions

We give two approximation algorithms solving the Stochastic Boolean Func...
research
02/04/2019

(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing

Consider a kidney-exchange application where we want to find a max-match...
research
05/24/2018

Linear read-once and related Boolean functions

It is known that a positive Boolean function f depending on n variables ...
research
12/15/2017

Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps

The well-known Sensitivity Conjecture states that for any Boolean funct...
research
07/26/2023

Reliability Analysis of a Multi-State Truly-Threshold System Using a Multi-Valued Karnaugh Map

This paper deals with the Boolean-based analysis of a prominent class of...
research
01/09/2018

Adaptive Boolean Monotonicity Testing in Total Influence Time

The problem of testing monotonicity of a Boolean function f:{0,1}^n →{0,...
research
09/11/2013

Decision Trees for Function Evaluation - Simultaneous Optimization of Worst and Expected Cost

In several applications of automatic diagnosis and active learning a cen...

Please sign up or login with your details

Forgot password? Click here to reset