Skip to main content
Entropy logoLink to Entropy
. 2026 May 8;28(5):536. doi: 10.3390/e28050536

Weighted Chernoff Information and Optimal Loss Exponent in Context-Sensitive Hypothesis Testing

Mark Kelbert 1,2,*, El’mira Yu Kalimulina 3,4
Editor: Nikolai Leonenko
PMCID: PMC13205199  PMID: 42187951

Abstract

We study binary hypothesis testing for i.i.d. observations under a multiplicative context weight. For the optimal weighted total loss, defined as the sum of weighted type-I and type-II losses, we prove the logarithmic asymptotic Ln∗=exp{−nDCw(P,Q)+o(n)},n→∞, where DCw is the weighted Chernoff information. The single-letter form of the exponent relies on a structural assumption that the weight factorises across observations, φ(x1n)=∏i=1nφ(xi); this restriction is essential for the single-letter representation and should be distinguished from the weaker qualitative description “multiplicative context weight”. The proof embeds the weighted geometric mixtures φpαq1−α into a likelihood-ratio exponential family and identifies the rate through its log-normaliser. We also derive concentration bounds for the tilted weighted log-likelihood, obtain closed forms for Gaussian, Poisson, and exponential models, and extend the exponent characterisation to finitely many hypotheses.

Keywords: hypothesis testing, weighted Chernoff information, weighted Bhattacharyya coefficient, exponential family, information geometry, context-sensitive loss

MSC: 62F03, 60F10

1. Introduction

Let X be a Polish space with its Borel σ-algebra and let X1n=(X1,…,Xn) be i.i.d. X-valued observations. We consider the simple hypotheses

H0:X1n∼P⊗nversusH1:X1n∼Q⊗n,

where P and Q are probability measures on X dominated by a reference measure μ. Without loss of generality, one may take μ=12(P+Q) and write p=dPdμ and q=dQdμ. In the unweighted setting, the optimal sum of type-I and type-II error probabilities is characterized by TV(P⊗n,Q⊗n) and can be written as

∫Xnmin{p(x1n),q(x1n)}dμ⊗n(x1n),p(x1n)=∏i=1np(xi),q(x1n)=∏i=1nq(xi). (1)

In the standard (unweighted) Bayesian setting, the decay rate of the optimal total error probability is governed by the Chernoff information [1,2]:

ρα(p,q):=∫Xp(x)αq(x)1−αdμ(x),α∈[0,1],ρ(p,q):=infα∈[0,1]ρα(p,q),DC(P,Q):=−lnρ(p,q)=maxα∈[0,1]−lnρα(p,q). (2)

Here ρα is usually called the α-skewed Bhattacharyya affinity coefficient, and ρ(p,q)=infα∈[0,1]ρα(p,q) is the affinity coefficient. In view of Hölder’s inequality, ρα(p,q)∈[0, 1].

Chernoff also introduced an asymptotic efficiency notion for comparing two experimental designs e=lnρ1lnρ2 such that n observations on one test are equivalent (i.e., they give asymptotically the same total loss as n→∞) to en observations on another test; see [1].

The paper studies a context-sensitive (weighted) analogue of this criterion and the logarithmic asymptotics of the optimal total loss as n→∞, in the framework of [3,4]. In the weighted setting, a nonnegative weight function φ(x1n) reweights the loss of a wrong decision according to the realised sample. Thus, φ acts as a context factor that changes the relevance of different observations for the statistical task.

Weights of this form arise naturally whenever observations are not equally informative for the inference task. Two canonical mechanisms produce such φ. In importance-type reweighting, samples drawn under a proposal density g are used to perform inference with respect to a target h, and the Radon–Nikodym factor φ(x)=h(x)/g(x) enters the loss as a strictly positive (non-indicator) tilt; this is the mechanism underlying the context-sensitive framework of [3,4].

In applications, the informational value of an observation often depends on the underlying channel state. A canonical example, directly relevant to multiple hypothesis testing of transmission regimes, is a mobile communication channel modulated by a multi-zone coverage process (e.g., strong/weak/outage) along the receiver trajectory: samples acquired in outage carry little information about the regime and are weighted accordingly. Such reliability-weighted aggregation in multi-state channels was studied within multi-valued frameworks in [5,6].

Under the standard assumption that the modulating state at time i is determined by Xi alone, the resulting weight is a strictly positive bounded function φ(x) and extends multiplicatively to X1n. The weighted Chernoff information DCw(P,Q) then quantifies the effective discrimination rate under channel-dependent reliability and reduces to the classical rate DC(P,Q) in the limit φ≡1. Further parametric instances (Gaussian, Poisson, exponential) are worked out in Section 4.

Throughout we assume that the weight is compatible with the i.i.d. structure and factorises across observations; by abuse of notation, φ denotes both the one-step weight and its product extension.

Assumption 1 

(Factorised weight). The weight function φ(x1n) satisfies

φ(x1n)=∏i=1nφ(xi),φ≥0. (3)

Assumption 1 is the key single-letter hypothesis. It yields the weighted affinities

ραw(p,q)=∫Xφ(x)p(x)αq(x)1−αdμ(x),

hence an additive logarithmic rate. For one observation and equal priors, the weighted Bayes risk equals

12∫Xφ(x)min{p(x),q(x)}dμ(x).

Since min{a,b}≤aαb1−α for every α∈[0, 1],

∫Xφ(x)min{p(x),q(x)}dμ(x)≤ραw(p,q),

and therefore

∫Xφ(x)min{p(x),q(x)}dμ(x)≤exp{−DCw(P,Q)},

where DCw(P,Q):=maxα∈[0,1]−lnραw(p,q) (see Definition 2). Under Assumption 1, the same bound factorises over n observations and yields the exponential scale exp{−nDCw(P,Q)}. Theorem 1 shows that this scale is exact on the logarithmic level.

1.1. Main Result and Contributions

Let Ln∗ denote the optimal total context-sensitive loss (sum of weighted type-I and type-II losses, minimised over decision rules) for n i.i.d. observations under Assumption 1. Our main theorem (Theorem 1) proves the single-letter logarithmic asymptotic

Ln∗=exp{−nDCw(P,Q)+o(n)},n→∞, (4)

where the rate is the weighted Chernoff information

DCw(P,Q)=maxα∈[0, 1]−ln∫Xφ(x)p(x)αq(x)1−αdμ(x). (5)

For φ≡1, (5) reduces to the classical Chernoff information.

We also extend the exponent characterisation to a finite family of simple hypotheses: the optimal M-ary rate is the minimum pairwise weighted Chernoff information (cf. [7] in the unweighted case). A central technical device is an exponential-family representation of the weighted geometric mixtures α↦φpαq1−α. This embeds the mixtures into a likelihood-ratio exponential family and identifies the exponent through the corresponding log-normaliser. We further derive concentration bounds for tilted weighted log-likelihood ratios and closed-form expressions for DCw in several parametric models; see Section 4.

1.2. Contributions

Items (N1)–(N4) below indicate new results; items (A1)–(A3) summarise definitions, geometric context, and tools adopted from the existing literature.

  • (N1)

    (New.) Theorem 1 establishes the logarithmic asymptotic (4) for the optimal weighted total loss under the factorised weight of Assumption 1, with rate given by the weighted Chernoff information (5).

  • (N2)

    (New.) The exponential-family representation of the weighted geometric mixtures α↦φpαq1−α (Section 3.2) and the resulting uniqueness of the optimal skewing parameter α∗.

  • (N3)

    (New.) Concentration bounds for the tilted weighted log-likelihood and the finite-n tail bound of Theorem 2 (Section 3.4).

  • (N4)

    (New.) Closed-form expressions for DCw in the Gaussian, Poisson, and exponential models (Section 4), and the M-ary extension showing that the optimal rate equals the minimum pairwise weighted Chernoff information.

  • (A1)

    (Adapted definitions.) The definitions of the weighted Bhattacharyya affinities and the weighted Chernoff information generalise the classical unweighted quantities of [1,2] and follow the context-sensitive framework of [3,4]; their asymptotic and information-geometric consequences developed below are new.

  • (A2)

    (Geometric context.) The information-geometric identities of Section 3.3 are derived in the spirit of the Chentsov–Amari–Nielsen framework [8,9,10,11] but are stated and proved for the tilted log-normaliser F^(θ)=ln∫φ(x)eθTt(x)+k(x)dμ(x); the unweighted limit φ≡1 recovers the classical statements of [11,12].

  • (A3)

    (Standard tool.) The concentration argument uses the Azuma–Hoeffding/McDiarmid inequality [13,14]; the novelty lies in its application to the tilted weighted log-likelihood.

1.3. Related Work

The exponential theory of testing errors goes back to Chernoff [1] and Hoeffding [2]. The context-sensitive framework and the weighted information quantities used here were developed in [3,4]. The information-geometric viewpoint on Chernoff information originates with Chentsov [9]; the dually flat structure of exponential and mixture families and the associated α-divergences are developed in [8,10], and the Chernoff point is characterised as the intersection of an exponential geodesic with the Kullback–Leibler bisector in [11]. For φ≡1, the likelihood-ratio exponential family description is given in [12]; the present paper extends this picture to the tilted integrand φpαq1−α. The minimum-pairwise principle for multiple testing is due to [7]. Weighting mechanisms for covariate-dependent relevance have also been studied outside the asymptotic error-exponent framework, e.g., adaptive-kernel conditional-independence testing [15].

