Related papers: Decision trees and influences of variables over pr…

It was conjectured that if $f\in C^1(\mathbb{R}^n,\mathbb{R}^n)$ satisfies $\operatorname{rank} Df\leq m<n$ everywhere in $\mathbb{R}^n$, then $f$ can be uniformly approximated by $C^\infty$-mappings $g$ satisfying $\operatorname{rank}…

The influence theorem for product measures on the discrete space {0,1}^N may be extended to probability measures with the property of monotonicity (which is equivalent to `strong positive-association'). Corresponding results are valid for…

In this paper, we prove that the Fourier entropy of an $n$-dimensional boolean function $f$ can be upper-bounded by $O(I(f)+ \sum\limits_{k\in[n]}I_k(f)\log \frac{1}{I_k(f)})$, where $I(f)$ is its total influence and $I_k(f)$ is the…

Given a function f: [a,b] -> R, if f(a) < 0 and f(b)> 0 and f is continuous, the Intermediate Value Theorem implies that f has a root in [a,b]. Moreover, given a value-oracle for f, an approximate root of f can be computed using the…

We show tight upper and lower bounds for switching lemmas obtained by the action of random $p$-restrictions on boolean functions that can be expressed as decision trees in which every vertex is at a distance of at most $t$ from some leaf,…

The approximate non-deterministic degree of a Boolean function $f$, denoted $\mathsf{ndeg}_\epsilon(f)$ (written $\mathsf{N}_\epsilon(f)$ for brevity), is the minimum degree of a real polynomial $p$ such that $0 \le |p(x)| \le \epsilon$…

We establish two new direct product theorems for the randomized query complexity of Boolean functions. The first shows that computing $n$ copies of a function $f$, even with a small success probability of $\gamma^n$, requires $\Theta(n)$…

We give the first algorithm that maintains an approximate decision tree over an arbitrary sequence of insertions and deletions of labeled examples, with strong guarantees on the worst-case running time per update request. For instance, we…

The Friedgut--Kalai--Naor theorem states that if a Boolean function $f\colon \{0,1\}^n \to \{0,1\}$ is close (in $L^2$-distance) to an affine function $\ell(x_1,...,x_n) = c_0 + \sum_i c_i x_i$, then $f$ is close to a Boolean affine…

Let $f\colon \{-1,1\}^n \to [-1,1]$ have degree $d$ as a multilinear polynomial. It is well-known that the total influence of $f$ is at most $d$. Aaronson and Ambainis asked whether the total $L_1$ influence of $f$ can also be bounded as a…

We explore a generating function trick which allows us to keep track of infinitely many statistics using finitely many variables, by recording their individual distributions rather than their joint distributions. Building on previous work…

Given a real valued and time-inhomogeneous martingale diffusion X, we investigate the properties of functions defined by the conditional expectation f(t,X_t)=E[g(X_T)|F_t]. We show that whenever g is monotonic or Lipschitz continuous then…

In the decision tree computation model for Boolean functions, the depth corresponds to query complexity, and size corresponds to storage space. The depth measure is the most well-studied one, and is known to be polynomially related to…

The sensitivity of a Boolean function f is the maximum over all inputs x, of the number of sensitive coordinates of x. The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean…

The influence of a variable is an important concept in the analysis of Boolean functions. The more general notion of influence of a set of variables on a Boolean function has four separate definitions in the literature. In the present work,…

In an attempt to show that the acceptance probability of a quantum query algorithm making $q$ queries can be well-approximated almost everywhere by a classical decision tree of depth $\leq \text{poly}(q)$, Aaronson and Ambainis proposed the…

This paper axiomatizes, in a two-stage setup, a new theory for decision under risk and ambiguity. The axiomatized preference relation $\succeq$ on the space $\tilde{V}$ of random variables induces an ambiguity index $c$ on the space…

The aim of this expository article is to present recent developments in the centuries old discussion on the interrelations between continuous and differentiable real valued functions of one real variable. The truly new results include,…

Let $[a,b]\subset\mathbb{R}$ be a non empty and non singleton closed interval and $P=\{a=x_0<\cdots<x_n=b\}$ is a partition of it. Then $f:I\to\mathbb{R}$ is said to be a function of $r$-bounded variation, if the expression…

We study the complexity of approximate representation and learning of submodular functions over the uniform distribution on the Boolean hypercube $\{0,1\}^n$. Our main result is the following structural theorem: any submodular function is…