Related papers: Decision trees and influences of variables over pr…
Consider the random variable $\mathrm{Tr}( f_1(W)A_1\dots f_k(W)A_k)$ where $W$ is an $N\times N$ Hermitian Wigner matrix, $k\in\mathbb{N}$, and choose (possibly $N$-dependent) regular functions $f_1,\dots, f_k$ as well as bounded…
A sharp, distribution free, non-asymptotic result is proved for the concentration of a random function around the mean function, when the randomization is generated by a finite sequence of independent data and the random functions satisfy…
Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…
We consider distributional approximation by generalized Dickman distributions, which appear in number theory, perpetuities, logarithmic combinatorial structures and many other areas. We prove bounds in the Kolmogorov distance for the…
Causal random forests provide efficient estimates of heterogeneous treatment effects. However, forest algorithms are also well-known for their black-box nature, and therefore, do not characterize how input variables are involved in…
We study one class of continuous functions $f$ defined on segment $[0,1]$ by equality $$ f(x)=\delta_{\alpha_1(x)1}+\sum^{\infty}_{k=2}\left[\delta_{\alpha_k(x)k}\prod^{k-1}_{j=1}g_{\alpha_j…
Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…
The trivial proof of the ergodic theorem for a finite set $Y$ and a permutation $T:Y\to Y$ shows that for an arbitrary function $f:Y\to{\mathbb R}$ the sequence of ergodic means $A_n(f,T)$ stabilizes for $n \gg |T|$. We show that if $|Y|$…
We establish several results concerning the expected general phenomenon that, given a multiplicative function $f:\mathbb{N}\to\mathbb{C}$, the values of $f(n)$ and $f(n+a)$ are "generally" independent unless $f$ is of a "special" form.…
Gaussian bounds on noise correlation of functions play an important role in hardness of approximation, in quantitative social choice theory and in testing. The author (2008) obtained sharp gaussian bounds for the expected correlation of…
We investigate partial functions and computability theory from within a constructive, univalent type theory. The focus is on placing computability into a larger mathematical context, rather than on a complete development of computability…
Isotropic positive definite functions on spheres play important roles in spatial statistics, where they occur as the correlation functions of homogeneous random fields and star-shaped random particles. In approximation theory, strictly…
For every integer $k\geq 2$ let $[k]^{<\mathbb{N}}$ be the set of all words over $k$, that is, all finite sequences having values in $[k]:=\{1,...,k\}$. A Carlson-Simpson tree of $[k]^{<\mathbb{N}}$ of dimension $m\geq 1$ is a subset of…
Influence functions approximate the effect of training samples in test-time predictions and have a wide variety of applications in machine learning interpretability and uncertainty estimation. A commonly-used (first-order) influence…
In the estimation of causal effects, one common method for removing the influence of confounders is to adjust the variables that satisfy the back-door criterion. However, it is not always possible to uniquely determine sets of such…
Let $\rho$ be a borelian probability measure on $\mathrm{SL}_d(\mathbb{R})$. Consider the random walk $(X_n)$ on $\mathbb{R}^d\setminus\{0\}$ defined by $\rho$ : for any $x\in \mathbb{R}^d\setminus\{0\}$, we set $X_0 =x$ and $X_{n+1} =…
The dominated convergence theorem implies that if (f_n) is a sequence of functions on a probability space taking values in the interval [0,1], and (f_n) converges pointwise a.e., then the sequence of integrals converges to the integral of…
In decision problems, often, utilities and probabilities are hard to determine. In such cases, one can resort to so-called choice functions. They provide a means to determine which options in a particular set are optimal, and allow…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
We prove that for an arbitrary upper semi-continuous function $\phi\colon G(1,2) \to [0,1]$ there exists a compact set $F$ in the plane such that $\dim_{\textrm{A}} \pi F = \phi(\pi)$ for all $\pi \in G(1,2)$, where $\pi F$ is the…