1.4. Structure of the Paper

Section 2 introduces the weighted Bhattacharyya affinities and the weighted Chernoff information. Section 3 proves the main asymptotic result (4) and develops the exponential-family and information-geometric identities. Section 3.4 studies the tilted weighted log-likelihood and derives finite-n concentration bounds. Section 4 examines Gaussian, Poisson, and exponential models and includes the M-ary extension. Auxiliary computations are collected in the appendices.

2. Problem Set-Up and Weighted Divergences

2.1. Context-Sensitive Losses and Weighted Total Variation

We keep the binary i.i.d. model from Section 1 and work under Assumption 1. In particular,

p(x1n)=∏i=1np(xi),q(x1n)=∏i=1nq(xi),φ(x1n)=∏i=1nφ(xi).

Define the φ-tilted (reweighted) densities

p∗(x):=φ(x)p(x)Eφ(p),q∗(x):=φ(x)q(x)Eφ(q),Eφ(p):=∫φ(x)p(x)dμ(x),

(and similarly for Eφ(q)). Throughout this section, we assume that Eφ(p),Eφ(q)∈(0,∞). (Equivalently, ρ0w(p,q),ρ1w(p,q)∈(0,∞).) Then p∗,q∗ are probability densities and, under φ(x1n)=∏i=1nφ(xi), we have φ(x1n)p(x1n)=Eφ(p)n(p∗)⊗n(x1n) (and similarly for q).

Under Assumption 1, we have

∫Xnφ(x1n)p(x1n)dμ⊗n=(Eφ(p))n,∫Xnφ(x1n)q(x1n)dμ⊗n=(Eφ(q))n.

Let D denote the class of (possibly randomised) decision rules D:Xn→[0,1], where D(x1n) is the probability of deciding in favour of H1 after observing x1n. (Deterministic rules correspond to D∈{0,1}.)

For D∈D, define the context-sensitive type-I and type-II losses by

αφ(D):=EP⊗nφ(X1n)D(X1n)=∫Xnφ(x1n)D(x1n)p(x1n)dμ⊗n(x1n), (6)
βφ(D):=EQ⊗nφ(X1n)(1−D(X1n))=∫Xnφ(x1n)(1−D(x1n))q(x1n)dμ⊗n(x1n), (7)

and the corresponding total loss

Ln(D):=αφ(D)+βφ(D),Ln∗:=infD∈DLn(D).

Proposition 1 

(Pointwise form of the optimal total loss). For each n≥1,

Ln∗=∫Xnφ(x1n)min{p(x1n),q(x1n)}dμ⊗n(x1n). (8)

Moreover, an optimal (deterministic) decision rule is given by the likelihood-ratio test

Dn∗(x1n)=1{q(x1n)≥p(x1n)}

(with any measurable tie-breaking on {p=q}).

Proof. 

Fix x1n. The integrand in Ln(D) equals

φ(x1n)p(x1n)D(x1n)+q(x1n)(1−D(x1n))=φ(x1n)q(x1n)+D(x1n)(p(x1n)−q(x1n)).

Minimising pointwise over D(x1n)∈[0, 1] yields Dn∗(x1n)=1 when p(x1n)≤q(x1n) and Dn∗(x1n)=0 when p(x1n)>q(x1n), giving (8). □

We also use the weighted total variation distance

TVφ(P⊗n,Q⊗n):=12∫Xnφ(x1n)|p(x1n)−q(x1n)|dμ⊗n(x1n). (9)

Remark 1. 

For φ≡1, this reduces to the usual total variation distance. If φ vanishes on a non-negligible set, TVφ is, in general, a pseudo-distance; this is sufficient for our purposes since it characterises the weighted losses.

Using min{a,b}=12(a+b−|a−b|) in (8) and the definition of TVφ yields

Ln∗=12(Eφ(p))n+(Eφ(q))n−TVφ(P⊗n,Q⊗n). (10)

2.2. Weighted Affinities and Chernoff Information

We introduce the weighted Bhattacharyya affinities and the weighted Chernoff information. Assume that ραw(p,q)∈(0,∞) for all α∈[0, 1].

Definition 1 

(Weighted Bhattacharyya coefficient and distance). For α∈[0, 1] define the weighted α-skewed Bhattacharyya affinity coefficient

ραw(p,q):=∫Xφ(x)p(x)αq(x)1−αdμ(x), (11)

and the corresponding weighted Bhattacharyya distance

DB,αw(p,q):=−lnραw(p,q). (12)

Definition 2 

(Weighted Chernoff information). The weighted Chernoff information divergence between P and Q is

DCw(P,Q)=maxα∈[0,1]−ln∫Xφ(x)p(x)αq(x)1−αdμ(x)=maxα∈[0,1]DB,αw(p,q). (13)

A maximiser α∗=α∗(p,q) in (13) is called the optimal Chernoff parameter.

Remark 2. 

The weighted Chernoff information is symmetric: DCw(P,Q)=DCw(Q,P), since ραw(p,q)=ρ1−αw(q,p). In general, however, DCw does not satisfy the triangle inequality and is therefore a divergence rather than a metric.

Remark 3. 

Under Assumption 1, for every α∈[0, 1],

∫Xnφ(x1n)p(x1n)αq(x1n)1−αdμ⊗n(x1n)=ραw(p,q)n.

Consequently, the weighted Bhattacharyya distances are additive in n and the corresponding Chernoff exponent is of single-letter form.

3. Asymptotics and Information-Geometric Identities

Before stating the main theorem, we separate the two optimisations that appear throughout this section and should not be conflated. The total loss Ln(D)=αφ(D)+βφ(D) is a non-negative functional of the decision rule and is minimised over D∈D, giving the optimal loss Ln∗=infD∈DLn(D). The map α↦−lnραw(p,q) is a non-negative concave functional of the skewing parameter and is maximised over α∈[0,1], giving the weighted Chernoff information DCw(P,Q)=supα∈[0,1][−lnραw(p,q)]. Theorem 1 below connects the two via the single-letter asymptotic Ln∗=exp{−nDCw(P,Q)+o(n)}.

3.1. Asymptotics of the Optimal Sum of Losses

Recall from Section 2 that

Ln∗:=infD∈Dαφ(D)+βφ(D),

and that Proposition 1 yields (8). The next theorem identifies its exact logarithmic asymptotic rate with the weighted Chernoff information from Definition 2.

Theorem 1 

(Optimal sum of context-sensitive losses). Consider the binary hypotheses H0:X1n∼P⊗n versus H1:X1n∼Q⊗n, under Assumption 1. Assume also

supα∈[0,1]∫φ(x)|lnp(x)q(x)|p(x)αq(x)1−αdμ(x)<∞. (14)

Let D be the class of (possibly randomised) decision rules D:Xn→[0, 1], and let αφ(D), βφ(D) be defined by (6) and (7). Assume that p,q>0μ-a.e. and that ραw(p,q)∈(0,∞) for all α∈[0, 1].

Then, as n→∞,

Ln∗=exp{−nDCw(P,Q)+o(n)}. (15)

Equivalently,

limn→∞−1nlnLn∗=DCw(P,Q).

Proof. 

By Proposition 1,

Ln∗=∫Xnφ(x1n)min{p(x1n),q(x1n)}dμ⊗n(x1n).

For any α∈[0,1], min{a,b}≤aαb1−α, hence, by factorisation,

Ln∗≤ραw(p,q)n.

Taking the infimum over α∈[0,1] gives

lim infn→∞−1nlnLn∗≥DCw(P,Q).

Now fix α∗∈argminα∈[0,1]ραw(p,q) and define

rα∗(x):=φ(x)p(x)α∗q(x)1−α∗ρα∗w(p,q),Sn:=∑i=1nlnp(Xi)q(Xi).

A direct change of measure yields

Ln∗=ρα∗w(p,q)nErα∗⊗ne−α∗Sn1{Sn>0}+e(1−α∗)Sn1{Sn≤0}.

The bracket is bounded above by 1.

Let F(α):=lnραw(p,q), it is easy to check that F(α) is a convex function. Under the regularity assumption of (14),

F′(α)=Erαlnp(X)q(X).

If α∗∈(0, 1), then F′(α∗)=0. Hence, in view of LLN, Sn/n→0 in rα∗-probability. Therefore, for every ε>0,

Erα∗⊗ne(1−α∗)Sn1{Sn≤0}+e−α∗Sn1{Sn>0}≥e−εnrα∗⊗n|Sn|≤εn=exp{o(n)}.

Combined with the upper bound by 1, this implies

Ln∗=exp{−nDCw(P,Q)+o(n)}.

