English
Related papers

Related papers: A doubly composite Chernoff-Stein lemma and its ap…

200 papers

This thesis addresses the interplay between asymptotic hypothesis testing and entropy inequalities in quantum information theory. In the first part of the thesis we focus on hypothesis testing. We consider two main settings; one can either…

Quantum Physics · Physics 2018-12-14 Christoph Hirche

We study the error exponents in quantum hypothesis testing between two sets of quantum states, extending the analysis beyond the independent and identically distributed case to encompass composite correlated hypotheses. In particular, we…

Quantum Physics · Physics 2025-11-11 Kun Fang , Masahito Hayashi

We consider decision problems on finite sets of hypotheses represented by pairwise different shift-invariant states on a quantum spin chain. The decision in favor of one of the hypotheses is based on outputs of generalized measurements…

Quantum Physics · Physics 2015-05-18 Michael Nussbaum , Arleta Szkola

In this manuscript we define the notion of "$\delta$-typicality" for both entropy and relative entropy, as well as a notion of $\epsilon$-goodness and provide an extension to Stein's lemma for continuous quantities as well as correlated…

Information Theory · Computer Science 2025-02-17 Jihad Fahs , Ibrahim Abou Faycal , Ibrahim Issa

This paper provides a general framework for Stein's density method for multivariate continuous distributions. The approach associates to any probability density function a canonical operator and Stein class, as well as an infinite…

Probability · Mathematics 2023-04-27 Guillaume Mijoule , Martin Raič , Gesine Reinert , Yvik Swan

The first part of this work considers the entropy of the sum of (possibly dependent and non-identically distributed) Bernoulli random variables. Upper bounds on the error that follows from an approximation of this entropy by the entropy of…

Information Theory · Computer Science 2013-04-30 Igal Sason

The Chernoff bound is one of the most widely used tools in theoretical computer science. It's rare to find a randomized algorithm that doesn't employ a Chernoff bound in its analysis. The standard proofs of Chernoff bounds are beautiful but…

Data Structures and Algorithms · Computer Science 2026-02-10 William Kuszmaul

We provide a new general theorem for multivariate normal approximation on convex sets. The theorem is formulated in terms of a multivariate extension of Stein couplings. We apply the results to a homogeneity test in dense random graphs and…

Probability · Mathematics 2016-08-14 Xiao Fang , Adrian Röllin

An active hypothesis testing problem is formulated. In this problem, the agent can perform a fixed number of experiments and then decide on one of the hypotheses. The agent is also allowed to declare its experiments inconclusive if needed.…

Information Theory · Computer Science 2019-01-23 Dhruva Kartik , Ashutosh Nayyar , Urbashi Mitra

In probability theory, the Chernoff bound gives exponentially decreasing bounds on tail distributions for sums of independent random variables and such bound is applied at different fields in science and engineering. In this work, we…

Probability · Mathematics 2021-09-29 Shih Yu Chang

In this paper, we study the hypothesis testing problem of, among $n$ random variables, determining $k$ random variables which have different probability distributions from the rest $(n-k)$ random variables. Instead of using separate…

Information Theory · Computer Science 2013-05-28 Weiyu Xu , Lifeng Lai

The generalized quantum Stein's lemma provides an explicit expression for the optimal error exponent when distinguishing many independent and identically distributed (iid) copies of a given bipartite state from the set of separable…

Quantum Physics · Physics 2026-05-19 Giulia Mazzola , David Sutter , Renato Renner

We provide a general result for bounding the difference between point probabilities of integer supported distributions and the translated Poisson distribution, a convenient alternative to the discretized normal. We illustrate our theorem in…

Probability · Mathematics 2017-12-05 A. D. Barbour , Adrian Röllin , Nathan Ross

We investigate two closely related nonparametric hypothesis testing problems. In the first problem (i.e., the existence problem), we test whether a testing data stream is generated by one of a set of composite distributions. In the second…

Signal Processing · Electrical Eng. & Systems 2018-12-05 Yixian Liu , Yingbin Liang , Shuguang Cui

Recall the classical hypothesis testing setting with two convex sets of probability distributions P and Q. One receives either n i.i.d. samples from a distribution p in P or from a distribution q in Q and wants to decide from which set the…

Information Theory · Computer Science 2020-07-20 Fernando G. S. L. Brandao , Aram W. Harrow , James R. Lee , Yuval Peres

This paper deals with order identification for nested models in the i.i.d. framework. We study the asymptotic efficiency of two generalized likelihood ratio tests of the order. They are based on two estimators which are proved to be…

Statistics Theory · Mathematics 2007-06-13 Antoine Chambaz

We consider a problem of simple hypothesis testing using a randomized test via a tunable loss function proposed by Liao \textit{et al}. In this problem, we derive results that correspond to the Neyman--Pearson lemma, the Chernoff--Stein…

Information Theory · Computer Science 2022-08-30 Akira Kamatsuka

We propose a number of concepts and properties related to `weighted' statistical inference where the observed data are classified in accordance with a `value' of a sample string. The motivation comes from the concepts of weighted…

Statistics Theory · Mathematics 2024-07-31 Mark Kelbert , Yuri Suhov

We consider the problem of testing multiple quantum hypotheses $\{\rho_1^{\otimes n},\ldots,\rho_r^{\otimes n}\}$, where an arbitrary prior distribution is given and each of the $r$ hypotheses is $n$ copies of a quantum state. It is known…

Quantum Physics · Physics 2016-07-20 Ke Li

Probabilistic proofs of the Johnson-Lindenstrauss lemma imply that random projection can reduce the dimension of a data set and approximately preserve pairwise distances. If a distance being approximately preserved is called a success, and…

Statistics Theory · Mathematics 2024-07-15 Jason Bernstein , Alec M. Dunton , Benjamin W. Priest