Related papers: New Direct Sum Tests
We study the problem of testing if a function depends on a small number of linear directions of its input data. We call a function $f$ a linear $k$-junta if it is completely determined by some $k$-dimensional subspace of the input space. In…
A celebrated theorem of Friedgut says that every function $f:\{0,1\}^n \to \{0,1\}$ can be approximated by a function $g:\{0,1\}^n \to \{0,1\}$ with $\|f-g\|_2^2 \le \epsilon$ which depends only on $e^{O(I_f/\epsilon)}$ variables where…
This paper studies estimation of and inference on a distribution function $F$ that is concave on the nonnegative half line and admits a density function $f$ with potentially unbounded support. When $F$ is strictly concave, we show that the…
We study finite-sample inference for the trade-off function of two unknown probability distributions, the function that traces the optimal type I/type II error frontier in binary testing. Given samples from distributions $P$ and $Q$, we…
A new method based on the rejection sampling for finding statistical tests is proposed. This method is conceptually intuitive, easy to implement, and applicable for arbitrary dimension. To illustrate its potential applicability, three…
For the family of analytic functions $f(z)$ in the open unit disk $\mathbb{D}$ with $f(0)=f'(0)-1=0$, satisfying the differential equation \begin{equation*} zf'(z) - f(z) = \dfrac{1}{2} z^2 \phi(z), \quad |\phi(z)| \leq 1, \end{equation*}…
Let ${\mathcal U}(\lambda)$ denote the family of analytic functions $f(z)$, $f(0)=0=f'(0)-1$, in the unit disk $\ID$, which satisfy the condition $\big |\big (z/f(z)\big )^{2}f'(z)-1\big |<\lambda $ for some $0<\lambda \leq 1$. The…
Data depth has emerged as an invaluable nonparametric measure for the ranking of multivariate samples. The main contribution of depth-based two-sample comparisons is the introduction of the Q statistic (Liu and Singh, 1993), a quality…
Statistical depth functions provide measures of the outlyingness, or centrality, of the elements of a space with respect to a distribution. It is a nonparametric concept applicable to spaces of any dimension, for instance, multivariate and…
Let S\subset (0,1). Given a known function f:S\to (0,1), we consider the problem of using independent tosses of a coin with probability of heads p (where p\in S is unknown) to simulate a coin with probability of heads f(p). We prove that if…
In this paper, we propose two new tests for testing the equality of the covariance functions of several functional populations, namely a quasi GPF test and a quasi $F_{\max}$ test. The asymptotic random expressions of the two tests under…
We study sums of the shape $\sum_{n \leqslant x} f \left( \lfloor x/n \rfloor \right)$ where $f$ is either the von Mangoldt function or the Dirichlet-Piltz divisor functions. We improve previous estimates when $f = \Lambda$ and $f = \tau$,…
A preferential domain is a collection of sets of preferences which are linear orders over a set of alternatives. These domains have been studied extensively in social choice theory due to both its practical importance and theoretical…
In the framework of semiparametric distribution regression, we consider the problem of comparing the conditional distribution functions corresponding to two samples. In contrast to testing for exact equality, we are interested in the (null)…
What advantage do \emph{sequential} procedures provide over batch algorithms for testing properties of unknown distributions? Focusing on the problem of testing whether two distributions $\mathcal{D}_1$ and $\mathcal{D}_2$ on $\{1,\dots,…
Term frequency-inverse document frequency, or TF-IDF for short, is arguably the most celebrated mathematical expression in the history of information retrieval. Conceived as a simple heuristic quantifying the extent to which a given term's…
Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…
A graph property P is strongly testable if for every fixed \epsilon>0 there is a one-sided \epsilon-tester for P whose query complexity is bounded by a function of \epsilon. In classifying the strongly testable graph properties, the first…
A long-standing shortcoming of statically typed functional languages is that type checking does not rule out pattern-matching failures (run-time match exceptions). Refinement types distinguish different values of datatypes; if a program…
Let $G=(V(G),E(G))$ be a simple graph. A restrained double Roman dominating function (RDRD-function) of $G$ is a function $f: V(G) \rightarrow \{0,1,2,3\}$ satisfying the following properties: if $f(v)=0$, then the vertex $v$ has at least…