相关论文: On Shapley Values and Threshold Intervals

This manuscript includes some classical results we select apart from the new results we've found on the Analysis of Boolean Functions and Fourier-Entropy-Influence conjecture. We try to ensure the self-completeness of this work so that…

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…

Consider a monotone Boolean function $f:\{0,1\}^n\to\{0,1\}$ and the canonical monotone coupling $\{\eta_p:p\in[0,1]\}$ of an element in $\{0,1\}^n$ chosen according to product measure with intensity $p\in[0,1]$. The random point…

We study the probability of Boolean functions with small max influence to become constant under random restrictions. Let $f$ be a Boolean function such that the variance of $f$ is $\Omega(1)$ and all its individual influences are bounded by…

A key fact in the theory of Boolean functions $f : \{0,1\}^n \to \{0,1\}$ is that they often undergo sharp thresholds. For example: if the function $f : \{0,1\}^n \to \{0,1\}$ is monotone and symmetric under a transitive action with…

The problem of testing monotonicity of a Boolean function $f:\{0,1\}^n \to \{0,1\}$ has received much attention recently. Denoting the proximity parameter by $\varepsilon$, the best tester is the non-adaptive…

For a given graph $G$ of minimum degree at least $k$, let $G_p$ denote the random spanning subgraph of $G$ obtained by retaining each edge independently with probability $p=p(k)$. We prove that if $p \ge \frac{\log k + \log \log k +…

Threshold phenomena are investigated using a general approach, following Talagrand [Ann. Probab. 22 (1994) 1576--1587] and Friedgut and Kalai [Proc. Amer. Math. Soc. 12 (1999) 1017--1054]. The general upper bound for the threshold width of…

We study the problem of estimating a monotone function $f:\{0,1\}^d\to[0,1]$ from noisy observations at uniformly random vertices of the Boolean hypercube. As a measure of complexity for the target~$f$, we use the total $L^1$-influence…

Let $\Psi_m^D$ be orthogonal Daubechies wavelets that have m zero moments and let $$ W_{2,p}^k=\{f \in L_2(R):\|(I \omega)^k\hat f(\omega)\|_p\leq 1\}, \, k \in N. $$ We prove that $$ \lim_{m \to \infty}\,…

Let $\mathsf{TH}_k$ denote the $k$-out-of-$n$ threshold function: given $n$ input Boolean variables, the output is $1$ if and only if at least $k$ of the inputs are $1$. We consider the problem of computing the $\mathsf{TH}_k$ function…

The {\em Total Influence} ({\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \ifnum\plusminus=1 $f: \{\pm1\}^n…

For $S \subseteq \{0,1\}^n$ a Boolean function $f \colon S \to \{-1,1\}$ is a polynomial threshold function (PTF) of degree $d$ and weight $W$ if there is a polynomial $p$ with integer coefficients of degree $d$ and with sum of absolute…

Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…

Let $[q] = \{0,1,\ldots,q-1\}$, let $\Delta[q]$ denote the simplex of probability measures on $[q]$, and let $\gamma$ denote the Lebesgue measure normalized on $\Delta[q]$. We prove that for any symmetric monotone function $f \colon[q]^n…

We study whether a uniformly random Boolean function $f : \{-1,1\}^p \to \{-1,1\}$ is determined by its Walsh--Fourier coefficients of degree at most $d$. We show that the threshold lies at $p/2$ up to an $O(\sqrt{p \log p})$ window: if \[…

Shapley values are one of the main tools used to explain predictions of tree ensemble models. The main alternative to Shapley values are Banzhaf values that have not been understood equally well. In this paper we make a step towards filling…

We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…

We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of polynomial threshold functions. More specifically, for a Boolean function f on n variables equal to the sign of a real, multivariate polynomial…

Let $T_{k}$ be the expanding map of $[0,1)$ defined by $T_{k}(x) = k x\ \text{mod 1}$, where $k\geq 2$ is an integer. Given $0\leq a<b\leq 1$, let $\mathcal{W}_{k}(a,b)=\{x\in [0,1)\ \vert \ T_{k}^nx\notin (a,b), \text{ for all } n\geq 0\}$…