English
Related papers

Related papers: Sub-Gaussian Error Bounds for Hypothesis Testing

200 papers

We introduce estimation and test procedures through divergence minimization for models satisfying linear constraints with unknown parameter. Several statistical examples and motivations are given. These procedures extend the empirical…

Statistics Theory · Mathematics 2008-11-24 Michel Broniatowski , Amor Keziou

Minimising upper bounds on the population risk or the generalisation gap has been widely used in structural risk minimisation (SRM) -- this is in particular at the core of PAC-Bayesian learning. Despite its successes and unfailing surge of…

Machine Learning · Statistics 2023-10-30 Paul Viallard , Maxime Haddouche , Umut Şimşekli , Benjamin Guedj

The problem of filtering information from large correlation matrices is of great importance in many applications. We have recently proposed the use of the Kullback-Leibler distance to measure the performance of filtering algorithms in…

Data Analysis, Statistics and Probability · Physics 2008-12-02 M. Tumminello , F. Lillo , R. N. Mantegna

We investigate the sub-Gaussian property for almost surely bounded random variables. If sub-Gaussianity per se is de facto ensured by the bounded support of said random variables, then exciting research avenues remain open. Among these…

Probability · Mathematics 2019-07-16 Julyan Arbel , Olivier Marchal , Hien D. Nguyen

In this study, simultaneous predictive distributions for independent Poisson observables were considered and the performance of predictive distributions was evaluated using the Kullback-Leibler (K-L) loss. This study proposes a class of…

Statistics Theory · Mathematics 2024-02-13 Xiao Li

Density-based directed distances -- particularly known as divergences -- between probability distributions are widely used in statistics as well as in the adjacent research fields of information theory, artificial intelligence and machine…

Statistics Theory · Mathematics 2022-03-03 Michel Broniatowski , Wolfgang Stummer

Inferring and comparing complex, multivariable probability density functions is fundamental to problems in several fields, including probabilistic learning, network theory, and data analysis. Classification and prediction are the two faces…

Information Theory · Computer Science 2017-03-30 David J. Galas , T. Gregory Dewey , James Kunert-Graf , Nikita A. Sakhanenko

This work performs a non-asymptotic analysis of the generalized Lasso under the assumption of sub-exponential data. Our main results continue recent research on the benchmark case of (sub-)Gaussian sample distributions and thereby explore…

Statistics Theory · Mathematics 2023-01-18 Martin Genzel , Christian Kipp

Frequentist conditions for asymptotic suitability of Bayesian procedures focus on lower bounds for prior mass in Kullback-Leibler neighbourhoods of the data distribution. The goal of this paper is to investigate the flexibility in criteria…

Statistics Theory · Mathematics 2018-03-19 B. J. K. Kleijn , Y. Y. Zhao

We study Bregman divergences in probability density space embedded with the $L^2$-Wasserstein metric. Several properties and dualities of transport Bregman divergences are provided. In particular, we derive the transport Kullback-Leibler…

Information Theory · Computer Science 2025-04-08 Wuchen Li

The Chernoff information between two probability measures is a statistical divergence measuring their deviation defined as their maximally skewed Bhattacharyya distance. Although the Chernoff information was originally introduced for…

Information Theory · Computer Science 2022-10-04 Frank Nielsen

Alternative exact expressions are derived for the minimum error probability of a hypothesis test discriminating among $M$ quantum states. The first expression corresponds to the error probability of a binary hypothesis test with certain…

Quantum Physics · Physics 2016-11-15 Gonzalo Vazquez-Vilar

To characterize the Kullback-Leibler divergence and Fisher information in general parametrized hidden Markov models, in this paper, we first show that the log likelihood and its derivatives can be represented as an additive functional of a…

Statistics Theory · Mathematics 2023-03-15 Cheng-Der Fuh , Chu-Lan Michael Kao , Tianxiao Pang

We make two contributions to the problem of estimating the $L_1$ calibration error of a binary classifier from a finite dataset. First, we provide an upper bound for any classifier where the calibration function has bounded variation.…

This paper considers reparameterization invariant Bayesian point estimates and credible regions of model parameters for scientific inference and communication. The effect of intrinsic loss function choice in Bayesian intrinsic estimates and…

Methodology · Statistics 2021-09-23 Aki Vehtari

This paper develops a unified framework for asymptotically minimax robust hypothesis testing under distributional uncertainty, applicable to both Bayesian and Neyman--Pearson formulations (Type-I and Type-II). Uncertainty classes based on…

Statistics Theory · Mathematics 2026-02-10 Gökhan Gül

Current approaches in approximate inference for Bayesian neural networks minimise the Kullback-Leibler divergence to approximate the true posterior over the weights. However, this approximation is without knowledge of the final application,…

Machine Learning · Statistics 2018-05-11 Adam D. Cobb , Stephen J. Roberts , Yarin Gal

This paper studies the problem of discriminating two multivariate Gaussian distributions in a distributed manner. Specifically, it characterizes in a special case the optimal typeII error exponent as a function of the available…

Information Theory · Computer Science 2020-05-15 Pierre Escamilla , Abdellatif Zaidi , Michèle Wigger

We propose a general error analysis related to the low-rank approximation of a given real matrix in both the spectral and Frobenius norms. First, we derive deterministic error bounds that hold with some minimal assumptions. Second, we…

Numerical Analysis · Mathematics 2022-06-22 Youssef Diouane , Selime Gürol , Alexandre Scotto Di Perrotolo , Xavier Vasseur

Statistical distances (SDs), which quantify the dissimilarity between probability distributions, are central to machine learning and statistics. A modern method for estimating such distances from data relies on parametrizing a variational…

Statistics Theory · Mathematics 2021-03-18 Sreejith Sreekumar , Zhengxin Zhang , Ziv Goldfeld