# Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem

arXiv: https://arxiv.org/abs/2208.03810 · HTML: https://mlsanity.com/paper/2208.03810/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Aug 2022.

## Built on by (most cited first, 1 of 1)

- [Drafting Agents, Not Just Tokens: Speculative Recursive Self-Improvement for Agentic Systems](https://mlsanity.com/paper/2610.16491/) (2026)

## Abstract (arXiv)

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 Omega(log n) to Omega(n/log n), contrasting with recent O(1) gaps shown for symmetric functions and linear threshold functions.