Skip to content
Preprint

On the Estimation of Chernoff Information

Aug 2026 · 0 citations · 22 references
Computer Science Mathematics

TL;DR

This work proves the $L_2$-consistency of the derivative estimator under mild regularity conditions on the densities and their domain and reformulates this optimization via a derivative condition, whose zero locates the optimal mixture parameter, and estimates the derivative directly using a-nearest-neighbor method.

Abstract

Chernoff information is a fundamental divergence measure characterizing the optimal error exponent in Bayesian binary hypothesis testing, with applications in information fusion, time-series analysis, and statistical learning theory. However, closed-form expressions exist only for simple parametric families, and nonparametric estimation remains difficult because the quantity is defined as an optimization of the unnormalized R\'enyi divergence over its order. We reformulate this optimization via a derivative condition, whose zero locates the optimal mixture parameter, and estimate the derivative directly using a $k$-nearest-neighbor method. We prove the $L_2$-consistency of the derivative estimator under mild regularity conditions on the densities and their domain. Coupled with a bisection procedure that locates the optimal parameter up to arbitrary precision, this yields an estimator for Chernoff information.

View source

Similar papers

NONPARAMETRIC BAYESIAN ESTIMATION

Frank Van Der SHOTA GUGUSHVILI, M. Meulen, Schauer Peter et al. · 1 citation
Preprint Aug 2026

A Structural Characterization of Entropy Functionals

Entropy functionals and their associated divergences underlie many statistical methods, including maximum entropy inference, minimum divergence estimation, and goodness-of-fit testing, yet choosing among Shannon, R\'enyi, Tsallis, and more general entropies is often a matter of convention rather than structural princip...

D. Lazarev · 0 citations
Preprint Aug 2026

A Bayesian Proof of the Bernoulli Theorem

We give a new proof of the Bernoulli theorem, conjectured by Talagrand and proved in the seminal work of Bednorz and Lata{\l}a. Our approach is based on information-theoretic ideas: lower bounds on the supremum of a Bernoulli process are translated to the fundamental limits of Bayesian estimation in a Cauchy additive c...

Jingbo Liu, Ilias Zadik · 1 citation
Jul 2026

A New Look at the Classical Estimation Problem

Bahadur's \emph{Lectures on the Theory of Estimation} develop the classical theory of point estimation inside the geometry of Hilbert space, and they record with unusual honesty where the theory strains: the locally best unbiased estimate depends on the parameter, a two-point parameter space yields an estimate Bahadur...

Paul W. Vos · 0 citations
Open access Aug 2026

Optimality Notions for Resolvent Monte Carlo

Resolvent Monte Carlo estimates eigenvalues of large matrices by sampling Markov chains and reading the target value off a truncated resolvent quotient, trading exact arithmetic for a stochastic error that the almost-optimal sampling scheme is designed to suppress. This paper studies when that error vanishes outright....

Tsvetelina Kostadinov, I. Dimov · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.