English
Related papers

Related papers: An Optimal Tester for $k$-Linear

200 papers

In the property testing model, the task is to distinguish objects possessing some property from the objects that are far from it. One of such properties is monotonicity, when the objects are functions from one poset to another. This is an…

Computational Complexity · Computer Science 2018-05-11 Aleksandrs Belovs

We study the fundamental problems of (i) uniformity testing of a discrete distribution, and (ii) closeness testing between two discrete distributions with bounded $\ell_2$-norm. These problems have been extensively studied in distribution…

Data Structures and Algorithms · Computer Science 2016-11-14 Ilias Diakonikolas , Themis Gouleakis , John Peebles , Eric Price

When the distributions of the training and test data do not coincide, the problem of understanding generalization becomes considerably more complex, prompting a variety of questions. Prior work has shown that, for some fixed learning…

Machine Learning · Computer Science 2025-12-03 Jordi Pérez-Guijarro

We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC'07]. More precisely, we construct a 4-independent hash functions yielding expected…

Data Structures and Algorithms · Computer Science 2014-12-25 Mikkel Thorup

A function $f\colon \{-1,1\}^n \to \{-1,1\}$ is a $k$-junta if it depends on at most $k$ of its variables. We consider the problem of tolerant testing of $k$-juntas, where the testing algorithm must accept any function that is…

Data Structures and Algorithms · Computer Science 2016-11-04 Eric Blais , Clément L. Canonne , Talya Eden , Amit Levi , Dana Ron

Given samples from two distributions over an $n$-element set, we wish to test whether these distributions are statistically close. We present an algorithm which uses sublinear in $n$, specifically, $O(n^{2/3}\epsilon^{-8/3}\log n)$,…

Data Structures and Algorithms · Computer Science 2010-11-05 Tugkan Batu , Lance Fortnow , Ronitt Rubinfeld , Warren D. Smith , Patrick White

We conduct a KL-divergence based procedure for testing elliptical distributions. The procedure simultaneously takes into account the two defining properties of an elliptically distributed random vector: independence between length and…

Methodology · Statistics 2025-11-04 Yin Tang , Yanyuan Ma , Bing Li

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

Discrete Mathematics · Computer Science 2013-11-13 Tom Gur , Omer Tamuz

This paper studies optimal hypothesis testing for nonregular econometric models with parameter-dependent support. We consider both one-sided and two-sided hypothesis testing and develop asymptotically uniformly most powerful tests based on…

Statistics Theory · Mathematics 2025-10-07 Yuya Shimizu , Taisuke Otsu

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…

Computational Complexity · Computer Science 2022-08-19 Ronen Eldan , Avi Wigderson , Pei Wu

Given observations from a circular random variable contaminated by an additive measurement error, we consider the problem of minimax optimal goodness-of-fit testing in a non-asymptotic framework. We propose direct and indirect testing…

Statistics Theory · Mathematics 2020-07-14 Sandra Schluttenhofer , Jan Johannes

We give a general unified method that can be used for $L_1$ {\em closeness testing} of a wide range of univariate structured distribution families. More specifically, we design a sample optimal and computationally efficient algorithm for…

Data Structures and Algorithms · Computer Science 2015-08-25 Ilias Diakonikolas , Daniel M. Kane , Vladimir Nikishkin

Let $K$ be a totally real number field of degree $n$ over $\mathbb{Q}$, with discriminant and regulator $\Delta_K, R_K$ respectively. In this paper, using a similar method to van Woerden, we prove that the number of classes of perfect unary…

Number Theory · Mathematics 2022-08-08 Christian Porter , Andrew Mendelsohn

We revisit the relation between two fundamental property testing models for bounded-degree directed graphs: the bidirectional model in which the algorithms are allowed to query both the outgoing edges and incoming edges of a vertex, and the…

Data Structures and Algorithms · Computer Science 2023-05-23 Pan Peng , Yuyang Wang

We develop here several goodness-of-fit tests for testing the k-monotonicity of a discrete density, based on the empirical distribution of the observations. Our tests are non-parametric, easy to implement and are proved to be asymptotically…

Methodology · Statistics 2017-08-30 Jade Giguelay , Sylvie Huet

This work introduces a general numerical technique to invert one dimensional analytic or tabulated nonlinear functions in assigned ranges of interest. The proposed approach is based on an optimal version of the k-vector range searching, an…

Data Structures and Algorithms · Computer Science 2020-04-07 David Arnas , Daniele Mortari

We consider nonadaptive probabilistic group testing in the linear regime, where each of n items is defective independently with probability p in (0,1), and p is a constant independent of n. We show that testing each item individually is…

Information Theory · Computer Science 2025-09-26 Matthew Aldridge

Recently, there has been significant work studying distribution testing under the Conditional Sampling model. In this model, a query specifies a subset $S$ of the domain, and the output received is a sample drawn from the distribution…

Data Structures and Algorithms · Computer Science 2020-11-05 Shyam Narayanan

The $k$-of-$n$ testing problem involves performing $n$ independent tests sequentially, in order to determine whether/not at least $k$ tests pass. The objective is to minimize the expected cost of testing. This is a fundamental and…

Data Structures and Algorithms · Computer Science 2026-03-26 Rayen Tan , Viswanath Nagarajan

We present an iterative algorithm for solving a class of \\nonlinear Laplacian system of equations in $\tilde{O}(k^2m \log(kn/\epsilon))$ iterations, where $k$ is a measure of nonlinearity, $n$ is the number of variables, $m$ is the number…

Data Structures and Algorithms · Computer Science 2015-07-29 Eric J. Friedman , Adam S. Landsberg
‹ Prev 1 3 4 5 6 7 10 Next ›