English
Related papers

Related papers: Operational Interpretation of Renyi Information Me…

200 papers

A variety of new measures of quantum Renyi mutual information and quantum Renyi conditional entropy have recently been proposed, and some of their mathematical properties explored. Here, we show that the Renyi mutual information attains…

Quantum Physics · Physics 2016-10-20 Masahito Hayashi , Marco Tomamichel

The achievable error-exponent pairs for the type I and type II errors are characterized in a hypothesis testing setup where the observation consists of independent and identically distributed samples from either a known joint probability…

Information Theory · Computer Science 2018-09-19 Amos Lapidoth , Christoph Pfister

The R\'enyi information measures are characterized in terms of their Shannon counterparts, and properties of the former are recovered from first principle via the associated properties of the latter. Motivated by this characterization, a…

Information Theory · Computer Science 2016-03-14 Ofer Shayevitz

In this paper we revisit the binary hypothesis testing problem with one-sided compression. Specifically we assume that the distribution in the null hypothesis is a mixture distribution of iid components. The distribution under the…

Information Theory · Computer Science 2022-07-07 Minh Thanh Vu

This paper presents a novel theoretical study of the general problem of multiple source adaptation using the notion of Renyi divergence. Our results build on our previous work [12], but significantly broaden the scope of that work in…

Machine Learning · Computer Science 2012-05-14 Yishay Mansour , Mehryar Mohri , Afshin Rostamizadeh

Bounds on information combining are entropic inequalities that determine how the information, or entropy, of a set of random variables can change when they are combined in certain prescribed ways. Such bounds play an important role in…

Information Theory · Computer Science 2020-11-10 Christoph Hirche

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 consider the problem of distributed binary hypothesis testing of two sequences that are generated by an i.i.d. doubly-binary symmetric source. Each sequence is observed by a different terminal. The two hypotheses correspond to different…

Information Theory · Computer Science 2018-01-03 Eli Haim , Yuval Kochman

In this paper, we study the problem of determining $k$ anomalous random variables that have different probability distributions from the rest $(n-k)$ random variables. Instead of sampling each individual random variable separately as in the…

Information Theory · Computer Science 2024-09-09 Myung Cho , Weiyu Xu , Lifeng Lai

This work considers the problem of binary classification: given training data $x_1, \dots, x_n$ from a certain population, together with associated labels $y_1,\dots, y_n \in \left\{0,1 \right\}$, determine the best label for an element $x$…

Statistics Theory · Mathematics 2016-07-04 Nicolas Garcia Trillos , Ryan Murray

The doubly minimized Petz Renyi mutual information of order $\alpha$ is defined as the minimum of the Petz divergence of order $\alpha$ of a given bipartite quantum state relative to all product states. The doubly minimized sandwiched Renyi…

Quantum Physics · Physics 2026-04-07 Laura Burri

The composite binary hypothesis testing problem within the Neyman-Pearson framework is considered. The goal is to maximize the expectation of a nonlinear function of the detection probability, integrated with respect to a given probability…

Statistics Theory · Mathematics 2025-05-26 Yanglei Song , Berkan Dulek , Sinan Gezici

We study the problem of mismatched binary hypothesis testing between i.i.d. distributions. We analyze the tradeoff between the pairwise error probability exponents when the actual distributions generating the observation are different from…

Information Theory · Computer Science 2022-04-28 Parham Boroumand , Albert Guillén i Fàbregas

Bounds on information combining are a fundamental tool in coding theory, in particular when analyzing polar codes and belief propagation. They usually bound the evolution of random variables with respect to their Shannon entropy. In recent…

Information Theory · Computer Science 2023-05-05 Christoph Hirche , Xinyue Guan , Marco Tomamichel

Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a memoryless process generated from two possible distributions. Using its own observations,…

Information Theory · Computer Science 2017-03-02 Gil Katz , Pablo Piantanida , Mérouane Debbah

The matrix-based Renyi's \alpha-order entropy functional was recently introduced using the normalized eigenspectrum of a Hermitian matrix of the projected data in a reproducing kernel Hilbert space (RKHS). However, the current theory in the…

Information Theory · Computer Science 2019-08-01 Shujian Yu , Luis Gonzalo Sanchez Giraldo , Robert Jenssen , Jose C. Principe

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

Two families of dependence measures between random variables are introduced. They are based on the R\'enyi divergence of order $\alpha$ and the relative $\alpha$-entropy, respectively, and both dependence measures reduce to Shannon's mutual…

Information Theory · Computer Science 2019-08-22 Amos Lapidoth , Christoph Pfister

Cascaded binary hypothesis testing is studied in this paper with two decision centers at the relay and the receiver. All terminals have their own observations, where we assume that the observations at the transmitter, the relay, and the…

Information Theory · Computer Science 2021-06-24 Mustapha Hamad , Michèle Wigger , Mireille Sarkiss

We study the Hoeffding regime of composite quantum hypothesis testing, in which each hypothesis is specified by a sequence of sets of quantum states. We establish quantum Hoeffding bounds under a set of structural assumptions, orthogonal to…

Quantum Physics · Physics 2026-05-05 Masahito Hayashi , Kun Fang
‹ Prev 1 2 3 10 Next ›