In the boundary case α∗=0, we have the mean value m>0, and 1(Sn>0)e−α∗Sn|α∗=0→1 a.s. as n→∞ by the strong LLN. Similarly, in the case α∗=1, we have the mean value m≤0, and 1(Sn≤0)e(1−α∗)Sn|α∗=1→1 a.s. as n→∞. This completes the proof. □

Corollary 1 

(Asymptotics of the weighted total variation). Under the assumptions of Theorem 1, the weighted total variation satisfies

TVφ(P⊗n,Q⊗n)=12(Eφ(p))n+(Eφ(q))n−exp{−nDCw(P,Q)+o(n)},n→∞, (16)

where Eφ(r)=∫Xφ(x)r(x)dμ(x).

Proof. 

Combine the identity (10) with (15). □

Remark 4. 

The weighted α-skewed Bhattacharyya distance (12) appears in many papers, see e.g., [12]. Definition 2 shows that the weighted Chernoff information divergence is the maximally skewed weighted Bhattacharyya distance.

3.2. Exponential-Family Representation and Uniqueness of α∗

In order to develop an effective computational procedure and to connect the weighted Chernoff information to information geometry, we embed the weighted geometric mixtures of p and q into a one-parameter likelihood-ratio exponential family. For α∈[0, 1] define

Zpq(α):=∫Xφ(x)p(x)αq(x)1−αdμ(x)=ραw(p,q), (17)

and the corresponding normalised density

Epq=(pq)α(x):=φ(x)p(x)αq(x)1−αZpq(α):α∈[0, 1]. (18)

By assumption Zpq(α)∈(0,∞), so (pq)α is well-defined as a probability density w.r.t. μ.

Set t(x):=lnp(x)q(x) and kpq(x):=lnφ(x)+lnq(x). Then, (pq)α admits the exponential-family form

(pq)α(x)=expαt(x)−Fpq(α)+kpq(x), (19)
Fpq(α):=lnZpq(α)=−DB,αw(p,q). (20)

In particular, t(X) is a sufficient statistic for the family Epq.

The log-normaliser Fpq is convex on [0, 1]; if lnpq is not μ-a.e. constant on {φ>0}, then Fpq is strictly convex and the maximiser α∗ in (13) is unique. By Hölder’s inequality,

Zpq(α)=∫X(φp)α(φq)1−αdμ≤(Eφ(p))α(Eφ(q))1−α.

Finally, note that Zpq(1)=Eφ(p) and Zpq(0)=Eφ(q); hence,

(pq)1(x)=φ(x)p(x)Eφ(p),(pq)0(x)=φ(x)q(x)Eφ(q),

so Epq is an exponential arc between the tilted versions of P and Q. By this definition, the following identities hold:

DCw(p,q)=DB,α∗(p,q)w(p,q)=DB,α∗(q,p)w(q,p)=DCw(q,p). (21)

3.3. Weighted Bregman Divergence and Information-Geometric Identities

3.3.1. Weighted KL Divergence and Weighted Bregman Divergence

This subsection collects information-geometric identities useful for analysing ραw and for computing the optimal Chernoff parameter α∗. We follow [3] for weighted Bregman divergences.

Let E={pθ:θ∈Θ⊂Rd} be a regular exponential family of densities (with respect to μ),

pθ(x)=exp{θTt(x)−F(θ)+k(x)},x∈X. (22)

For a density r, set Eφ(r):=∫Xφ(x)r(x)dμ(x) and write Eφ(θ):=Eφ(pθ).

Assume Eφ(θ)∈(0,∞) for θ∈Θ and define the tilted log-normaliser

F^(θ):=ln∫Xφ(x)eθTt(x)+k(x)dμ(x)=F(θ)+lnEφ(θ). (23)

Equivalently, the tilted density is

pθ∗(x)=φ(x)pθ(x)Eφ(θ). (24)
Definition 3 

(Weighted Kullback–Leibler divergence). For densities p,q on X define

DKLw(p∥q):=∫Xφ(x)p(x)lnp(x)q(x)dμ(x), (25)

whenever the integral is well defined in (−∞,∞].

Definition 4 

(Weighted Bregman divergence). The weighted Bregman divergence associated with (F,F^) is

Bφ,Fw(θ1,θ2):=eF^(θ2)−F(θ2)F(θ1)−F(θ2)−(θ1−θ2)T∇F^(θ2)=Eφ(θ2)F(θ1)−F(θ2)−(θ1−θ2)T∇F^(θ2). (26)
Proposition 2 

(Weighted KL as weighted Bregman divergence). For a regular exponential family E={Pθ,θ∈Θ}, assume that the integral in (25) is well-defined in (−∞,∞]. Then for any θ1,θ2∈Θ,

DKLw(pθ1∥pθ2)=Bφ,Fw(θ2,θ1). (27)
Proof. 

This identity is stated in [3] (Proposition 4.1); we give a short derivation for completeness. By (22),

lnpθ1(x)pθ2(x)=(θ1−θ2)Tt(x)−(F(θ1)−F(θ2)).

Substituting this into (25) yields

DKLw(pθ1∥pθ2)=(θ1−θ2)T∫Xφ(x)t(x)pθ1(x)dμ(x)−(F(θ1)−F(θ2))Eφ(θ1).

Using (23) and differentiation under the integral sign (regularity of E),

∇F^(θ1)=∫Xφ(x)t(x)eθ1Tt(x)+k(x)dμ(x)∫Xφ(x)eθ1Tt(x)+k(x)dμ(x)=∫Xφ(x)t(x)pθ1(x)dμ(x)Eφ(θ1).

Hence, ∫φtpθ1dμ=Eφ(θ1)∇F^(θ1), and therefore

DKLw(pθ1∥pθ2)=Eφ(θ1)F(θ2)−F(θ1)−(θ2−θ1)T∇F^(θ1)=Bφ,Fw(θ2,θ1),

which proves (27). □

Proposition 3 

(Primal–dual identities for (weighted) Bregman divergences). Let F be a log-normaliser of a regular exponential family and let F∗ denote its Legendre transform. Write θ∗=∇F(θ) and θ=∇F∗(θ∗).

(a) Weighted one-parameter identity. Assume d=1 (one-parameter case) and let θi∗:=F′(θi). Then, the following weighted analogue of the classical Bregman duality holds:

Bφ,Fw(θ1,θ2)=Bφ,F∗w(θ2∗,θ1∗)−(θ1−θ2)lnEφ(θ2)+(θ2∗−θ1∗)lnEφ(θ1), (28)

where Bφ,Fw is as in Definition 4 and Bφ,F∗w is defined analogously (with F replaced by F∗ and with the convention Eφ(θ∗):=Eφ(θ) under θ=∇F∗(θ∗)).

(b) Classical identity. For any d≥1, the (unweighted) Bregman divergence admits the standard Legendre representation

BF(θ0,θ1)=F(θ0)+F∗(θ1∗)−θ0Tθ1∗,θ1∗=∇F(θ1), (29)

where BF(θ0,θ1)=F(θ0)−F(θ1)−(θ0−θ1)T∇F(θ1) is the usual (unweighted) Bregman divergence.

Proof. 

Part (a) is a weighted extension of the classical duality BF(θ1,θ2)=BF∗(θ2∗,θ1∗) and follows by combining the weighted representation (26) with Legendre relations; see also [3]. Part (b) is standard. □

3.3.2. Weighted Chernoff/Bhattacharyya Quantities Inside an Exponential Family

Let pθ1,pθ2∈E and θα:=αθ1+(1−α)θ2. A direct calculation yields

ραw(pθ1,pθ2)=ln∫Xφ(x)pθ1(x)αpθ2(x)1−αdμ(x)=F^(θα)−αF(θ1)−(1−α)F(θ2). (30)

Consequently,

DB,αw(pθ1,pθ2)=αF(θ1)+(1−α)F(θ2)−F^(θα)=UF,α(θ1,θ2)−lnEφ(θα), (31)

where UF,α(θ1,θ2):=αF(θ1)+(1−α)F(θ2)−F(θα) is the (unweighted) Jensen/Burbea–Rao divergence induced by F. In particular, when φ≡1 we have F^≡F and DB,αw(pθ1,pθ2)=UF,α(θ1,θ2).

Remark 5 

(Geometric mixtures and tilting by φ). In particular, when φ≡1, we have F^≡F and the normalised geometric mixture pθ1αpθ21−α belongs to the same exponential family, namely, ∝pθα with θα=αθ1+(1−α)θ2.

Proposition 4 

(Optimal Chernoff parameter in an exponential family). Assume that F^ is strictly convex on the segment [θ1,θ2] and that the maximiser α∗∈(0,1) exists. Then, α∗ is unique and satisfies

(θ1−θ2)T∇F^(θα∗)=F(θ1)−F(θ2),θα∗=α∗θ1+(1−α∗)θ2, (32)

with ∇F^(θ)=Epθ∗[t(X)].

Proof. 

Differentiate (31) with respect to α and use ddαθα=θ1−θ2. Strict convexity of F^ on [θ1,θ2] implies strict concavity of α↦DB,αw(pθ1,pθ2), hence uniqueness. □

