Related papers: Flipping out with many flips: hardness of testing …

For covariance test in functional data analysis, existing methods are developed only for fully observed curves, whereas in practice, trajectories are typically observed discretely and with noise. To bridge this gap, we employ a…

In this paper, we study classes of Boolean functions that are testable with $O(\psi+1/\epsilon)$ queries, where $\psi$ depends on the parameters of the class (e.g., the number of terms, the number of relevant variables, etc.) but not on the…

The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…

The top-k error is a common measure of performance in machine learning and computer vision. In practice, top-k classification is typically performed with deep neural networks trained with the cross-entropy loss. Theoretical results indeed…

A univariate continuous function can always be decomposed as the sum of a non-increasing function and a non-decreasing one. Based on this property, we propose a non-parametric regression method that combines two spline-fitted monotone…

Simultaneously testing $K$ hypotheses while controlling the family-wise error rate is a fundamental problem in statistics. Existing procedures (Bonferroni, Holm, Hochberg, Hommel) provide valid control but sacrifice power, increasingly so…

Let $D(\mu)$ denote a harmonically weighted Dirichlet space on the unit disc $\mathbb D$. We show that outer functions $f\in D(\mu)$ are cyclic in $D(\mu)$, whenever $\log f$ belongs to the Pick-Smirnov class $N^+(D(\mu))$. If $f$ has…

Sequential testing problems involve a complex system with several components, each of which is "working" with some independent probability. The outcome of each component can be determined by performing a test, which incurs some cost. The…

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…

In the framework of graph property testing, we study the problem of determining if a graph admits a cluster structure. We say that a graph is $(k, \phi)$-clusterable if it can be partitioned into at most $k$ parts such that each part has…

A real valued function $f$ defined on a real open interval $I$ is called $\Phi$-monotone if, for all $x,y\in I$ with $x\leq y$ it satisfies $$ f(x)\leq f(y)+\Phi(y-x), $$ where $\Phi:[0,\ell(I)[\,\to\mathbb{R}_+$ is a given nonnegative…

We give an algorithm for testing uniformity of distributions supported on hypergrids $[m_1] \times \cdots \times [m_n]$, which makes $\smash{\widetilde{O}(\text{poly}(m)\sqrt{n}/\epsilon^2)}$ many queries to a subcube conditional sampling…

The problem of multiple hypothesis testing arises when there are more than one hypothesis to be tested simultaneously for statistical significance. This is a very common situation in many data mining applications. For instance, assessing…

Tarski's theorem states that every monotone function from a complete lattice to itself has a fixed point. We analyze the query complexity of finding such a fixed point on the $k$-dimensional grid of side length $n$ under the $\leq$…

Machine-learning models are becoming increasingly prevalent in our lives, for instance assisting in image-classification or decision-making tasks. Consequently, the reliability of these models is of critical importance and has resulted in…

This paper explores the connection between classical isoperimetric inequalities, their directed analogues, and monotonicity testing. We study the setting of real-valued functions $f : [0,1]^d \to \mathbb{R}$ on the solid unit cube, where…

The standard model of Boolean function property testing is not well suited for testing $\textit{sparse}$ functions which have few satisfying assignments, since every such function is close (in the usual Hamming distance metric) to the…

We introduce a new type of test for complete spatial randomness that applies to mapped point patterns in a rectangle or a cube of any dimension. This is the first test of its kind to be based on characteristic functions and utilizes a…

Let M be a compact Riemannian manifold of dimension n. The k-curvature, for k=1,2,..n, is defined as the k-th elementary symmetric polynomial of the eigenvalues of the Schouten tenser. The k-Yamabe problem is to prove the existence of a…

This paper deals with two-sample tests for functional time series data, which have become widely available in conjunction with the advent of modern complex observation systems. Here, particular interest is in evaluating whether two sets of…