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 , where is the weighted Chernoff information. The single-letter form of the exponent relies on a structural assumption that the weight factorises across observations, ; 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 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 be a Polish space with its Borel -algebra and let be i.i.d. -valued observations. We consider the simple hypotheses
where and are probability measures on dominated by a reference measure . Without loss of generality, one may take and write and . In the unweighted setting, the optimal sum of type-I and type-II error probabilities is characterized by and can be written as
In the standard (unweighted) Bayesian setting, the decay rate of the optimal total error probability is governed by the Chernoff information [1,2]:
Here is usually called the -skewed Bhattacharyya affinity coefficient, and is the affinity coefficient. In view of Hölder’s inequality, .
Chernoff also introduced an asymptotic efficiency notion for comparing two experimental designs such that n observations on one test are equivalent (i.e., they give asymptotically the same total loss as ) to 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 , in the framework of [3,4]. In the weighted setting, a nonnegative weight function 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 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 alone, the resulting weight is a strictly positive bounded function and extends multiplicatively to . The weighted Chernoff information then quantifies the effective discrimination rate under channel-dependent reliability and reduces to the classical rate in the limit . 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 satisfies
Assumption 1 is the key single-letter hypothesis. It yields the weighted affinities
hence an additive logarithmic rate. For one observation and equal priors, the weighted Bayes risk equals
Since for every ,
and therefore
where (see Definition 2). Under Assumption 1, the same bound factorises over n observations and yields the exponential scale . Theorem 1 shows that this scale is exact on the logarithmic level.
1.1. Main Result and Contributions
Let 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
where the rate is the weighted Chernoff information
For , (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 . 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 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)
- (N2)
- (New.) The exponential-family representation of the weighted geometric mixtures (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 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 ; the unweighted limit 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 , the likelihood-ratio exponential family description is given in [12]; the present paper extends this picture to the tilted integrand . 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,
Define the -tilted (reweighted) densities
(and similarly for ). Throughout this section, we assume that . (Equivalently, ) Then are probability densities and, under , we have (and similarly for q).
Under Assumption 1, we have
Let denote the class of (possibly randomised) decision rules , where is the probability of deciding in favour of after observing . (Deterministic rules correspond to .)
For , define the context-sensitive type-I and type-II losses by
and the corresponding total loss
Proposition 1
(Pointwise form of the optimal total loss). For each ,
Moreover, an optimal (deterministic) decision rule is given by the likelihood-ratio test
(with any measurable tie-breaking on ).
Proof.
Fix . The integrand in equals
Minimising pointwise over yields when and when , giving (8). □
We also use the weighted total variation distance
Remark 1.
For , this reduces to the usual total variation distance. If φ vanishes on a non-negligible set, is, in general, a pseudo-distance; this is sufficient for our purposes since it characterises the weighted losses.
Using in (8) and the definition of yields
2.2. Weighted Affinities and Chernoff Information
We introduce the weighted Bhattacharyya affinities and the weighted Chernoff information. Assume that for all .
Definition 1
(Weighted Bhattacharyya coefficient and distance). For define the weighted α-skewed Bhattacharyya affinity coefficient
and the corresponding weighted Bhattacharyya distance
Definition 2
(Weighted Chernoff information). The weighted Chernoff information divergence between and is
A maximiser in (13) is called the optimal Chernoff parameter.
Remark 2.
The weighted Chernoff information is symmetric: , since . In general, however, does not satisfy the triangle inequality and is therefore a divergence rather than a metric.
Remark 3.
Under Assumption 1, for every ,
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 is a non-negative functional of the decision rule and is minimised over , giving the optimal loss . The map is a non-negative concave functional of the skewing parameter and is maximised over , giving the weighted Chernoff information . Theorem 1 below connects the two via the single-letter asymptotic .
3.1. Asymptotics of the Optimal Sum of Losses
Recall from Section 2 that
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 versus , under Assumption 1. Assume also
Let be the class of (possibly randomised) decision rules , and let , be defined by (6) and (7). Assume that μ-a.e. and that for all .
Then, as ,
Equivalently,
Proof.
By Proposition 1,
For any , , hence, by factorisation,
Taking the infimum over gives
Now fix and define
A direct change of measure yields
The bracket is bounded above by 1.
Let , it is easy to check that is a convex function. Under the regularity assumption of (14),
If , then . Hence, in view of LLN, in -probability. Therefore, for every ,
Combined with the upper bound by 1, this implies
In the boundary case , we have the mean value , and a.s. as by the strong LLN. Similarly, in the case , we have the mean value , and a.s. as . This completes the proof. □
Corollary 1
(Asymptotics of the weighted total variation). Under the assumptions of Theorem 1, the weighted total variation satisfies
where .
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 define
and the corresponding normalised density
By assumption , so is well-defined as a probability density w.r.t. .
Set and . Then, admits the exponential-family form
In particular, is a sufficient statistic for the family .
The log-normaliser is convex on ; if is not -a.e. constant on , then is strictly convex and the maximiser in (13) is unique. By Hölder’s inequality,
Finally, note that and ; hence,
so is an exponential arc between the tilted versions of and . By this definition, the following identities hold:
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 and for computing the optimal Chernoff parameter . We follow [3] for weighted Bregman divergences.
Let be a regular exponential family of densities (with respect to ),
For a density r, set and write .
Assume for and define the tilted log-normaliser
Equivalently, the tilted density is
Definition 3
(Weighted Kullback–Leibler divergence). For densities on define
whenever the integral is well defined in .
Definition 4
(Weighted Bregman divergence). The weighted Bregman divergence associated with is
Proposition 2
(Weighted KL as weighted Bregman divergence). For a regular exponential family , assume that the integral in (25) is well-defined in . Then for any ,
Proof.
Proposition 3
(Primal–dual identities for (weighted) Bregman divergences). Let F be a log-normaliser of a regular exponential family and let denote its Legendre transform. Write and .
(a) Weighted one-parameter identity. Assume (one-parameter case) and let . Then, the following weighted analogue of the classical Bregman duality holds:
where is as in Definition 4 and is defined analogously (with F replaced by and with the convention under ).
(b) Classical identity. For any , the (unweighted) Bregman divergence admits the standard Legendre representation
where is the usual (unweighted) Bregman divergence.
Proof.
Part (a) is a weighted extension of the classical duality 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 and . A direct calculation yields
Consequently,
where is the (unweighted) Jensen/Burbea–Rao divergence induced by F. In particular, when we have and .
Remark 5
(Geometric mixtures and tilting by ). In particular, when , we have and the normalised geometric mixture belongs to the same exponential family, namely, with .
Proposition 4
(Optimal Chernoff parameter in an exponential family). Assume that is strictly convex on the segment and that the maximiser exists. Then, is unique and satisfies
with .
Proof.
Differentiate (31) with respect to and use . Strict convexity of on implies strict concavity of , hence uniqueness. □
Proposition 5
(Chernoff information as a Jensen-type divergence and a Bregman bisector). Let and assume that the maximiser in Definition 2 exists and is unique. Set . Then
Moreover, is characterised by the weighted Bregman bisector condition
and the common value recovers the Chernoff information as
In the special case , we have and , so that (33) reduces to the classical Jensen divergence induced by F and (35) becomes .
3.3.3. Derivative and Weighted KL
3.3.4. Chernoff–KL
Lemma 1.
Let be a maximiser in Definition 2 and assume that (so that below). Set Then
where and .
Here, denotes the standard (unweighted) Kullback–Leibler divergence.
Proof.
A direct computation yields, for ,
At , we have . Since and , the claim follows from . □
Corollary 2
(Chernoff information as a Bregman divergence on the Chernoff arc). Let and define the one-dimensional Bregman divergence
Assume that the maximiser in Definition 2 is interior, so that . Then
Equivalently,
with , and .
Proof.
In the Chernoff exponential family with log-normalizer , the KL–Bregman identity gives and . Since and , , we obtain
and similarly for 0. Substituting this into Lemma 1 yields (40). □
Remark 6
To illustrate the general identities above, we provide explicit expressions for and in several parametric settings (Gaussian, Poisson, and exponential); see Section 4.
Remark 7.
The Bregman representation (40) identifies with a Bregman divergence on the tilted log-normaliser ; geometrically, the optimiser marks the intersection of the exponential geodesic of the tilted family with the weighted Kullback–Leibler bisector, generalising the unweighted characterisation of [11,12]. In the exponential-family setting, the computation of therefore reduces to and its gradient: once 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 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 (cf. Section 3), it is convenient to work with the tilted ratio . The factor cancels pointwise in and enters only through the normalisation constants and . We record two consequences: a large-deviation representation for via the cumulant generating functions 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
Here .
In particular, since
we may equivalently rewrite likelihood-ratio threshold rules in terms of . For example,
Thus, 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
where ranges over the set (and similarly for ).
Similarly,
This implies the relation of Legendre transforms
In particular, may be treated as a natural weighted version of the Chernoff divergence between q and p:
Interpretation. The value is the Chernoff–Cramér exponent controlling the tail event under , i.e., (under standard regularity assumptions), . In the unweighted case , we have and reduces to the classical Chernoff information between p and q. We also stress that is a tilted-likelihood exponent and is distinct from the weighted Chernoff information from Definition 2, which governs the optimal sum of context-sensitive losses.
Non-Asymptotic Concentration via a Doob Martingale
The rate functions and capture the exponential scale of deviations of as . To obtain explicit finite-n bounds, we now apply a standard martingale method to under .
Consider the filtration and define the random variables by
where stands for the (unweighted) Kullback–Leibler divergence of and . Then
Observe that is a martingale w.r.t. .
Assume now that and , where and
In view of a refined Azuma–Hoeffding/McDiarmid inequality [13,14],
where , , and stands for the Kullback–Leibler divergence between the two Bernoulli distributions and .
We use the following modified version of Azuma–Hoeffding inequality; see [14].
Lemma 2.
Let be a discrete-time real-valued martingale. Assume that, for some constants , the following two requirements are satisfied a.s. for every
Then, for every ,
where and . (Note that automatically whenever a.s.)
In particular, the one-sided bound holds.
Theorem 2.
Set
Under conditions , , and ,
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 and .
4. Examples and Applications
The identities of Section 3 reduce the computation of and to the single-letter weighted affinity
followed by optimisation over . We work this out for Gaussian, Poisson, and exponential families, highlighting how the context weight modifies the classical formulas. When , 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 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 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
with a non-indicator factorised weight
At , one has and the unweighted Chernoff information is recovered. For , the weight concentrates near ; 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 and the centring of at the mean are essential for the illustration. In a fully symmetric configuration (, , ), the problem is invariant under , so the optimum is pinned to 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 , , and , a direct Gaussian integration yields
and maximising (55) over gives and . Table 1 reports their values at three selected . Direct numerical integration of 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.
The monotone growth of and the leftward shift of illustrate a qualitative conclusion of Section 3: localising near preferentially retains observations that are more probable under and thereby increases the effective discrimination rate, while simultaneously moving the optimal tilting towards the side. The classical unweighted limit is recovered at .
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 and the type-II exponent equals (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 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.
The map for the Gaussian hypotheses , with weight (54), for . The optimum is marked by a bullet on each curve and shifts to the left as increases.
Figure 2.
Optimal skewing parameter for the Gaussian example. The dashed line marks the unweighted value .
Figure 3.
Weighted Chernoff information . The dashed line marks the classical value recovered at .
4.2. Gaussian Models
Throughout this subsection, the reference measure is the Lebesgue measure on . We compute the weighted Bhattacharyya coefficient
together with the weighted Bhattacharyya distance and the weighted Chernoff information (Definition 2). Note that, unlike the unweighted case, is not restricted to and (hence also ) may take negative values.
Example 1
(Gaussian weighted Bhattacharyya coefficient with exponential weight). Let and on , where and , and let for some . Denote by the corresponding densities. For define
Then
Consequently,
In particular, setting (i.e., ) reduces (57) to the classical (unweighted) Gaussian Bhattacharyya distance; see, e.g., [12].
Corollary 3
(Common covariance). In Example 1, assume and keep the exponential weight . Set , , and . Then, for any ,
and therefore
If and the unconstrained maximiser
belongs to , then ; otherwise the maximum over is attained at the nearest boundary point . In all cases,
In particular, for (i.e., ) we recover and .
Proof.
The expression for follows by simplifying Example 1 under , which makes the determinant prefactor equal to 1 and yields a Gaussian MGF term . The maximiser follows by differentiating (59) in . □
Choosing an exponential weight corresponds to exponential tilting: for a Gaussian , this tilting keeps the covariance and shifts the mean to (with normalisation factor ), which is why the weighted affinities remain available in closed form. In particular, the optimal Chernoff parameter is no longer forced to be and, as (59) shows, sufficiently strong tilting can push the maximiser to the boundary .
4.3. Poisson Models
Example 2
(Poisson model with exponential weight). Let and let μ be the counting measure on . Fix two hypotheses and with , and write and . Throughout this subsection we work under the standing assumption of Section 2, namely, that the observations are i.i.d. (distributed as under and as under ), and that the weight φ factorises across observations (Assumption 1). We still consider the exponential weight (For we recover the unweighted case .) Equivalently, setting , the weight takes the form ; this reparameterisation is convenient in applications where models a per-event discount factor, while is the natural parameter for the exponential-family calculations below. The two parameterisations are equivalent.
For , set
(a) Weighted Bhattacharyya coefficient and Chernoff arc.
A direct summation gives
Hence, by Definition 1,
Moreover, the normalised weighted geometric mixture (Chernoff-tilted density) from (18) takes the form
(b) Optimal Chernoff parameter.
If , then is strictly concave on since
hence, the maximiser in Definition 2 is unique. Differentiating (61) yields the critical point condition
Equivalently, the (unconstrained) critical point satisfies
In contrast to the unweighted case (), the context tilt γ may push the optimal Chernoff parameter to the boundary .
Thus, the unconstrained maximiser is
and the maximiser on is , where
Finally,
If , then does not depend on α and for any .
4.4. Exponential Models
Example 3
(Exponential model with exponential weight). Let with Lebesgue measure. Fix two hypotheses and with rates , and write
Consider the exponential weight with
so that for all . For set
(a) Weighted Bhattacharyya coefficient and Chernoff arc.
A direct computation gives
Hence
Moreover, the Chernoff-tilted density from (18) is again exponential:
(b) Optimal Chernoff parameter.
If , then is strictly concave on ; hence, the maximiser in Definition 2 is unique. Differentiating yields the critical point condition
Equivalently, the (unconstrained) critical point satisfies
so that
The maximiser on is (projection onto ), and
If , then does not depend on α, so any is optimal and . Setting (i.e., ) 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 , the Bhattacharyya coefficient (in particular ) and the Chernoff information may involve special functions (complete elliptic integrals). For nontrivial weights , the symmetry (hence ) 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 .
Fix an integer and let be probability measures on dominated by , with strictly positive densities . Let be i.i.d. under each hypothesis . Assume that the weight function factorises as in Assumption 1.
Assume moreover that for every and every ,
so that all pairwise weighted Chernoff information values are well-defined and inequality
holds true.
A (deterministic) M-ary decision rule is a measurable map . Define the context-sensitive loss under by
and the total loss
Proposition 6
(Pointwise form of the optimal M-ary total loss). For each ,
where . Moreover, an optimal rule is given by the maximum-likelihood classifier
(with any measurable tie-breaking).
Proof.
Fix . Using pointwise, we obtain
Minimisation over is therefore pointwise in and is achieved by selecting an index maximising , yielding (63). □
Lemma 3
(Pairwise minima). For any non-negative numbers ,
Consequently, defining for
we have the sandwich inequality
Proof.
Let be the decreasing rearrangement of . Then . Moreover, , proving the left inequality in (64).
Theorem 3
(M-ary exponent equals the minimum pairwise weighted Chernoff information). For , let be the weighted Chernoff information as in Definition 2, and (62) holds true. Set
Then the optimal M-ary total loss satisfies
or equivalently,
Proof.
Fix and consider the binary testing problem between and with the same factorised weight . The optimal binary total loss equals
and by Theorem 1 applied to the pair ,
Since the number of pairs is finite, letting yields and
Remark 8
(Nonzero priors do not change the exponent). Let , , and consider the Bayesian weighted total loss with optimum . Then, the exponent remains . Indeed, writing and , for any ,
and taking infimum over gives . Hence, and have the same limit .
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
The rate is the weighted Chernoff information. The main structural ingredient is an exponential-family embedding of the weighted geometric mixtures , 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 , 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 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 may violate the finiteness of near ; the boundary cases (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 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.
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.
Funding
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).
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.
Appendix A. Cauchy Location–Scale Family
We consider the univariate Cauchy location–scale family
In this appendix, we set , so the weighted quantities from Section 2 coincide with their classical counterparts (e.g., , , ). 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 violate these conditions for any , and in general, a nonconstant weight also breaks the symmetry leading to .
Appendix A.1. KL Divergence (Closed Form)
Proposition A1
(KL divergence between two Cauchy laws). Let and with . Then
Appendix A.2. Chernoff Parameter and Bhattacharyya Coefficient
Recall the (unweighted) -Bhattacharyya coefficient and distance
Proposition A2
(Chernoff parameter for Cauchy). For the Cauchy location–scale family (with ), one has the symmetry
equivalently, . Consequently, if , then the Chernoff maximiser is unique and equals
If , then and every is a maximiser.
Proof.
Set . By Hölder’s inequality, F is convex on , and it is strictly convex unless is -a.e. constant (equivalently, unless ). Hence is concave (strictly concave when ). For Cauchy laws, the symmetry (A2) holds; see, e.g., [17] for an invariance-based proof. Therefore, is symmetric about , and concavity implies that it attains its maximum at . Strict concavity yields uniqueness when . □
Appendix A.3. Closed Form for ρ1/2 and DC
Lemma A1
(A standard elliptic-integral identity). Let and . Define the complete elliptic integral of the first kind
Then
Proposition A3
(Bhattacharyya coefficient for Cauchy, closed form). Let and with , and set . Then
Consequently,
with given by (A4).
Proof.
Remark A1
Remark A2
(Weighted case). For a general weight φ, one has
The symmetry (A2) (and hence ) 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 .
References
- 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. [Google Scholar] [CrossRef] [Scilit]
- Hoeffding, W. Asymptotically optimal tests for multinomial distributions. Ann. Math. Stat. 1965, 36, 369–401. [Google Scholar] [CrossRef] [Scilit]
- Kelbert, M.; Suhov, Y. Context-sensitive hypothesis-testing and exponential families. Statistics 2025, 59, 845–878. [Google Scholar] [CrossRef] [Scilit]
- Kelbert, M.; Suhov, Y. On basic context-dependent concepts of Information Theory and Statistics. Theory Probab. Appl. 2026, 70, 563–583. [Google Scholar]
- Kalimulina, E.Y. Application of multi-valued logic models in traffic aggregation problems in mobile networks. In 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]
- 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. [Google Scholar] [CrossRef] [Scilit]
- Nielsen, F. Hypothesis testing, information divergence and computational geometry. In Geometric Science of Information; Nielsen, F., Barbaresco, F., Eds.; GSI 2013, Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2013; Volume 8085, pp. 241–248. [Google Scholar] [CrossRef] [Scilit]
- Amari, S.-I.; Nagaoka, H. Methods of Information Geometry; Translations of Mathematical Monographs; American Mathematical Society: Providence, RI, USA, 2000; Volume 191. [Google Scholar] [CrossRef] [Scilit]
- Chentsov, N.N. Statistical Decision Rules and Optimal Inference; Translations of Mathematical Monographs; American Mathematical Society: Providence, RI, USA, 1982; Volume 53. [Google Scholar]
- Amari, S.-I. Information Geometry and Its Applications; Applied Mathematical Sciences; Springer: Japan, Tokyo, 2016; Volume 194. [Google Scholar] [CrossRef] [Scilit]
- Nielsen, F. An information-geometric characterization of Chernoff information. IEEE Signal Process. Lett. 2013, 20, 269–272. [Google Scholar] [CrossRef] [Scilit]
- Nielsen, F. Revisiting Chernoff information with likelihood ratio exponential families. Entropy 2022, 24, 1400. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Azuma, K. Weighted sums of certain dependent random variables. Tôhoku Math. J. 1967, 19, 357–367. [Google Scholar] [CrossRef] [Scilit]
- McDiarmid, C. On the method of bounded differences. In Surveys in Combinatorics; Cambridge University Press: Cambridge, UK, 1989; Volume 141, pp. 148–188. [Google Scholar]
- 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. [Google Scholar] [CrossRef] [Scilit]
- Kalimulina, E.Y. Weighted Chernoff Information–Numerical Illustration. Software, companion to the present paper, version 1.0.0. Zenodo 2026. [Google Scholar] [CrossRef]
- Nielsen, F.; Okamura, K. On f-divergences between Cauchy distributions. IEEE Trans. Inf. Theory 2023, 69, 3150–3170. [Google Scholar] [CrossRef] [Scilit]
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. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.