Proposition 5 

(Chernoff information as a Jensen-type divergence and a Bregman bisector). Let pθ1,pθ2∈E and assume that the maximiser α∗∈(0,1) in Definition 2 exists and is unique. Set θα=αθ1+(1−α)θ2. Then

DCw(pθ1,pθ2)=DB,α∗w(pθ1,pθ2)=α∗F(θ1)+(1−α∗)F(θ2)−F^(θα∗). (33)

Moreover, θα∗ is characterised by the weighted Bregman bisector condition

Bφ,Fw(θ1,θα∗)=Bφ,Fw(θ2,θα∗), (34)

and the common value recovers the Chernoff information as

DCw(pθ1,pθ2)=1Eφ(θα∗)Bφ,Fw(θ1,θα∗)−lnEφ(θα∗) (35)
=1Eφ(θα∗)Bφ,Fw(θ2,θα∗)−lnEφ(θα∗). (36)

In the special case φ≡1, we have F^≡F and Eφ(θ)≡1, so that (33) reduces to the classical Jensen divergence induced by F and (35) becomes DC(pθ1,pθ2)=BF(θ1,θα∗)=BF(θ2,θα∗).

Proof. 

Equation (33) is (31) at α=α∗. For (34), expand Bφ,Fw(θi,θα∗)=Eφ(θα∗)F(θi)−F(θα∗)−(θi−θα∗)T∇F^(θα∗) and use (32) to see that the difference vanishes. Finally, substituting θ1−θα∗=(1−α∗)(θ1−θ2) into Bφ,Fw(θ1,θα∗)/Eφ(θα∗) and using (32) gives

1Eφ(θα∗)Bφ,Fw(θ1,θα∗)=α∗F(θ1)+(1−α∗)F(θ2)−F(θα∗).

Since F^(θα∗)=F(θα∗)+lnEφ(θα∗), this yields (35). □

3.3.3. Derivative and Weighted KL

Recall Fpq(α)=lnZpq(α)=lnραw(p,q). In view of (14 ), the differentiation under the integral sign is justified, and we have

Fpq′(α)=E(pq)αlnp(X)q(X), (37)

where (pq)α is the Chernoff-tilted density from (18). In particular,

Fpq′(1)=1Eφ(p)∫Xφ(x)p(x)lnp(x)q(x)dμ(x)=1Eφ(p)DKLw(p∥q). (38)

Analogously, Fpq′(0)=−1Eφ(q)DKLw(q∥p).

3.3.4. Chernoff–KL

Lemma 1. 

Let α∗ be a maximiser in Definition 2 and assume that α∗∈(0,1) (so that Fpq′(α∗)=0 below). Set Fpq(α):=lnραw(p,q),rα:=(pq)α. Then

DCw(p,q)=DKLrα∗∥r1−lnEφ(p)=DKLrα∗∥r0−lnEφ(q), (39)

where r1(x)=φ(x)p(x)/Eφ(p) and r0(x)=φ(x)q(x)/Eφ(q).

Here, DKL denotes the standard (unweighted) Kullback–Leibler divergence.

Proof. 

A direct computation yields, for α∈[0, 1],

DKL(rα∥r1)=−(1−α)Fpq′(α)−Fpq(α)+Fpq(1),DKL(rα∥r0)=αFpq′(α)−Fpq(α)+Fpq(0).

At α=α∗, we have Fpq′(α∗)=0. Since Fpq(1)=lnEφ(p) and Fpq(0)=lnEφ(q), the claim follows from DCw(p,q)=−Fpq(α∗). □

Corollary 2 

(Chernoff information as a Bregman divergence on the Chernoff arc). Let Fpq(α):=lnραw(p,q) and define the one-dimensional Bregman divergence

BFpq(a,b):=Fpq(a)−Fpq(b)−(a−b)Fpq′(b).

Assume that the maximiser α∗∈(0,1) in Definition 2 is interior, so that Fpq′(α∗)=0. Then

DCw(p,q)=BFpq(1,α∗)−lnEφ(p)=BFpq(0,α∗)−lnEφ(q). (40)

Equivalently,

BFpq(1,α∗)=DKL(rα∗∥r1)=DCw(p,q)+lnEφ(p),BFpq(0,α∗)=DKL(rα∗∥r0)=DCw(p,q)+lnEφ(q),

with rα=(pq)α, r1=φp/Eφ(p) and r0=φq/Eφ(q).

Proof. 

In the Chernoff exponential family {rα} with log-normalizer Fpq, the KL–Bregman identity gives DKL(rα∗∥r1)=BFpq(1,α∗) and DKL(rα∗∥r0)=BFpq(0,α∗). Since Fpq′(α∗)=0 and Fpq(1)=lnEφ(p), Fpq(0)=lnEφ(q), we obtain

BFpq(1,α∗)=−Fpq(α∗)+Fpq(1)=DCw(p,q)+lnEφ(p),

and similarly for 0. Substituting this into Lemma 1 yields (40). □

Remark 6 

(One-parameter case). Assume d=1, θ1≠θ2, and that the maximiser α∗∈(0,1) in Definition 2 is interior. Assume moreover that F^′ is strictly increasing on Θ and set G^=(F^′)−1. Then (32) yields

α∗=1θ1−θ2G^F(θ1)−F(θ2)θ1−θ2−θ2. (41)

When φ≡1, we have F^≡F and (41) reduces to the classical formula.

To illustrate the general identities above, we provide explicit expressions for DB,αw and DCw in several parametric settings (Gaussian, Poisson, and exponential); see Section 4.

Remark 7. 

The Bregman representation (40) identifies DCw(P,Q) with a Bregman divergence on the tilted log-normaliser F^; geometrically, the optimiser α∗ marks the intersection of the exponential geodesic of the tilted family {φpαq1−α}α∈[0,1] with the weighted Kullback–Leibler bisector, generalising the unweighted characterisation of [11,12]. In the exponential-family setting, the computation of DCw therefore reduces to F^ and its gradient: once F^ is available in closed form, α∗ is determined by (41) in the one-parameter case and by a monotone equation in the natural-parameter space in general, without evaluating ραw for each α. The examples of Section 4 exemplify this reduction.

3.4. Tilted Weighted Likelihood and Concentration Bounds

Although the optimal rule in the context-sensitive problem is still the usual likelihood-ratio test q/p (cf. Section 3), it is convenient to work with the tilted ratio q∗/p∗. The factor φ cancels pointwise in q∗/p∗ and enters only through the normalisation constants Eφ(p) and Eφ(q). We record two consequences: a large-deviation representation for L∗/n via the cumulant generating functions ψP,ψQ and their Legendre transforms and a finite-n concentration bound based on a martingale argument.

For the tilted distributions, the log-likelihood takes the form

L∗(X1n)=L∗(X1,…,Xn)=∑i=1nlnq∗(Xi)p∗(Xi)=∑i=1nlnq(Xi)p(Xi)−nlnEφ(q)+nlnEφ(p). (42)

Here Eφ(p)=∫φ(x)p(x)dμ(x).

In particular, since

lnq∗(x)p∗(x)=lnq(x)p(x)+lnEφ(p)−lnEφ(q),

we may equivalently rewrite likelihood-ratio threshold rules in terms of L∗. For example,

∑i=1nlnq(Xi)p(Xi)≥0⟺L∗(X1n)≥nlnEφ(p)−lnEφ(q).

Thus, L∗ is the usual log-likelihood ratio, shifted by a constant determined by the context weight φ.

The log of the moment generating function and its Legendre transform take the form

ψP(α)=lnEPeαlnq∗(X)p∗(X)=ln∫Xq(x)αp(x)1−αdμ(x)−αlnEφ(q)+αlnEφ(p),IP(r)=supααr−ψP(α), (43)

where α ranges over the set {α∈R:ψP(α)<∞} (and similarly for ψQ).

Similarly,

ψQ(α):=lnEQeαlnq∗(X)p∗(X)=lnEPelnq(X)p(X)+αlnq∗(X)p∗(X)=ln∫Xq(x)α+1p(x)−αdμ(x)−αlnEφ(q)+αlnEφ(p). (44)

This implies the relation of Legendre transforms

IQ(r)=IP(r)−r+lnEφ(p)−lnEφ(q). (45)

In particular, IP(0) may be treated as a natural weighted version of the Chernoff divergence between q and p:

IP(0)=supα−ln∫Xq(x)αp(x)1−αdμ(x)+αlnEφ(q)−αlnEφ(p)=:D^Cw(q,p). (46)

Interpretation. The value IP(0) is the Chernoff–Cramér exponent controlling the tail event {L∗/n≥0} under P, i.e., (under standard regularity assumptions), P(L∗(X1n)≥0)≍e−nIP(0). In the unweighted case φ≡1, we have Eφ(p)=Eφ(q)=1 and IP(0) reduces to the classical Chernoff information between p and q. We also stress that D^Cw(q,p)=IP(0) is a tilted-likelihood exponent and is distinct from the weighted Chernoff information DCw(P,Q) from Definition 2, which governs the optimal sum of context-sensitive losses.

