English
Related papers

Related papers: On The Memory Complexity of Uniformity Testing

200 papers

Order statistics theory is applied in this paper to probabilistic robust control theory to compute the minimum sample size needed to come up with a reliable estimate of an uncertain quantity under continuity assumption of the related…

Optimization and Control · Mathematics 2008-05-13 Xinjia Chen , Kemin Zhou

We design and mathematically analyze sampling-based algorithms for regularized loss minimization problems that are implementable in popular computational models for large data, in which the access to the data is restricted in some way. Our…

Machine Learning · Computer Science 2019-06-04 Ryan R. Curtin , Sungjin Im , Ben Moseley , Kirk Pruhs , Alireza Samadian

The uncertainty principle sets a bound on our ability to predict the measurement outcomes of two incompatible observables which are measured on a quantum particle simultaneously. In quantum information theory, the uncertainty principle can…

Quantum Physics · Physics 2019-12-03 H. Dolatkhah , S. Haseli , S. Salimi , A. s. Khorashad

Asymptotic methods for hypothesis testing in high-dimensional data usually require the dimension of the observations to increase to infinity, often with an additional relationship between the dimension (say, $p$) and the sample size (say,…

Methodology · Statistics 2025-12-11 Ritabrata Karmakar , Joydeep Chowdhury , Subhajit Dutta , Marc G. Genton

In the binary hypothesis testing problem, it is well known that sequentiality in taking samples eradicates the trade-off between two error exponents, yet implementing the optimal test requires the knowledge of the underlying distributions,…

Information Theory · Computer Science 2025-01-07 Ching-Fang Li , I-Hsiang Wang

The problem of scheduling with testing in the framework of explorable uncertainty models environments where some preliminary action can influence the duration of a task. In the model, each job has an unknown processing time that can be…

Data Structures and Algorithms · Computer Science 2021-08-20 Susanne Albers , Alexander Eckl

We consider the classical sequential binary hypothesis testing problem in which there are two hypotheses governed respectively by distributions $P_0$ and $P_1$ and we would like to decide which hypothesis is true using a sequential test. It…

Information Theory · Computer Science 2020-07-01 Yonglong Li , Vincent Y. F. Tan

The problem of binary hypothesis testing between two probability measures is considered. New sharp bounds are derived for the best achievable error probability of such tests based on independent and identically distributed observations.…

Information Theory · Computer Science 2024-05-30 Valentinian Lungu , Ioannis Kontoyiannis

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

In this paper we consider the uniformity testing problem for high-dimensional discrete distributions (multinomials) under sparse alternatives. More precisely, we derive sharp detection thresholds for testing, based on $n$ samples, whether a…

Statistics Theory · Mathematics 2022-02-17 Bhaswar B. Bhattacharya , Rajarshi Mukherjee

We study the equivalence testing problem where the goal is to determine if the given two unknown distributions on $[n]$ are equal or $\epsilon$-far in the total variation distance in the conditional sampling model (CFGM, SICOMP16; CRS,…

Data Structures and Algorithms · Computer Science 2023-08-23 Diptarka Chakraborty , Sourav Chakraborty , Gunjan Kumar

In this paper, we study sequential testing problems with \emph{overlapping} hypotheses. We first focus on the simple problem of assessing if the mean $\mu$ of a Gaussian distribution is smaller or larger than a fixed $\epsilon>0$; if…

Statistics Theory · Mathematics 2021-11-19 Aurélien Garivier , Emilie Kaufmann

When are asymptotic approximations using the delta-method uniformly valid? We provide sufficient conditions as well as closely related necessary conditions for uniform negligibility of the remainder of such approximations. These conditions…

Statistics Theory · Mathematics 2015-07-22 Maximilian Kasy

In this work, we show, for the well-studied problem of learning parity under noise, where a learner tries to learn $x=(x_1,\ldots,x_n) \in \{0,1\}^n$ from a stream of random linear equations over $\mathrm{F}_2$ that are correct with…

Machine Learning · Computer Science 2021-07-07 Sumegha Garg , Pravesh K. Kothari , Pengda Liu , Ran Raz

We provide finite-sample distribution approximations, that are uniform in the parameter, for inference in linear mixed models. Focus is on variances and covariances of random effects in cases where existing theory fails because their…

Statistics Theory · Mathematics 2025-07-29 Karl Oskar Ekvall , Matteo Bottai

Measurement uncertainty relations are lower bounds on the errors of any approximate joint measurement of two or more quantum observables. The aim of this paper is to provide methods to compute optimal bounds of this type. The basic method…

Quantum Physics · Physics 2016-06-08 René Schwonnek , David Reeb , Reinhard F. Werner

Testing to see whether a given data set comes from some specified distribution is among the oldest types of problems in Statistics. Many such tests have been developed and their performance studied. The general result has been that while a…

Applications · Statistics 2020-12-07 Wolfgang Rolke

There are two common settings in a quantum-state discrimination problem. One is minimum-error discrimination where a wrong guess (error) is allowed and the discrimination success probability is maximized. The other is unambiguous…

Quantum Physics · Physics 2009-11-13 A. Hayashi , T. Hashimoto , M. Horibe

Recent advances in noiseless non-adaptive group testing have led to a precise asymptotic characterization of the number of tests required for high-probability recovery in the sublinear regime $k = n^{\theta}$ (with $\theta \in (0,1)$), with…

Data Structures and Algorithms · Computer Science 2021-12-24 Oliver Gebhard , Max Hahn-Klimroth , Olaf Parczyk , Manuel Penschuck , Maurice Rolvien , Jonathan Scarlett , Nelvin Tan

The problem of statistical inference in its various forms has been the subject of decades-long extensive research. Most of the effort has been focused on characterizing the behavior as a function of the number of available samples, with far…

Machine Learning · Computer Science 2024-11-12 Tomer Berg , Or Ordentlich , Ofer Shayevitz