Related papers: Decision Trees, Protocols, and the Fourier Entropy…
We derive novel analytic tools for the discrete Bass model, which models the diffusion of new products on networks. We prove that the probability that any two nodes adopt by time t, is greater than or equal to the product of the…
Kiefer and Wolfowitz [Z. Wahrsch. Verw. Gebiete 34 (1976) 73--85] showed that if $F$ is a strictly curved concave distribution function (corresponding to a strictly monotone density $f$), then the Maximum Likelihood Estimator $\hat{F}_n$,…
To infer information flow in any network of agents, it is important first and foremost to establish causal temporal relations between the nodes. Practical and automated methods that can infer causality are difficult to find, and the subject…
We demonstrate a phenomenon of condensation of the Fourier transform $\widehat{f}$ of a function $f$ defined on the real line $\mathbb{R}$ which decreases rapidly on one half of the line. For instance, we prove that if $f$ is…
Let $S \subset \Bbb R^n$ be a smooth compact hypersurface with a strictly positive second fundamental form, $E$ be the Fourier extension operator on $S$, and $X$ be a Lebesgue measurable subset of $\Bbb R^n$. If $X$ contains a ball of each…
Interpretability of learning algorithms is crucial for applications involving critical decisions, and variable importance is one of the main interpretation tools. Shapley effects are now widely used to interpret both tree ensembles and…
Open quantum systems are defined as ordinary unitary quantum theories coupled to a set of external degrees of freedom, which are introduced to take on the r\^ole of an unobserved environment. Here we study examples of open quantum field…
Causal inference is perhaps one of the most fundamental concepts in science, beginning originally from the works of some of the ancient philosophers, through today, but also weaved strongly in current work from statisticians, machine…
We propose a simple extension of top-down decision tree learning heuristics such as ID3, C4.5, and CART. Our algorithm achieves provable guarantees for all target functions $f: \{-1,1\}^n \to \{-1,1\}$ with respect to the uniform…
We introduce a natural way to construct a random subset of a homogeneous Cantor set $C$ in $[0,1]$ via random labelings of an infinite $M$-ary tree, where $M\geq 2$. The Cantor set $C$ is the attractor of an equicontractive iterated…
``Einstein from noise" (EfN) is a prominent example of the model bias phenomenon: systematic errors in the statistical model that lead to spurious but consistent estimates. In the EfN experiment, one falsely believes that a set of…
Shannon Information theory has achieved great success in not only communication technology where it was originally developed for but also many other science and engineering fields such as machine learning and artificial intelligence.…
There is no doubt that the information hidden in entanglement entropy (EE), for example, the $n$-th order R\'enyi EE, i.e., $S^{A}_n=\frac{1}{1-n}\ln \Tr (\rho_A^n)$ where $\rho_A=\mathrm{Tr}_{\overline{A}}\rho$ is the reduced density…
We introduce and study the problem of posterior inference on tree-structured graphical models in the presence of a malicious adversary who can corrupt some observed nodes. In the well-studied broadcasting on trees model, corresponding to…
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 a general framework for inference in spanning tree models. We propose unified algorithms for the important cases of first-order expectations and second-order expectations in edge-factored, non-projective spanning-tree models. Our…
Compressed Counting (CC)} was recently proposed for approximating the $\alpha$th frequency moments of data streams, for $0<\alpha \leq 2$. Under the relaxed strict-Turnstile model, CC dramatically improves the standard algorithm based on…
A general theory for computing information transfers in nonlinear stochastic systems driven by deterministic forcing and additive and/or multiplicative noises, is presented. It extends the Liang-Kleeman framework of causality inference to…
In this paper, we consider inference and uncertainty quantification for low Tucker rank tensors with additive noise in the high-dimensional regime. Focusing on the output of the higher-order orthogonal iteration (HOOI) algorithm, a commonly…
The profile of a sample is the multiset of its symbol frequencies. We show that for samples of discrete distributions, profile entropy is a fundamental measure unifying the concepts of estimation, inference, and compression. Specifically,…