Non-Asymptotic Concentration via a Doob Martingale

The rate functions IP and IQ capture the exponential scale of deviations of L∗/n as n→∞. To obtain explicit finite-n bounds, we now apply a standard martingale method to L∗ under Q.

Consider the filtration Fk=σ(X1,…,Xk) and define the random variables {Uk,k=0,…,n} by

Uk=EQL∗(X1,…,Xn)|Fk=∑j=1klnq(Xj)p(Xj)+(n−k)DKL(Q∥P)−nlnEφ(q)+nlnEφ(p), (47)

where DKL(Q∥P)=∫q(x)lnq(x)p(x)dμ(x) stands for the (unweighted) Kullback–Leibler divergence of Q and P. Then

Uk−Uk−1=lnq(Xk)p(Xk)−DKL(Q∥P),k=1,…,n. (48)

Observe that {Uk,Fk} is a martingale w.r.t. Q.

Assume now that d<∞ and σ2<∞, where d=supx∈Xlnq(x)p(x)−DKL(Q∥P) and

σ2=EQ(Uk−Uk−1)2|Fk−1=∫Xq(x)lnq(x)p(x)−DKL(Q∥P)2dμ(x). (49)

In view of a refined Azuma–Hoeffding/McDiarmid inequality [13,14],

PQL∗(X1,…,Xn)>(DKL(Q∥P)+β)n−(lnEφ(q)−lnEφ(p))n≤exp−nDδ+γ∗1+γ∗∥γ∗1+γ∗, (50)

where δ=σ2d2, γ∗=β∗d, β∗=β−lnEφ(q)+lnEφ(p) and D(p∥q)=plnpq+(1−p)ln1−p1−q stands for the Kullback–Leibler divergence between the two Bernoulli distributions (p,1−p) and (q,1−q).

We use the following modified version of Azuma–Hoeffding inequality; see [14].

Lemma 2. 

Let {Uk,Fk} be a discrete-time real-valued martingale. Assume that, for some constants d,σ>0, the following two requirements are satisfied a.s. for every k∈{1,…,n}:

|Uk−Uk−1|≤d,Var[Uk−Uk−1|Fk−1]≤σ2. (51)

Then, for every β≥0,

P|Un−U0|≥βn≤2exp−nDδ+γ1+γ∥γ1+γ, (52)

where δ=σ2d2 and γ=βd. (Note that δ∈[0,1] automatically whenever |Uk−Uk−1|≤d a.s.)

In particular, the one-sided bound P(Un−U0≥βn)≤exp{−nD(·)} holds.

Theorem 2. 

Set

β∗=β−lnEφ(p)+lnEφ(q),γ∗=β∗d.

Under conditions d<∞, σ2<∞, and β∗≥0,

PQL∗(X1,…,Xn)≥βn≤exp−nDδ+γ∗1+γ∗∥γ∗1+γ∗. (53)

Lemma 2 is quoted from [14]. Theorem 2 is its direct application to the tilted log-likelihood ratio (42); the only dependence on the context weight φ is through Eφ(p) and Eφ(q).

4. Examples and Applications

The identities of Section 3 reduce the computation of DB,αw and DCw to the single-letter weighted affinity

ραw(p,q)=∫φ(x)p(x)αq(x)1−αdμ(x),

followed by optimisation over α∈[0,1]. We work this out for Gaussian, Poisson, and exponential families, highlighting how the context weight φ modifies the classical formulas. When φ≡1, the expressions reduce to the standard unweighted Bhattacharyya and Chernoff quantities; more involved non-exponential-family computations (such as the Cauchy location–scale family) are deferred to the Appendix A.

4.1. A Numerical Illustration

This subsection illustrates the behaviour of α∗ and DCw under a non-trivial factorised weight and serves as a direct numerical verification of the Bregman identities of Section 3.3: for the model below the affinity ραw is available in closed form, and we check that closed-form evaluation and direct numerical integration agree to machine precision.

Consider the asymmetric Gaussian hypotheses

H0:P=N(μ0,σ02),H1:Q=N(μ1,σ12),(μ0,σ02)=(0,1),(μ1,σ12)=(3,2),

with a non-indicator factorised weight

φ(x)=exp−β(x−x0)2,x0=0,β≥0. (54)

At β=0, one has φ≡1 and the unweighted Chernoff information is recovered. For β>0, the weight concentrates near x0=μ0; in particular, (54) is not an indicator-type weight, so the weighted problem does not reduce to the unweighted Chernoff information on a restricted domain.

The asymmetry σ02≠σ12 and the centring of φ at the H0 mean are essential for the illustration. In a fully symmetric configuration (σ0=σ1, μ1=−μ0, x0=0), the problem is invariant under α↔1−α, so the optimum is pinned to α∗=1/2 for every β and the effect of the weight on the Chernoff compromise is invisible. Asymmetric hypotheses are precisely where the weighted formalism is operationally distinct from the classical one, and it is this distinction that the numerics below is designed to expose.

Writing A(α)=α/σ02+(1−α)/σ12+2β, B(α)=αμ0/σ02+(1−α)μ1/σ12+2βx0, and C(α)=αμ02/σ02+(1−α)μ12/σ12+2βx02, a direct Gaussian integration yields

lnραw(p,q)=12ln2πA(α)−α2ln(2πσ02)−1−α2ln(2πσ12)−12C(α)−B(α)2A(α), (55)

and maximising (55) over α∈[0, 1] gives α∗(β) and DCw(P,Q)(β). Table 1 reports their values at three selected β. Direct numerical integration of ραw from its definition agrees with (55) to machine precision on all tabulated entries, which confirms the Bregman identities of Section 3.3 numerically for this example.

Table 1.

Optimal skewing parameter and weighted Chernoff information for the Gaussian example (54), obtained by maximising (55).

β α∗(β) DCw(P,Q)
0 (unweighted) 0.4153 0.8018
1/16 0.3355 0.9827
1/4 0.0963 1.4935

The monotone growth of β↦DCw and the leftward shift of α∗(β) illustrate a qualitative conclusion of Section 3: localising φ near μ0 preferentially retains observations that are more probable under H0 and thereby increases the effective discrimination rate, while simultaneously moving the optimal tilting towards the H0 side. The classical unweighted limit is recovered at β=0.

In the language of hypothesis testing, α∗ is the parameter that balances the exponential rates of the type-I and type-II losses at the Bayes optimum: the type-I exponent equals α∗DCw and the type-II exponent equals (1−α∗)DCw (cf. Section 3). A leftward shift of α∗ therefore corresponds to reallocating the available exponential budget towards faster decay of the type-II loss at the expense of the type-I loss, which is the optimal response to a weight that concentrates mass in the region where H0 is more plausible.

Data and Code Availability

A Jupyter/Colab notebook reproducing Table 1 and Figure 1, Figure 2 and Figure 3, together with the direct-integration verification of (55), is archived on Zenodo [16] and mirrored on GitHub.

Figure 1.

Figure 1

The map α↦−lnραw(p,q) for the Gaussian hypotheses N(0,1), N(3,2) with weight (54), for β∈{0,1/16,1/4}. The optimum α∗ is marked by a bullet on each curve and shifts to the left as β increases.

Figure 2.

Figure 2

Optimal skewing parameter α∗(β) for the Gaussian example. The dashed line marks the unweighted value α∗(0).

Figure 3.

Figure 3

Weighted Chernoff information β↦DCw(P,Q). The dashed line marks the classical value DC recovered at β=0.

4.2. Gaussian Models

Throughout this subsection, the reference measure is the Lebesgue measure on Rd. We compute the weighted Bhattacharyya coefficient

ραw(P,Q)=∫Rdφ(x)p(x)αq(x)1−αdx,α∈[0,1],

together with the weighted Bhattacharyya distance DB,αw(P,Q):=−lnραw(P,Q) and the weighted Chernoff information DCw(P,Q)=maxα∈[0, 1]DB,αw(P,Q) (Definition 2). Note that, unlike the unweighted case, ραw is not restricted to [0, 1] and DB,αw (hence also DCw) may take negative values.

Example 1 

(Gaussian weighted Bhattacharyya coefficient with exponential weight). Let P=N(μ1,Σ1) and Q=N(μ2,Σ2) on Rd, where Σ1≻0 and Σ2≻0, and let φ(x)=eγTx for some γ∈Rd. Denote by p,q the corresponding densities. For α∈[0, 1] define

Σα:=αΣ1−1+(1−α)Σ2−1−1,μ˜α:=ΣααΣ1−1μ1+(1−α)Σ2−1μ2+γ.

Then

ραw(P,Q)=∫RdeγTxp(x)αq(x)1−αdx=|Σα|1/2|Σ1|α/2|Σ2|(1−α)/2exp−12αμ1TΣ1−1μ1+(1−α)μ2TΣ2−1μ2−μ˜αTΣα−1μ˜α. (56)

Consequently,

DB,αw(P,Q)==12αμ1TΣ1−1μ1+(1−α)μ2TΣ2−1μ2−μ˜αTΣα−1μ˜α+ln|Σ1|α|Σ2|1−α|Σα|. (57)

