English
Related papers

Related papers: Testing Junta Truncation

200 papers

We prove that the class of functions g:{-1,+1}^n -> {-1,+1} that only depend on an unknown subset of k<<n variables (so-called k-juntas) is agnostically learnable from a random walk in time polynomial in n, 2^{k^2}, epsilon^{-k}, and…

Machine Learning · Computer Science 2008-06-27 Jan Arpe , Elchanan Mossel

Understanding statistical inference under possibly non-sparse high-dimensional models has gained much interest recently. For a given component of the regression coefficient, we show that the difficulty of the problem depends on the sparsity…

Statistics Theory · Mathematics 2022-08-22 Jelena Bradic , Jianqing Fan , Yinchu Zhu

Uniformity testing is arguably one of the most fundamental distribution testing problems. Given sample access to an unknown distribution $\mathbf{p}$ on $[n]$, one must decide if $\mathbf{p}$ is uniform or $\varepsilon$-far from uniform (in…

Machine Learning · Statistics 2024-10-16 Sihan Liu , Christopher Ye

This article deals with the hypothesis test for the extremely heavy-tailed distributions with infinite mean or variance by using a truncated sample mean. We obtain three necessary and sufficient conditions under which the asymptotic…

Statistics Theory · Mathematics 2021-12-07 Tang Fuquan , Han Dong

We study the problem of sampling an approximately uniformly random satisfying assignment for atomic constraint satisfaction problems i.e. where each constraint is violated by only one assignment to its variables. Let $p$ denote the maximum…

Data Structures and Algorithms · Computer Science 2021-02-17 Vishesh Jain , Huy Tuan Pham , Thuy-Duong Vuong

For a sample of Exponentially distributed durations we aim at point estimation and a confidence interval for its parameter. A duration is only observed if it has ended within a certain time interval, determined by a Uniform distribution.…

Methodology · Statistics 2021-10-19 Rafael Weißbach , Dominik Wied

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

Retrieval-based systems approximate access to a corpus by exposing only a truncated subset of available evidence. Even when relevant information exists in the corpus, truncation can prevent compatible evidence from co-occurring, leading to…

Logic in Computer Science · Computer Science 2026-01-22 Sean Plummer

We study the problem of learning k-juntas given access to examples drawn from a number of different product distributions. Thus we wish to learn a function f : {-1,1}^n -> {-1,1} that depends on k (unknown) coordinates. While the best known…

Machine Learning · Computer Science 2008-04-25 Jan Arpe , Elchanan Mossel

We examine the extent to which sublinear-sample property testing and estimation apply to settings where samples are independently but not identically distributed. Specifically, we consider the following distributional property testing…

Data Structures and Algorithms · Computer Science 2025-11-05 Shivam Garg , Chirag Pabbaraju , Kirankumar Shiragur , Gregory Valiant

We provide a distribution-free test that can be used to determine whether any two joint distributions $p$ and $q$ are statistically different by inspection of a large enough set of samples. Following recent efforts from Long et al. [1], we…

Machine Learning · Computer Science 2016-07-26 Francesco Solera , Andrea Palazzi

We investigate the problem of testing the equivalence between two discrete histograms. A {\em $k$-histogram} over $[n]$ is a probability distribution that is piecewise constant over some set of $k$ intervals over $[n]$. Histograms have been…

Data Structures and Algorithms · Computer Science 2017-03-07 Ilias Diakonikolas , Daniel M. Kane , Vladimir Nikishkin

The framework of distribution testing is currently ubiquitous in the field of property testing. In this model, the input is a probability distribution accessible via independently drawn samples from an oracle. The testing task is to…

Data Structures and Algorithms · Computer Science 2022-09-22 Sourav Chakraborty , Eldar Fischer , Arijit Ghosh , Gopinath Mishra , Sayantan Sen

We study the power of uniform sampling for $k$-Median in various metric spaces. We relate the query complexity for approximating $k$-Median, to a key parameter of the dataset, called the balancedness $\beta \in (0, 1]$ (with $1$ being…

Data Structures and Algorithms · Computer Science 2023-02-23 Lingxiao Huang , Shaofeng H. -C. Jiang , Jianing Lou

A construction of $p$-parameter Brownian sheet on the hypercube $C=[0,1]^p$ as a sum of $2^p$ independent Gaussian processes is obtained. The terms are closely related to Brownian pillows, and the probability laws of their $L^2(C)$ squared…

Statistics Theory · Mathematics 2025-10-09 A. Cabaña , E. M. Cabaña

We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…

Combinatorics · Mathematics 2009-09-17 Michael Lugo

We prove a lower bound of $\tilde{\Omega}(n^{1/3})$ for the query complexity of any two-sided and adaptive algorithm that tests whether an unknown Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is monotone or far from monotone. This…

Computational Complexity · Computer Science 2017-08-22 Xi Chen , Erik Waingarten , Jinyu Xie

The limit joint distribution of statistics that are generalizations of some statistics from the NIST STS, TestU01, and other packages is found under the following hypotheses $H_0$ and $H_1$. Hypothesis $H_0$ states that the tested sequence…

Statistics Theory · Mathematics 2025-12-23 M. P. Savelov

We consider the problem of hypothesis testing for discrete distributions. In the standard model, where we have sample access to an underlying distribution $p$, extensive research has established optimal bounds for uniformity testing,…

Machine Learning · Computer Science 2024-12-03 Maryam Aliakbarpour , Piotr Indyk , Ronitt Rubinfeld , Sandeep Silwal

In survival studies, classical inferences for left-truncated data require quasi-independence, a property that the joint density of truncation time and failure time is factorizable into their marginal densities in the observable region. The…

Methodology · Statistics 2019-04-16 Young-Geun Choi , Wei-Yann Tsai , Myunghee Cho Paik
‹ Prev 1 3 4 5 6 7 10 Next ›