English
Related papers

Related papers: A Unified Study on Sequentiality in Universal Clas…

200 papers

We consider nonparametric sequential hypothesis testing problem when the distribution under the null hypothesis is fully known but the alternate hypothesis corresponds to some other unknown distribution with some loose constraints. We…

Information Theory · Computer Science 2013-11-15 Shouvik Ganguly , K Sahasranand , Vinod Sharma

We study the composite sequential quantum hypothesis testing (SQHT) problem, where the objective is to distinguish a null quantum state from a set of alternative quantum states. We propose a mixture-sequential quantum probability ratio test…

Quantum Physics · Physics 2026-05-12 Jacob Paul Simpson , Efstratios Palias , Sharu Theresa Jose

We revisit the outlier hypothesis testing framework of Li \emph{et al.} (TIT 2014) and derive fundamental limits for the optimal test. In outlier hypothesis testing, one is given multiple observed sequences, where most sequences are…

Statistics Theory · Mathematics 2022-05-17 Lin Zhou , Yun Wei , Alfred Hero

Sequential multi-class diagnosis, also known as multi-hypothesis testing, is a classical sequential decision problem with broad applications. However, the optimal solution remains, in general, unknown as the dynamic program suffers from the…

Information Theory · Computer Science 2020-12-07 Jue Wang

The distributed hypothesis testing problem with full side-information is studied. The trade-off (reliability function) between the two types of error exponents under limited rate is studied in the following way. First, the problem is…

Information Theory · Computer Science 2019-04-24 Nir Weinberger , Yuval Kochman

We consider nonparametric or universal sequential hypothesis testing problem when the distribution under the null hypothesis is fully known but the alternate hypothesis corresponds to some other unknown distribution. These algorithms are…

Information Theory · Computer Science 2013-08-30 Jithin K. Sreedharan , Vinod Sharma

Binary classification is a task that involves the classification of data into one of two distinct classes. It is widely utilized in various fields. However, conventional classifiers tend to make overconfident predictions for data that…

Machine Learning · Computer Science 2025-03-13 Shoma Yokura , Akihisa Ichiki

This paper studies sequential methods for recovery of sparse signals in high dimensions. When compared to fixed sample size procedures, in the sparse setting, sequential methods can result in a large reduction in the number of samples…

Information Theory · Computer Science 2014-10-07 Matthew L. Malloy , Robert Nowak

Simultaneous statistical inference has been a cornerstone in the statistics methodology literature because of its fundamental theory and paramount applications. The mainstream multiple testing literature has traditionally considered two…

Statistics Theory · Mathematics 2025-03-21 Monitirtha Dey , Subir Kumar Bhandari

Classifier predictions often rely on the assumption that new observations come from the same distribution as training data. When the underlying distribution changes, so does the optimal classification rule, and performance may degrade. We…

Methodology · Statistics 2021-09-01 Ciaran Evans , Max G'Sell

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

State discrimination is a useful test problem with which to clarify the power and limitations of different classes of measurement. We consider the problem of discriminating between given states of a bi-partite quantum system via sequential…

Quantum Physics · Physics 2017-09-25 Sarah Croke , Stephen M. Barnett , Graeme Weir

We study the problem of generalized uniformity testing \cite{BC17} of a discrete probability distribution: Given samples from a probability distribution $p$ over an {\em unknown} discrete domain $\mathbf{\Omega}$, we want to distinguish,…

Data Structures and Algorithms · Computer Science 2017-09-08 Ilias Diakonikolas , Daniel M. Kane , Alistair Stewart

Several researchers have experimentally shown that substantial improvements can be obtained in difficult pattern recognition problems by combining or integrating the outputs of multiple classifiers. This chapter provides an analytical…

Neural and Evolutionary Computing · Computer Science 2007-05-23 Kagan Tumer , Joydeep Ghosh

We study a class of distributed hypothesis testing against conditional independence problems. Under the criterion that stipulates minimization of the Type II error rate subject to a (constant) upper bound $\epsilon$ on the Type I error…

Information Theory · Computer Science 2019-04-08 Abdellatif Zaidi , Inaki Estella Aguerri

Sequential methods for quantum hypothesis testing offer significant advantages over fixed-length approaches, which rely on a predefined number of state copies. Despite their potential, these methods remain underexplored for unambiguous…

Quantum Physics · Physics 2025-11-26 Jordi Pérez-Guijarro , Alba Pagès-Zamora , Javier R. Fonollosa

The first- and second-order optimum achievable exponents in the simple hypothesis testing problem are investigated. The optimum achievable exponent for type II error probability, under the constraint that the type I error probability is…

Information Theory · Computer Science 2018-04-04 Te Sun Han , Ryo Nomura

In this paper we consider the problem of uniformity testing with limited memory. We observe a sequence of independent identically distributed random variables drawn from a distribution $p$ over $[n]$, which is either uniform or is…

Information Theory · Computer Science 2022-06-22 Tomer Berg , Or Ordentlich , Ofer Shayevitz

We study the problem of testing \emph{conditional independence} for discrete distributions. Specifically, given samples from a discrete random variable $(X, Y, Z)$ on domain $[\ell_1]\times[\ell_2] \times [n]$, we want to distinguish, with…

Data Structures and Algorithms · Computer Science 2018-07-03 Clément L. Canonne , Ilias Diakonikolas , Daniel M. Kane , Alistair Stewart

The classic problems of testing uniformity of and learning a discrete distribution, given access to independent samples from it, are examined under general $\ell_p$ metrics. The intuitions and results often contrast with the classic…

Data Structures and Algorithms · Computer Science 2015-03-24 Bo Waggoner
‹ Prev 1 3 4 5 6 7 10 Next ›