In particular, setting γ=0 (i.e., φ≡1) reduces (57) to the classical (unweighted) Gaussian Bhattacharyya distance; see, e.g., [12].

Corollary 3 

(Common covariance). In Example 1, assume Σ1=Σ2=Σ≻0 and keep the exponential weight φ(x)=eγTx. Set δ:=μ1−μ2, ∥v∥Σ−12:=vTΣ−1v, and μα:=αμ1+(1−α)μ2. Then, for any α∈[0, 1],

ραw(P,Q)=∫RdeγTxp(x)αq(x)1−αdx=exp−α(1−α)2∥δ∥Σ−12+γTμα+12γTΣγ, (58)

and therefore

DB,αw(P,Q)=−lnραw(P,Q)=α(1−α)2∥δ∥Σ−12−γTμα−12γTΣγ. (59)

If μ1≠μ2 and the unconstrained maximiser

α˜=12−γTδ∥δ∥Σ−12

belongs to (0, 1), then α∗=α˜; otherwise the maximum over α∈[0, 1] is attained at the nearest boundary point α∗∈{0,1}. In all cases,

DCw(P,Q)=maxα∈[0,1]DB,αw(P,Q)=DB,α∗w(P,Q).

In particular, for γ=0 (i.e., φ≡1) we recover α∗=1/2 and DC(P,Q)=∥δ∥Σ−12/8.

Proof. 

The expression for ραw follows by simplifying Example 1 under Σ1=Σ2=Σ, which makes the determinant prefactor equal to 1 and yields a Gaussian MGF term exp(γTμα+12γTΣγ). The maximiser follows by differentiating (59) in α. □

Choosing an exponential weight φ(x)=eγTx corresponds to exponential tilting: for a Gaussian X∼N(μ,Σ), this tilting keeps the covariance and shifts the mean to μ+Σγ (with normalisation factor exp(γTμ+12γTΣγ)), which is why the weighted affinities remain available in closed form. In particular, the optimal Chernoff parameter is no longer forced to be α∗=1/2 and, as (59) shows, sufficiently strong tilting can push the maximiser to the boundary α∗∈{0,1}.

4.3. Poisson Models

Example 2 

(Poisson model with exponential weight). Let X=N0={0,1,2,…} and let μ be the counting measure on X. Fix two hypotheses P=Poi(λ1) and Q=Poi(λ2) with λ1,λ2>0, and write p=pλ1 and q=qλ2. Throughout this subsection we work under the standing assumption of Section 2, namely, that the observations X1,…,Xn are i.i.d. (distributed as P under H0 and as Q under H1), and that the weight φ factorises across observations (Assumption 1). We still consider the exponential weight φγ(k)=eγk,γ∈R. (For γ=0 we recover the unweighted case φ≡1.) Equivalently, setting ε:=eγ>0, the weight takes the form φ(k)=εk; this reparameterisation is convenient in applications where ε∈(0, 1) models a per-event discount factor, while γ∈R is the natural parameter for the exponential-family calculations below. The two parameterisations are equivalent.

For α∈[0, 1], set

λα:=λ1αλ21−α.

(a) Weighted Bhattacharyya coefficient and Chernoff arc.   A direct summation gives

ραw(P,Q)=∑k=0∞φγ(k)p(k)αq(k)1−α=exp−αλ1−(1−α)λ2+eγλα. (60)

Hence, by Definition 1,

DB,αw(P,Q)=−lnραw(P,Q)=αλ1+(1−α)λ2−eγλα. (61)

Moreover, the normalised weighted geometric mixture (Chernoff-tilted density) from (18) takes the form

(pq)α(k)=φγ(k)p(k)αq(k)1−αραw(P,Q)=exp{−eγλα}(eγλα)kk!=Poi(eγλα).

(b) Optimal Chernoff parameter.   If λ1≠λ2, then α↦DB,αw(P,Q) is strictly concave on [0, 1] since

d2dα2DB,αw(P,Q)=−eγλαlnλ1λ22<0;

hence, the maximiser α∗ in Definition 2 is unique. Differentiating (61) yields the critical point condition

0=ddαDB,αw(P,Q)=λ1−λ2−eγλαlnλ1λ2.

Equivalently, the (unconstrained) critical point α=α˜ satisfies

λα˜=e−γL(λ1,λ2),L(λ1,λ2):=λ1−λ2lnλ1−lnλ2.

In contrast to the unweighted case (γ=0), the context tilt γ may push the optimal Chernoff parameter to the boundary α∗∈{0,1}.

Thus, the unconstrained maximiser is

α˜=lnL(λ1,λ2)−γ−lnλ2lnλ1−lnλ2,

and the maximiser on [0, 1] is α∗=Π[0,1](α˜), where

Π[0,1](a):=min{1,max{0,a}}.

Finally,

DCw(P,Q)=maxα∈[0,1]DB,αw(P,Q)=DB,α∗w(P,Q).

If λ1=λ2, then ραw(P,Q) does not depend on α and DCw(P,Q)=DB,αw(P,Q) for any α∈[0, 1].

Derivation of (60). For k∈N0,

p(k)αq(k)1−α=exp{−αλ1−(1−α)λ2}λαkk!,

so multiplying by eγk and summing over k gives

ραw(P,Q)=exp{−αλ1−(1−α)λ2}∑k≥0(eγλα)k/k!=exp{−αλ1−(1−α)λ2+eγλα}.

4.4. Exponential Models

Example 3 

(Exponential model with exponential weight). Let X=R+=[0,∞) with Lebesgue measure. Fix two hypotheses P=Exp(λ1) and Q=Exp(λ2) with rates λ1,λ2>0, and write

p(x)=λ1e−λ1x1{x≥0},q(x)=λ2e−λ2x1{x≥0}.

Consider the exponential weight φγ(x)=eγx with

γ<min{λ1,λ2},

so that ραw(P,Q)∈(0,∞) for all α∈[0, 1]. For α∈[0, 1] set

λα:=αλ1+(1−α)λ2.

(a) Weighted Bhattacharyya coefficient and Chernoff arc.   A direct computation gives

ραw(P,Q)=∫0∞eγxp(x)αq(x)1−αdx=λ1αλ21−αλα−γ.

Hence

DB,αw(P,Q)=−lnραw(P,Q)=ln(λα−γ)−αlnλ1−(1−α)lnλ2.

Moreover, the Chernoff-tilted density (pq)α from (18) is again exponential:

(pq)α(x)=eγxp(x)αq(x)1−αραw(P,Q)=(λα−γ)e−(λα−γ)x1{x≥0}=Exp(λα−γ).

(b) Optimal Chernoff parameter.   If λ1≠λ2, then α↦DB,αw(P,Q) is strictly concave on [0, 1]; hence, the maximiser α∗ in Definition 2 is unique. Differentiating yields the critical point condition

λ1−λ2λα−γ=lnλ1λ2.

Equivalently, the (unconstrained) critical point α=α˜ satisfies

λα˜−γ=L(λ1,λ2),L(λ1,λ2):=λ1−λ2lnλ1−lnλ2,

so that

α˜=γ+L(λ1,λ2)−λ2λ1−λ2.

The maximiser on [0, 1] is α∗=Π[0,1](α˜) (projection onto [0, 1]), and

DCw(P,Q)=maxα∈[0,1]DB,αw(P,Q)=DB,α∗w(P,Q).

If λ1=λ2=λ, then ραw(P,Q)=λ/(λ−γ) does not depend on α, so any α∈[0, 1] is optimal and DCw(P,Q)=ln(λ−γ)−lnλ. Setting γ=0 (i.e., φ≡1) recovers the classical unweighted expressions.

Additional Example (Baseline, Non-Exponential Family)

Appendix A contains a closed-form illustration for the Cauchy location–scale family. Since the Cauchy family is not an exponential family, this example complements the main text by showing that, even in the unweighted baseline case φ≡1, the Bhattacharyya coefficient (in particular ρ1/2) and the Chernoff information may involve special functions (complete elliptic integrals). For nontrivial weights φ, the symmetry ρα=ρ1−α (hence α∗=1/2) typically fails and a comparable closed form is not available, so we keep the baseline Cauchy computation in the appendix.

4.5. Extension to M-ary Hypothesis Testing

We now record the finite-M analogue of Theorem 1. The key observation is that the optimal M-ary pointwise loss is squeezed between pairwise minima (Lemma 3), and each pairwise term has logarithmic rate given by the corresponding weighted Chernoff information. Hence the overall M-ary rate is determined by the closest pair in terms of DCw.

Fix an integer M≥2 and let P1,…,PM be probability measures on X dominated by μ, with strictly positive densities p1,…,pM. Let X1n=(X1,…,Xn) be i.i.d. under each hypothesis Hi:X1n∼Pi⊗n. Assume that the weight function factorises as in Assumption 1.

Assume moreover that for every 1≤i<j≤M and every α∈[0, 1],

ραw(pi,pj)=∫Xφ(x)pi(x)αpj(x)1−αdμ(x)∈(0,∞),

