English
Related papers

Related papers: A strong converse bound for multiple hypothesis te…

200 papers

In confirmatory clinical trials with small sample sizes, hypothesis tests based on asymptotic distributions are often not valid and exact non-parametric procedures are applied instead. However, the latter are based on discrete test…

Methodology · Statistics 2018-02-22 Robin Ristl , Dong Xi , Ekkehard Glimm , Martin Posch

We propose a fundamental theory on ensemble learning that answers the central question: what factors make an ensemble system good or bad? Previous studies used a variant of Fano's inequality of information theory and derived a lower bound…

Machine Learning · Computer Science 2023-11-17 Terufumi Morishita , Gaku Morio , Shota Horiguchi , Hiroaki Ozaki , Nobuo Nukaga

Performative prediction is a framework accounting for the shift in the data distribution induced by the prediction of a model deployed in the real world. Ensuring rapid convergence to a stable solution where the data distribution remains…

Machine Learning · Computer Science 2026-01-30 Pedram Khorsandi , Rushil Gupta , Mehrnaz Mofakhami , Simon Lacoste-Julien , Gauthier Gidel

We consider the problem of estimating the probability of error in multi-hypothesis testing when MAP criterion is used. This probability, which is also known as the Bayes risk is an important measure in many communication and information…

Information Theory · Computer Science 2007-07-16 Nandakishore Santhi , Alexander Vardy

The inverse relation between mutual information (MI) and Bayesian error is sharpened by deriving finite sequences of upper and lower bounds on MI in terms of the minimum probability of error (MPE) and related Bayesian quantities. The well…

Information Theory · Computer Science 2014-09-24 Sudhakar Prasad

This paper provides an overview of results and concepts in minimax robust hypothesis testing for two and multiple hypotheses. It starts with an introduction to the subject, highlighting its connection to other areas of robust statistics and…

Information Theory · Computer Science 2021-05-21 Michael Fauß , Abdelhak M. Zoubir , H. Vincent Poor

Current statistical inference problems in areas like astronomy, genomics, and marketing routinely involve the simultaneous testing of thousands -- even millions -- of null hypotheses. For high-dimensional multivariate distributions, these…

Methodology · Statistics 2017-04-25 Weixin Cai , Nima S. Hejazi , Alan E. Hubbard

Our goal is to develop theory and algorithms for establishing fundamental limits on performance imposed by a robot's sensors for a given task. In order to achieve this, we define a quantity that captures the amount of task-relevant…

Robotics · Computer Science 2023-07-13 Anirudha Majumdar , Zhiting Mei , Vincent Pacelli

Empirical research typically involves a robustness-efficiency tradeoff. A researcher seeking to estimate a scalar parameter can invoke strong assumptions to motivate a restricted estimator that is precise but may be heavily biased, or they…

Econometrics · Economics 2025-09-17 Timothy B. Armstrong , Patrick Kline , Liyang Sun

Two alternative exact characterizations of the minimum error probability of Bayesian M-ary hypothesis testing are derived. The first expression corresponds to the error probability of an induced binary hypothesis test and implies the…

Information Theory · Computer Science 2016-04-07 Gonzalo Vazquez-Vilar , Adrià Tauste Campo , Albert Guillén i Fàbregas , Alfonso Martinez

The existing upper and lower bounds between entropy and error are mostly derived through an inequality means without linking to joint distributions. In fact, from either theoretical or application viewpoint, there exists a need to achieve a…

Information Theory · Computer Science 2013-03-06 Bao-Gang Hu , Hong-Jie Xing

This work investigates multiple testing by considering minimax separation rates in the sparse sequence model, when the testing risk is measured as the sum FDR+FNR (False Discovery Rate plus False Negative Rate). First using the popular…

Statistics Theory · Mathematics 2023-08-31 Kweku Abraham , Ismael Castillo , Etienne Roquain

We study policy evaluation of offline contextual bandits subject to unobserved confounders. Sensitivity analysis methods are commonly used to estimate the policy value under the worst-case confounding over a given uncertainty set. However,…

Machine Learning · Statistics 2026-01-13 Kei Ishikawa , Niao He , Takafumi Kanamori

Tight bounds for several symmetric divergence measures are introduced, given in terms of the total variation distance. Each of these bounds is attained by a pair of 2 or 3-element probability distributions. An application of these bounds…

Information Theory · Computer Science 2016-11-15 Igal Sason

We address the problem of classification when data are collected from two samples with measurement errors. This problem turns to be an inverse problem and requires a specific treatment. In this context, we investigate the minimax rates of…

Statistics Theory · Mathematics 2013-07-15 Sébastien Loustau , Clément Marteau

Lower bounds for the average probability of error of estimating a hidden variable X given an observation of a correlated random variable Y, and Fano's inequality in particular, play a central role in information theory. In this paper, we…

Information Theory · Computer Science 2013-10-08 Flavio du Pin Calmon , Mayank Varia , Muriel Médard , Mark M. Christiansen , Ken R. Duffy , Stefano Tessaro

We show how one can demonstrate continuous-variable Einstein-Podolsky-Rosen (EPR) steering without needing to characterize entire measurement probability distributions. To do this, we develop a modified Fano inequality useful for discrete…

Quantum Physics · Physics 2015-02-26 James Schneeloch , Samuel H. Knarr , Gregory A. Howland , John C. Howell

When dealing with imbalanced classification data, reweighting the loss function is a standard procedure allowing to equilibrate between the true positive and true negative rates within the risk measure. Despite significant theoretical work…

Machine Learning · Statistics 2024-04-17 Anass Aghbalou , François Portier , Anne Sabourin

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

In this paper, we consider the problem of estimating the underlying graph associated with an Ising model given a number of independent and identically distributed samples. We adopt an \emph{approximate recovery} criterion that allows for a…

Information Theory · Computer Science 2016-07-11 Jonathan Scarlett , Volkan Cevher