so that all pairwise weighted Chernoff information values are well-defined and inequality

maxi≠jsupα∈[0, 1]∫φ(x)|lnpi(x)pj(x)|pi(x)αpj(x)1−αdμ(x)<∞ (62)

holds true.

A (deterministic) M-ary decision rule is a measurable map δn:Xn→{1,…,M}. Define the context-sensitive loss under Hi by

Li,n(δn):=EPi⊗nφ(X1n)1{δn(X1n)≠i},

and the total loss

Ln,M(δn):=∑i=1MLi,n(δn),Ln,M∗:=infδnLn,M(δn).

Proposition 6 

(Pointwise form of the optimal M-ary total loss). For each n≥1,

Ln,M∗=∫Xnφ(x1n)∑i=1Mpi(x1n)−max1≤j≤Mpj(x1n)dμ⊗n(x1n), (63)

where pi(x1n)=∏k=1npi(xk). Moreover, an optimal rule is given by the maximum-likelihood classifier

δn∗(x1n)∈argmax1≤j≤Mpj(x1n)

(with any measurable tie-breaking).

Proof. 

Fix δn. Using ∑i=1M1{δn≠i}pi=∑i=1Mpi−pδn pointwise, we obtain

Ln,M(δn)=∫Xnφ(x1n)∑i=1Mpi(x1n)−pδn(x1n)(x1n)dμ⊗n(x1n).

Minimisation over δn is therefore pointwise in x1n and is achieved by selecting an index maximising pj(x1n), yielding (63). □

Lemma 3 

(Pairwise minima). For any non-negative numbers a1,…,aM,

max1≤i<j≤Mmin(ai,aj)≤∑k=1Mak−max1≤k≤Mak≤∑1≤i<j≤Mmin(ai,aj). (64)

Consequently, defining for i<j

Ini,j:=∫Xnφ(x1n)min{pi(x1n),pj(x1n)}dμ⊗n(x1n),

we have the sandwich inequality

maxi<jIni,j≤Ln,M∗≤∑i<jIni,j. (65)

Proof. 

Let a(1)≥a(2)≥…≥a(M) be the decreasing rearrangement of (a1,…,aM). Then ∑kak−maxkak=∑r=2Ma(r)≥a(2). Moreover, maxi<jmin(ai,aj)=a(2), proving the left inequality in (64).

For the right inequality, let k∗∈argmaxkak. Then

∑1≤i<j≤Mmin(ai,aj)≥∑k≠k∗min(ak,ak∗)=∑k≠k∗ak=∑k=1Mak−maxkak.

Applying (64) pointwise to ai=pi(x1n), multiplying by φ(x1n) and integrating yields (65). □

Theorem 3 

(M-ary exponent equals the minimum pairwise weighted Chernoff information). For 1≤i<j≤M, let DCw(Pi,Pj) be the weighted Chernoff information as in Definition 2, and (62) holds true. Set

CMw:=min1≤i<j≤MDCw(Pi,Pj).

Then the optimal M-ary total loss satisfies

Ln,M∗=exp{−nCMw+o(n)},n→∞, (66)

or equivalently,

limn→∞−1nlnLn,M∗=CMw.

Proof. 

Fix 1≤i<j≤M and consider the binary testing problem between Pi and Pj with the same factorised weight φ. The optimal binary total loss equals

Ini,j=∫Xnφ(x1n)min{pi(x1n),pj(x1n)}dμ⊗n(x1n),

and by Theorem 1 applied to the pair (Pi,Pj),

Ini,j=exp{−nDCw(Pi,Pj)+oi,j(n)}.

Since the number of pairs is finite, letting rn:=maxi<j|oi,j(n)| yields rn=o(n) and

Ini,j=exp{−nDCw(Pi,Pj)+O(rn)}uniformlyoveri<j.

Now use the sandwich inequality (65). Let (i∗,j∗) attain the minimum CMw=DCw(Pi∗,Pj∗). From the lower bound,

Ln,M∗≥Ini∗,j∗=exp{−nCMw+O(rn)}.

From the upper bound,

Ln,M∗≤∑i<jIni,j≤M2exp{−nCMw+O(rn)}.

Taking −1nln(·) and letting n→∞ yields (66). □

Remark 8 

(Nonzero priors do not change the exponent). Let w1,…,wM>0, ∑iwi=1, and consider the Bayesian weighted total loss Ln,M(w)(δn)=∑i=1MwiLi,n(δn) with optimum Ln,M(w)∗:=infδnLn,M(w)(δn). Then, the exponent remains CMw. Indeed, writing wmin:=miniwi and wmax:=maxiwi, for any δn,

wminLn,M(δn)≤Ln,M(w)(δn)≤wmaxLn,M(δn),

and taking infimum over δn gives wminLn,M∗≤Ln,M(w)∗≤wmaxLn,M∗. Hence, −1nlnLn,M(w)∗ and −1nlnLn,M∗ have the same limit CMw.

5. Conclusions

We studied context-sensitive simple hypothesis testing under a multiplicative weight and proved that the optimal total loss admits the single-letter logarithmic asymptotic

Ln∗=exp{−nDCw(P,Q)+o(n)}.

The rate is the weighted Chernoff information. The main structural ingredient is an exponential-family embedding of the weighted geometric mixtures φpαq1−α, which yields the characterisation of the optimal Chernoff parameter through the log-normaliser and leads to weighted information-geometric identities. We also derived finite-n concentration bounds for the tilted weighted log-likelihood, obtained explicit formulas in Gaussian, Poisson, and exponential models, and extended the logarithmic asymptotic to finitely many hypotheses through the minimum pairwise weighted Chernoff information.

Open Problems

The single-letter representation (4) rests on Assumption 1 (factorised weights), on the integrability of the tilted log-normaliser F^, and on i.i.d. sampling of simple hypotheses. Relaxing these assumptions defines several natural open directions.

  • (a)

    Non-factorised weights. Replacing Assumption 1 by a weight φ(x1n)=ψ1n∑i=1nh(xi) or a pairwise-interaction weight; the single-letter rate is then expected to be replaced by a variational formula over the space of probability measures, in the spirit of Sanov/Gibbs conditioning.

  • (b)

    Integrability. Weights with heavy tails in the sufficient statistic t(x) may violate the finiteness of F^ near α∗θ1+(1−α∗)θ2; the boundary cases α∗∈{0,1} (cf. Proposition 5 and [3]) call for a systematic treatment via truncation or a change in base measure.

  • (c)

    Dependent observations. A weighted counterpart of the Gärtner–Ellis theorem for stationary ergodic sequences, along the lines of the weighted extensions in [4].

  • (d)

    Composite hypotheses. A weighted analogue of the generalised likelihood-ratio test and its exponent, with sup/inf characterisations in terms of DCw over the composite parameter sets.

  • (e)

    Information geometry of weighted manifolds. Extending the Chentsov–Amari framework [8,9,10,11,12] to weighted statistical manifolds; the Fisher metric and the dually flat structure depend on symmetries that φ breaks in a controlled way.

Appendix A. Cauchy Location–Scale Family

We consider the univariate Cauchy location–scale family

pl,s(x)=sπs2+(x−l)2,x∈R,l∈R,s>0.

In this appendix, we set φ≡1, so the weighted quantities from Section 2 coincide with their classical counterparts (e.g., ραw=ρα, DB,αw=DB,α, DCw=DC). This example provides a closed-form illustration outside the exponential-family setting.

Although the main body of the paper develops weighted Chernoff/Bhattacharyya quantities, we include the Cauchy location–scale family as an unweighted baseline closed-form benchmark outside the exponential-family setting (note the appearance of complete elliptic integrals even in the classical case). This appendix is not used in the proofs of the weighted results; it serves as a sanity check and illustrates the analytic complexity of ρα beyond exponential families. Nontrivial weights must satisfy the finiteness conditions from Section 2; for heavy-tailed Cauchy laws, common exponential tilts φ(x)=eγx violate these conditions for any γ≠0, and in general, a nonconstant weight also breaks the symmetry leading to α∗=1/2.

Appendix A.1. KL Divergence (Closed Form)

Proposition A1 

(KL divergence between two Cauchy laws). Let P=Cauchy(l1,s1) and Q=Cauchy(l2,s2) with s1,s2>0. Then

DKL(P||Q)=∫Rpl1,s1(x)lnpl1,s1(x)pl2,s2(x)dx=ln(s1+s2)2+(l1−l2)24s1s2. (A1)

Appendix A.2. Chernoff Parameter and Bhattacharyya Coefficient

Recall the (unweighted) α-Bhattacharyya coefficient and distance

ρα(P,Q)=∫Rpl1,s1(x)αpl2,s2(x)1−αdx,DB,α(P,Q)=−lnρα(P,Q),α∈[0, 1].

Proposition A2 

(Chernoff parameter for Cauchy). For the Cauchy location–scale family (with φ≡1), one has the symmetry

ρα(P,Q)=ρ1−α(P,Q),α∈[0,1]; (A2)

equivalently, DB,α(P,Q)=DB,1−α(P,Q). Consequently, if P≠Q, then the Chernoff maximiser is unique and equals

α∗=12,andhenceDC(P,Q)=maxα∈[0,1]DB,α(P,Q)=DB,1/2(P,Q).

If P=Q, then DB,α(P,Q)≡0 and every α∈[0,1] is a maximiser.

Proof. 

Set F(α):=lnρα(P,Q). By Hölder’s inequality, F is convex on [0, 1], and it is strictly convex unless pl1,s1/pl2,s2 is μ-a.e. constant (equivalently, unless P=Q). Hence DB,α(P,Q)=−F(α) is concave (strictly concave when P≠Q). For Cauchy laws, the symmetry (A2) holds; see, e.g., [17] for an invariance-based proof. Therefore, DB,α is symmetric about 1/2, and concavity implies that it attains its maximum at α=1/2. Strict concavity yields uniqueness when P≠Q. □

Appendix A.3. Closed Form for ρ1/2 and DC

Lemma A1 

(A standard elliptic-integral identity). Let a,b>0 and d∈R. Define the complete elliptic integral of the first kind

K(m):=∫0π/2du1−msin2u,m∈[0,1).

Then

∫−∞∞dx(x2+a2)(x−d)2+b2=4(a+b)2+d2K(a−b)2+d2(a+b)2+d2. (A3)

Proposition A3 

(Bhattacharyya coefficient for Cauchy, closed form). Let P=Cauchy(l1,s1) and Q=Cauchy(l2,s2) with s1,s2>0, and set δ:=l1−l2. Then

ρ1/2(P,Q)=∫Rpl1,s1(x)pl2,s2(x)dx=4s1s2π(s1+s2)2+δ2K(s1−s2)2+δ2(s1+s2)2+δ2. (A4)

Consequently,

DC(P,Q)=DB,1/2(P,Q)=−lnρ1/2(P,Q), (A5)

with ρ1/2(P,Q) given by (A4).

Proof. 

By definition,

pl1,s1(x)pl2,s2(x)=s1s2π(x−l1)2+s12(x−l2)2+s22.

Shift x↦x+l2 to obtain

ρ1/2(P,Q)=s1s2π∫−∞∞dx(x2+s22)(x−δ)2+s12.

Apply Lemma A1 with a=s2, b=s1, d=δ to get (A4). Finally, Proposition A2 yields DC(P,Q)=DB,1/2(P,Q), hence (A5). □

Remark A1 

(Useful special cases). If l1=l2 (common location), then δ=0 and (A4) reduces to

ρ1/2(P,Q)=4s1s2π(s1+s2)Ks1−s2s1+s22.

If s1=s2=s (common scale), then

ρ1/2(P,Q)=4sπ4s2+δ2Kδ24s2+δ2.

Remark A2 

(Weighted case). For a general weight φ, one has

ρ1/2w(P,Q)=∫Rφ(x)pl1,s1(x)pl2,s2(x)dx.

The symmetry (A2) (and hence α∗=1/2) typically fails unless φ is compatible with the invariance argument used in [17]. We therefore use the Cauchy model mainly as a closed-form baseline example at φ≡1.

Author Contributions

Conceptualization, methodology, and supervision, M.K.; formal analysis and validation, M.K. and E.Y.K.; software, visualization, data curation, and project administration, E.Y.K.; writing–original draft preparation, M.K. and E.Y.K.; writing–review and editing, E.Y.K.; funding acquisition, M.K. and E.Y.K. All authors have read and agreed to the published version of the manuscript.

Data Availability Statement

The Python/Jupyter notebook reproducing Table 1 and Figure 1, Figure 2 and Figure 3, together with the direct numerical-integration verification of the Gaussian formula in Section 4.1, is openly available on Zenodo. No new experimental datasets were generated.

Conflicts of Interest

The authors declare no conflicts of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

Funding Statement

The work by MK was carried out in the framework of a research project HSE-BR-2025-039 implemented as part of the Basic Research Program at HSE University. The second author (E.Yu. Kalimulina) was supported by the Ministry of Science and Higher Education of the Russian Federation under the state assignment (project FFNU-2025-0029).

Footnotes

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

References

  • 1.Chernoff H. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 1952;23:493–507. doi: 10.1214/aoms/1177729330. [DOI] [Google Scholar]
  • 2.Hoeffding W. Asymptotically optimal tests for multinomial distributions. Ann. Math. Stat. 1965;36:369–401. doi: 10.1214/aoms/1177700150. [DOI] [Google Scholar]
  • 3.Kelbert M., Suhov Y. Context-sensitive hypothesis-testing and exponential families. Statistics. 2025;59:845–878. doi: 10.1080/02331888.2025.2467233. [DOI] [Google Scholar]
  • 4.Kelbert M., Suhov Y. On basic context-dependent concepts of Information Theory and Statistics. Theory Probab. Appl. 2026;70:563–583. [Google Scholar]
  • 5.Kalimulina E.Y. Application of multi-valued logic models in traffic aggregation problems in mobile networks; Proceedings of the 2021 IEEE 15th International Conference on Application of Information and Communication Technologies (AICT); Baku, Azerbaijan. 13–15 October 2021; pp. 1–6. [Google Scholar]
  • 6.Esin A.A., Kalimulina E.Y. Markov-modulated queueing network for mobile traffic aggregation with threshold-controlled buffers. Math. Model. Numer. Simul. Appl. 2026;6:4. doi: 10.53391/2791-8564.1019. [DOI] [Google Scholar]
  • 7.Nielsen F. Hypothesis testing, information divergence and computational geometry. In: Nielsen F., Barbaresco F., editors. Geometric Science of Information. Volume 8085. Springer; Berlin/Heidelberg, Germany: 2013. pp. 241–248. (GSI 2013, Lecture Notes in Computer Science). [DOI] [Google Scholar]
  • 8.Amari S.-I., Nagaoka H. Methods of Information Geometry. Volume 191. American Mathematical Society; Providence, RI, USA: 2000. (Translations of Mathematical Monographs). [DOI] [Google Scholar]
  • 9.Chentsov N.N. Statistical Decision Rules and Optimal Inference. Volume 53 American Mathematical Society; Providence, RI, USA: 1982. (Translations of Mathematical Monographs). [Google Scholar]
  • 10.Amari S.-I. Information Geometry and Its Applications. Volume 194. Springer; Japan, Tokyo: 2016. (Applied Mathematical Sciences). [DOI] [Google Scholar]
  • 11.Nielsen F. An information-geometric characterization of Chernoff information. IEEE Signal Process. Lett. 2013;20:269–272. doi: 10.1109/LSP.2013.2243726. [DOI] [Google Scholar]
  • 12.Nielsen F. Revisiting Chernoff information with likelihood ratio exponential families. Entropy. 2022;24:1400. doi: 10.3390/e24101400. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 13.Azuma K. Weighted sums of certain dependent random variables. Tôhoku Math. J. 1967;19:357–367. doi: 10.2748/tmj/1178243286. [DOI] [Google Scholar]
  • 14.McDiarmid C. Surveys in Combinatorics. Volume 141. Cambridge University Press; Cambridge, UK: 1989. On the method of bounded differences; pp. 148–188. [Google Scholar]
  • 15.Ren Y., Zhang J., Xia Y., Wang R., Xie F., Guan J., Zhang H., Zhou S. Regression-based conditional independence test with adaptive kernels. Artif. Intell. 2025;347:104391. doi: 10.1016/j.artint.2025.104391. [DOI] [Google Scholar]
  • 16.Kalimulina E.Y. Weighted Chernoff Information–Numerical Illustration. Software, companion to the present paper, version 1.0.0. Zenodo. 2026 doi: 10.5281/zenodo.19736237. [DOI] [Google Scholar]
  • 17.Nielsen F., Okamura K. On f-divergences between Cauchy distributions. IEEE Trans. Inf. Theory. 2023;69:3150–3170. doi: 10.1109/TIT.2022.3231645. [DOI] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

A Jupyter/Colab notebook reproducing Table 1 and Figure 1, Figure 2 and Figure 3, together with the direct-integration verification of (55), is archived on Zenodo [16] and mirrored on GitHub.

Figure 1.

Figure 1

The map α↦−lnραw(p,q) for the Gaussian hypotheses N(0,1), N(3,2) with weight (54), for β∈{0,1/16,1/4}. The optimum α∗ is marked by a bullet on each curve and shifts to the left as β increases.

Figure 2.

Figure 2

Optimal skewing parameter α∗(β) for the Gaussian example. The dashed line marks the unweighted value α∗(0).

Figure 3.

Figure 3

Weighted Chernoff information β↦DCw(P,Q). The dashed line marks the classical value DC recovered at β=0.

The Python/Jupyter notebook reproducing Table 1 and Figure 1, Figure 2 and Figure 3, together with the direct numerical-integration verification of the Gaussian formula in Section 4.1, is openly available on Zenodo. No new experimental datasets were generated.


Articles from Entropy are provided here courtesy of Multidisciplinary Digital Publishing Institute (MDPI)

RESOURCES