alphaFeedback

WorksMathematics

Decision-Target Reversal under Informative Label Missingness

AI contributions
Not recorded for this paper
View details
Ancillary data
1 code link
View

Abstract

Informative label missingness can improve classification efficiency because the pattern of label availability may itself contain information about the discriminant structure. We show that this advantage need not persist across deployment objectives: with the data-generating model and statistical experiments held fixed, informative partial classification can be favourable under one loss and unfavourable under another. We call this phenomenon decision-target reversal. For binary Gaussian discrimination, we derive a local cost-sensitive excess-risk expansion and, in one dimension, obtain explicit critical cost ratios at which the first-order risk ordering reverses. We show that the required covariance geometry arises under finite uncertainty-dependent missingness mechanisms with a fixed marginal missing-label proportion. We then extend the analysis to multiclass finite-action problems through loss-specific active-boundary curvature, yielding a general decision-target frontier. Monte Carlo experiments illustrate the predicted reversals, and a descriptive gastrointestinal-lesion application with agreement-defined label availability illustrates sensitivity to deployment costs. The results show that favourable informative missingness is a property of the statistical experiment relative to the deployment decision, rather than of the experiment alone.

Introduction

Partially classified samples arise when feature measurements are observed for all training units but class labels are available for only a subset. This setting is common when definitive classification requires expert assessment, laboratory testing, follow-up, or another procedure that is more difficult or costly than obtaining the features themselves. In likelihood-based semi-supervised classification, observations without class labels can still contribute through the marginal feature distribution, but the unavailable labels ordinarily represent a loss of information about the discriminant structure.

This usual efficiency ordering can change when label availability is informative. Following the missing-data framework of Rubin [1], Ahfock and McLachlan [2] considered Gaussian discrimination in which the probability that a class label is missing depends on classification uncertainty. Because the missingness mechanism shares parameters with the classifier, the observed pattern of label availability can itself carry information about the discriminant model. The information supplied by the missingness indicators may then compensate, partly or more than fully, for the information lost through unavailable class labels. Consequently, an informatively partially classified sample can have smaller asymptotic classification risk than the corresponding ordinary completely classified sample.

Throughout this paper, complete classification (CC) refers to the ordinary fully labelled experiment based on (Y,Z)(Y, Z), without treating a mechanism-generated missingness indicator as an additional observation. This distinction is important. If both all class labels and the missingness indicator were observed, giving the augmented experiment (Y,Z,M)(Y, Z, M), the partially classified observation would be a coarsening of that experiment and could not dominate it. The favourable missingness phenomenon concerns comparison with the ordinary CC benchmark.

Subsequent work has clarified the information structure underlying this phenomenon and extended it beyond the original Gaussian setting. Information decompositions separate the conditional class-label information lost through missingness from the information contributed by the observed missingness indicators [3]. Related analyses have established favourable-missingness effects in other parametric classification models [4], [5]. More generally, Setoudehtazangi and McLachlan [6] developed a nuisance-adjusted information decomposition together with the local second-order geometry of multiclass zero–one classification risk. This analysis builds on the classical excess-risk approach to discriminant efficiency, in which the expected increase in classification error due to estimation of the discriminant rule admits an O(n−1)O(n^{-1}) expansion [7]. In the informative-missingness setting, favourable performance does not require improvement in every parameter direction: classification efficiency depends on how the resulting estimation uncertainty projects onto directions that perturb the active Bayes decision boundary.

These results compare statistical experiments under a fixed classification objective. At deployment, different errors may carry different losses, and changing those losses changes the Bayes action even when the data-generating distribution remains fixed [8]. Dependence of classifier comparisons on misclassification costs is well established. Adams and Hand [9] studied comparisons under uncertain costs, and Drummond and Holte [10] developed cost curves for comparing classifiers across operating conditions. Under correct posterior specification, a fixed fitted model can also be deployed under different costs by changing its posterior threshold [11].

Cost-sensitive learning with incompletely labelled samples has been studied through semi-supervised support vector machines and EM-based procedures [12], [13]. Our contribution concerns the first-order comparison of complete classification and classifier-linked informative partial classification: we derive explicit deployment-cost crossings and prove that their required covariance geometry is generated by a finite missingness mechanism at a fixed marginal missing-label proportion.

We study precisely this question. The data-generating model, the informative missingness mechanism, and the two statistical experiments are held fixed. Only the deployment loss is varied. We show that the resulting classification-risk ordering need not be invariant: the same informative partially classified experiment can be favourable for one deployment target and unfavourable for another. We refer to this phenomenon as decision-target reversal.

The possibility of target-dependent ordering is consistent with the classical theory for comparison of statistical experiments [14], [15], [16]. Blackwell dominance gives a uniform risk ordering over decision problems; in its absence, a pair of experiments need not retain the same ordering under different losses. Our aim is not to restate this general decision-theoretic fact, but to identify the classification-specific mechanism that produces reversal under informative label missingness, to characterize explicitly the deployment losses at which the ordering changes, and to determine when the covariance geometry required for such a reversal can arise from the missingness mechanism itself. The mechanism is transparent in binary Gaussian discrimination. Let

D=VPC−VCCD = V_{\mathrm{PC}} - V_{\mathrm{CC}}

denote the difference between the asymptotic covariance matrices of the classifier parameters under informative partial and complete classification. Informative missingness can reduce estimation uncertainty in some parameter directions while increasing it in others, so DD may be indefinite. For a binary cost matrix CC, let tCt_C denote the corresponding Bayes decision boundary. We show that the leading difference in deployment risk is governed by

QD(tC)=d00+2tCd01+tC2d11+∑j=2pdjj.Q_D(t_C) = d_{00} + 2t_Cd_{01} + t_C^2d_{11} + \sum_{j=2}^{p}d_{jj}.

Thus the statistical experiment determines the fixed covariance geometry DD, whereas the deployment loss determines which part of that geometry is relevant to classification by moving the Bayes boundary. Changing the loss can therefore change the sign of the risk comparison without changing either training experiment.

In one dimension, this representation yields explicit critical cost ratios at which the ordering reverses. We also show that the required indefinite covariance geometry is not an artificial assumption: for a finite uncertainty-dependent missingness mechanism with a fixed marginal missing-label proportion, it occurs over a nonempty open region of the parameter space. The phenomenon is therefore structural rather than confined to a specially chosen numerical example.

The risk comparison is not specific to informative label missingness: it applies to any two regular estimators of the same model. Informative missingness provides the concrete likelihood construction for which we establish the covariance geometry required for reversal. The same principle extends to multiclass finite-action classification. For a loss matrix CC, let HCH_C denote the local curvature of the corresponding population Bayes risk. Under regularity conditions, an estimator with asymptotic covariance VV satisfies

E{RC(θ^)}−RC∗=12ntr⁡(HCV)+o(n−1).E\{R_C(\widehat{\theta})\} - R_C^* = \frac{1}{2n}\operatorname{tr}(H_CV) + o(n^{-1}).

For informative partial versus complete classification, the leading comparison is therefore

Δ(C)=tr⁡{HC(VPC−VCC)}.\Delta(C) = \operatorname{tr}\{H_C(V_{\mathrm{PC}} - V_{\mathrm{CC}})\}.

This yields the decision-target frontier

BD={C:tr⁡(HCD)=0}.\mathcal{B}_D = \{C:\operatorname{tr}(H_CD) = 0\}.

The general formulation also reveals a distinction from the one-dimensional binary case: indefiniteness of DD alone does not guarantee reversal, because the family of curvature matrices generated by admissible losses need not probe both favourable and unfavourable directions of DD.

The paper therefore characterizes how deployment costs alter the first-order comparison of complete and informative partial classification. We derive the local cost-sensitive excess-risk expansion for binary Gaussian discrimination and explicit reversal thresholds in one dimension; establish that the covariance geometry required for reversal is generated by finite informative-missingness mechanisms at a fixed marginal missing-label proportion; and extend the analysis to multiclass finite-action problems through loss-specific active decision-boundary curvature. Monte Carlo experiments illustrate the predicted reversal at finite sample sizes, including under unequal class probabilities. A descriptive gastrointestinal-lesion application examines cost sensitivity when label availability is determined by expert agreement. The application treats the relative error costs as sensitivity parameters, rather than as estimates of clinical utility.

The remainder of the paper is organized as follows. Section 2 develops the loss-specific local risk geometry for binary classification and characterizes decision-target reversal. Section 3 derives the efficient information under informative label missingness and establishes the existence of the required covariance geometry. Section 4 gives the multiclass finite-action extension. Section 5 presents the population and finite-sample numerical results, Section 6 gives the gastrointestinal-lesion application, and Section 7 concludes.

Decision-target-dependent classification risk

Let Z∈{1,2}Z \in\{1,2\} denote the class label and Y∈RpY \in\mathbb{R}^{p} the feature vector. We begin with the canonical homoscedastic Gaussian discrimination model

Y∣Z=1∼Np(Δ2e1,Ip),Y \mid Z=1 \sim N_p\left(\frac{\Delta}{2}e_1,I_p\right),
Y∣Z=2∼Np(−Δ2e1,Ip).(1)Y \mid Z=2 \sim N_p\left(-\frac{\Delta}{2}e_1,I_p\right). \tag*{(1)}

where Δ>0\Delta>0 and

Pr⁡(Z=1)=π1,Pr⁡(Z=2)=π2=1−π1.\Pr(Z=1)=\pi_1,\qquad\Pr(Z=2)=\pi_2=1-\pi_1.

Writing

λ=log⁡(π1π2),\lambda=\log\left(\frac{\pi_1}{\pi_2}\right),

the posterior log-odds at the true parameter value are

η0(y)=log⁡Pr⁡(Z=1∣Y=y)Pr⁡(Z=2∣Y=y)=λ+Δy1.(2)\eta_0(\mathbf{y})=\log\frac{\Pr(Z=1\mid Y=\mathbf{y})}{\Pr(Z=2\mid Y=\mathbf{y})}=\lambda+\Delta y_1. \tag*{(2)}

Suppose that the consequences of the two types of misclassification are not necessarily equal. Let C12>0C_{12}>0 denote the loss incurred by assigning an observation from class 2 to class 1, and let C21>0C_{21}>0 denote the loss incurred by assigning an observation from class 1 to class 2. Correct classifications have zero loss. The Bayes rule assigns an observation to class 1 whenever

C12Pr⁡(Z=2∣Y=y)≤C21Pr⁡(Z=1∣Y=y),C_{12}\Pr(Z=2\mid Y=\mathbf{y})\le C_{21}\Pr(Z=1\mid Y=\mathbf{y}),

or, equivalently,

η0(y)≥r,r=log⁡(C12C21).(3)\eta_0(\mathbf{y})\ge r,\qquad r=\log\left(\frac{C_{12}}{C_{21}}\right). \tag*{(3)}

Its decision boundary is therefore

y1=tC,tC=r−λΔ.(4)y_1=t_C,\qquad t_C=\frac{r-\lambda}{\Delta}. \tag*{(4)}

Thus changing the relative misclassification losses moves the deployment boundary even though the underlying statistical model is unchanged.

Consider a local perturbation of the discriminant,

ηh(y)=λ+h0+(Δ+h1)y1+∑j=2phjyj,(5)\eta_h(\mathbf{y})=\lambda+h_0+(\Delta+h_1)y_1+\sum_{j=2}^{p}h_jy_j, \tag*{(5)}

where h=(h0,…,hp)T\mathbf{h}=(h_0,\ldots,h_p)^\mathsf{T} is close to zero. Let RC(h)R_C(\mathbf{h}) denote the expected deployment loss of the classifier induced by (5), evaluated under the true distribution, and let RC∗=RC(0)R_C^*=R_C(0) denote the Bayes risk.

The following result gives the local cost-sensitive analogue of the classical excess-error expansion for normal discrimination.

Proposition 1. Under model (1), as ∥h∥→0\lVert\mathbf{h}\rVert\to0,

RC(h)−RC∗=mC2Δ{(h0+tCh1)2+∑j=2phj2}+o(∥h∥2),(6)R_C(\mathbf{h})-R_C^*=\frac{m_C}{2\Delta}\left\{(h_0+t_Ch_1)^2+\sum_{j=2}^{p}h_j^2\right\}+o(\lVert\mathbf{h}\rVert^2), \tag*{(6)}

where

mC=C21π1ϕ(tC−Δ2)=C12π2ϕ(tC+Δ2)>0.(7)m_C=C_{21}\pi_1\phi\left(t_C-\frac{\Delta}{2}\right)=C_{12}\pi_2\phi\left(t_C+\frac{\Delta}{2}\right)>0. \tag*{(7)}

The proof is given in Supplementary Section ??.

To connect the local expansion with estimation uncertainty, parameterize the fitted discriminant by

ηβ(y)=λ+β0+β1y1+∑j=2pβjyj,β∗=(0,Δ,0,…,0)T.\eta_{\boldsymbol{\beta}}(\mathbf{y})=\lambda+\beta_0+\beta_1y_1+\sum_{j=2}^{p}\beta_jy_j,\qquad\boldsymbol{\beta}^*=(0,\Delta,0,\ldots,0)^\mathsf{T}.

Thus the perturbation in (5) is h=β−β∗\mathbf{h}=\boldsymbol{\beta}-\boldsymbol{\beta}^*. The constant λ\lambda centers the true intercept for the analysis; the fitted intercept λ+β^0\lambda+\widehat{\beta}_0 is estimated, and the true class probabilities are not supplied as known quantities. Suppose that an estimator β^\widehat{\boldsymbol{\beta}} in these discriminant coordinates satisfies

n(β^−β∗)→dNp+1(0,V),\sqrt{n}(\widehat{\boldsymbol{\beta}}-\boldsymbol{\beta}^*)\xrightarrow{d}N_{p+1}(0,V),

together with the moment conditions required to average the local quadratic expansion. Proposition 1 then yields

E{RC(β^)}−RC∗=mC2Δn{v00+2tCv01+tC2v11+∑j=2pvjj}+o(n−1),(8)E\{R_C(\widehat{\boldsymbol{\beta}})\}-R_C^*=\frac{m_C}{2\Delta n}\left\{v_{00}+2t_Cv_{01}+t_C^2v_{11}+\sum_{j=2}^{p}v_{jj}\right\}+o(n^{-1}), \tag*{(8)}

where V=(vjk)V=(v_{jk}).

Remark 2 (Connection with the classical excess-error expansion). For equal misclassification costs, C12=C21C_{12}=C_{21}, we have r=0r=0 and hence

tC=−λΔ.t_C=-\frac{\lambda}{\Delta}.

Consequently, the covariance contribution in (8) reduces to

v00−2λΔv01+λ2Δ2v11+∑j=2pvjj,v_{00}-\frac{2\lambda}{\Delta}v_{01}+\frac{\lambda^2}{\Delta^2}v_{11}+\sum_{j=2}^{p}v_{jj},

which is the covariance combination appearing in the classical excess-error expansion of Efron [7] and subsequently used by Ahfock and McLachlan [2] for the ordinary zero-one classification comparison. Thus the equal-cost case is a single point in the loss-indexed family considered here. Varying the deployment loss moves the Bayes decision boundary and thereby changes the covariance projection relevant to classification.

Consider two statistical experiments with asymptotic covariance matrices V1V_1 and V2V_2, and write

D=V1−V2=(djk).D=V_1-V_2=(d_{jk}).

Since mC/(2Δ)>0m_C/(2\Delta)>0, their first-order deployment-risk ordering is determined by

QD(tC)=d00+2tCd01+tC2d11+∑j=2pdjj.(9)Q_D(t_C)=d_{00}+2t_Cd_{01}+t_C^2d_{11}+\sum_{j=2}^{p}d_{jj}. \tag*{(9)}

The statistical experiment is fixed in (9); only the deployment loss, through tCt_C, changes. Consequently, an efficiency ordering obtained under one decision target need not persist under another.

For p=1p=1, this dependence can be characterized exactly.

Theorem 3. Let p=1p=1 and define

QD(t)=d00+2d01t+d11t2.Q_D(t)=d_{00}+2d_{01}t+d_{11}t^2.

If d11≠0d_{11}\ne0, define

DD=d012−d00d11.\mathcal{D}_D=d_{01}^2-d_{00}d_{11}.

When DD>0D_D > 0, the first-order deployment-risk ordering changes at the two boundary locations

t(1)=−d01−DDd11,t(2)=−d01+DDd11.t^{(1)} = \frac{-d_{01}-\sqrt{D_D}}{d_{11}}, \qquad t^{(2)} = \frac{-d_{01}+\sqrt{D_D}}{d_{11}}.

The corresponding positive cost ratios are

c~j=exp⁡{λ+Δt(j)},j=1,2.\widetilde{c}_j = \exp\{\lambda+\Delta t^{(j)}\}, \qquad j=1,2.

Writing

clow=min⁡(c~1,c~2),chigh=max⁡(c~1,c~2),c_{\mathrm{low}}=\min(\widetilde{c}_1,\widetilde{c}_2), \qquad c_{\mathrm{high}}=\max(\widetilde{c}_1,\widetilde{c}_2),

gives

0<clow<chigh<∞.0<c_{\mathrm{low}}<c_{\mathrm{high}}<\infty.

When DD=0D_D=0, the quadratic is tangent to zero and there is no genuine sign reversal, whereas DD<0D_D<0 yields no real critical boundary location.

If d11=0d_{11}=0 and d01≠0d_{01}\ne0, there is a single critical boundary location

t∗=−d002d01,t_*=-\frac{d_{00}}{2d_{01}},

and hence a single positive critical cost ratio

c∗=exp⁡{λ+Δt∗}.c_*=\exp\{\lambda+\Delta t_*\}.

If d11=d01=0d_{11}=d_{01}=0, the first-order comparison is independent of the decision target.

In particular, if DD is indefinite, then

DD=−det⁡(D)>0,D_D=-\det(D)>0,

and there exist positive cost ratios for which the two experiments have opposite first-order deployment-risk orderings.

The proof is given in Supplementary Section ??.

Theorem 3 separates two questions that are identical under a fixed loss but distinct when the deployment objective varies. The covariance difference DD describes how the statistical experiment changes estimation uncertainty, whereas the cost ratio determines which directions of that uncertainty perturb the relevant decision boundary. An indefinite DD therefore does not assign an intrinsic “better” experiment: the answer depends on the decision target.

Informative label missingness

Let MM denote the label-missingness indicator, with M=1M=1 when the class label is unavailable. We assume

M⊥Z∣Y,(10)M \perp Z \mid Y, \tag*{(10)}

and allow the probability of a missing label to depend on the classifier through

Pr⁡(M=1∣Y=y)=q(y;β,ξ),(11)\Pr(M=1\mid Y=y)=q(y;\beta,\xi), \tag*{(11)}

where β\beta denotes the parameters governing classification and ξ\xi contains parameters specific to the missingness mechanism. Thus the missingness indicator may itself carry information about β\beta.

We compare two experiments. Under complete classification,

ECC:(Y,Z)\mathcal{E}_{\mathrm{CC}}:(Y,Z)

is observed. Under partial classification,

EPC:{Y,M,(1−M)Z}\mathcal{E}_{\mathrm{PC}}:\{Y,M,(1-M)Z\}

is observed. These are distinct statistical experiments: in EPC\mathcal{E}_{\mathrm{PC}}, the missingness indicator is an observed, parameter-linked random variable, whereas complete classification refers to direct availability of the class label.

For the information identities below, β\beta indexes the full distribution of (Y,Z)(Y,Z), and ξ\xi is the only additional nuisance parameter. Additional unknown location or covariance parameters require the full generative information calculation and subsequent nuisance adjustment or projection into discriminant coordinates.

Let IYI_Y denote the Fisher information for β\beta in the marginal distribution of YY, and let

IZ∣Y(y)=E[SZ∣YSZ∣YT∣Y=y]I_{Z\mid Y}(y)=E\left[S_{Z\mid Y}S_{Z\mid Y}^{\mathsf T}\mid Y=y\right]

denote the conditional information in the class label. The information under complete classification is

ICC=IY+E{IZ∣Y(Y)}.(12)I_{\mathrm{CC}}=I_Y+E\{I_{Z\mid Y}(Y)\}. \tag*{(12)}

Under partial classification, an unavailable label removes its conditional label information, but the missingness event contributes information whenever qq depends on β\beta. After eliminating the nuisance parameter ξ\xi, the efficient information is

IPCeff=ICC−E[q(Y)IZ∣Y(Y)]+IMeff,(13)I_{\mathrm{PC}}^{\mathrm{eff}}=I_{\mathrm{CC}}-E\left[q(Y)I_{Z\mid Y}(Y)\right]+I_M^{\mathrm{eff}}, \tag*{(13)}

where

IMeff=IββM−IβξM(IξξM)−1IξβM.(14)I_M^{\mathrm{eff}}=I_{\beta\beta}^{M}-I_{\beta\xi}^{M}(I_{\xi\xi}^{M})^{-1}I_{\xi\beta}^{M}. \tag*{(14)}

The two terms on the right-hand side of (13) have different roles. The first is the information lost through unavailable class labels; the second is the classifier information retained in the pattern of label availability after nuisance variation in the missingness mechanism has been removed.

More generally, if the generative parameter is θ\theta and the discriminant coefficients are β=ψ(θ)\beta=\psi(\theta), apply (13)–(14) in the full θ\theta coordinates. If KPCK_{\mathrm{PC}} is the resulting information after eliminating ξ\xi, then

VPC=G0KPC−1G0T,V_{\mathrm{PC}}=G_0K_{\mathrm{PC}}^{-1}G_0^{\mathsf T},
VCC=G0(ICCθ)−1G0T,V_{\mathrm{CC}}=G_0(I_{\mathrm{CC}}^\theta)^{-1}G_0^{\mathsf T},
G0=∂ψ(θ)∂θT∣θ0.G_0=\left.\frac{\partial\psi(\theta)}{\partial\theta^{\mathsf T}}\right|_{\theta_0}.

These covariance matrices follow from nuisance elimination and the delta method; see Setoudet h zangi and McLachlan [6].

To expose the resulting geometry, consider the two-parameter Gaussian likelihood

Pr⁡(Z=1)=expit⁡(b),\Pr(Z=1)=\operatorname{expit}(b),
Y∣Z=1∼N(δ/2,1),Y\mid Z=1\sim N(\delta/2,1),
Y∣Z=2∼N(−δ/2,1).(15)Y\mid Z=2\sim N(-\delta/2,1). \tag*{(15)}

where b∈Rb\in\mathbb{R} and δ>0\delta>0 are estimated. The midpoint of the two means and the within-class variance are known and fixed at zero and one, respectively. These are restrictions on the fitted likelihood, not consequences of standardizing the true distribution. The fitted posterior log-odds are b+δyb+\delta y.

The symmetric configuration has true values b=0b = 0 and δ=Δ\delta= \Delta, so that π1=π2=1/2\pi_1 = \pi_2 = 1/2 and η0(y)=Δy\eta_0(y) = \Delta y. Equal class probabilities are not imposed during fitting. At this configuration (β0,β1)=(b,δ)(\beta_0, \beta_1) = (b, \delta). For an unequal-prior configuration, the centered coordinates in Section 2 are (β0,β1)=(b−λ,δ)(\beta_0, \beta_1) = (b - \lambda, \delta). Both parameters of the mechanism q(y;b,δ,ξ)=expit⁡{ξ0+ξ1(b+δy)2}q(y; b, \delta, \xi) = \operatorname{expit}\{\xi_0 + \xi_1(b + \delta y)^2\} are also estimated freely.

We use the uncertainty-dependent mechanism

q(y)=expit⁡{ξ0+ξ1η0(y)2}=expit⁡{ξ0+ξ1Δ2y2}.(16)q(y) = \operatorname{expit}\{\xi_0 + \xi_1\eta_0(y)^2\} = \operatorname{expit}\{\xi_0 + \xi_1\Delta^2y^2\}. \tag*{(16)}

For ξ1<0\xi_1 < 0, labels are more likely to be unavailable near the Bayes decision boundary, where the posterior evidence for the two classes is weakest.

Let

τ(y)=Pr⁡(Z=1∣Y=y)=expit⁡(Δy).\tau(y) = \Pr(Z = 1 \mid Y = y) = \operatorname{expit}(\Delta y).

In the discriminant parameterization introduced in Section 2,

β=(β0,β1)⊤,β⋆=(0,Δ)⊤,\beta= (\beta_0, \beta_1)^\top,\qquad\beta^\star= (0, \Delta)^\top,

the conditional label information is

IZ∣Y(y)=τ(y){1−τ(y)}(1yyy2).(17)I_{Z\mid Y}(y) = \tau(y)\{1-\tau(y)\} \begin{pmatrix} 1 & y\\ y & y^2 \end{pmatrix}. \tag*{(17)}

The next result shows that informative missingness affects the two discriminant directions differently.

Proposition 4. Under the fitted likelihood (15), at the true values b=0b = 0 and δ=Δ\delta= \Delta, and under the missingness mechanism (16), the efficient information contributed by the missingness indicator is

IMeff=(4ξ12Δ2E[q(Y){1−q(Y)}Y2]000).(18)I_M^{\mathrm{eff}} = \begin{pmatrix} 4\xi_1^2\Delta^2 E[q(Y)\{1-q(Y)\}Y^2] & 0\\ 0 & 0 \end{pmatrix}. \tag*{(18)}

Moreover,

ICC=14I2(19)I_{\mathrm{CC}} = \frac{1}{4}I_2 \tag*{(19)}

and

IPCeff=(J000J1),(20)I_{\mathrm{PC}}^{\mathrm{eff}} = \begin{pmatrix} J_0 & 0\\ 0 & J_1 \end{pmatrix}, \tag*{(20)}

where

J0=14−E[q(Y)τ(Y){1−τ(Y)}]+4ξ12Δ2E[q(Y){1−q(Y)}Y2],(21)J_0 = \frac{1}{4} - E[q(Y)\tau(Y)\{1-\tau(Y)\}] + 4\xi_1^2\Delta^2 E[q(Y)\{1-q(Y)\}Y^2], \tag*{(21)}
J1=14−E[q(Y)τ(Y){1−τ(Y)}Y2].(22)J_1 = \frac{1}{4} - E[q(Y)\tau(Y)\{1-\tau(Y)\}Y^2]. \tag*{(22)}

The proof is given in Supplementary Section ??.

Since the expectation subtracted in (22) is strictly positive whenever labels are missing with positive probability,

J1<14.J_1 < \frac{1}{4}.

Thus partial classification necessarily loses information in the slope direction in this symmetric model. The intercept direction is different. It gains information relative to complete classification precisely when

4ξ12Δ2E[q(Y){1−q(Y)}Y2]>E[q(Y)τ(Y){1−τ(Y)}].(23)4\xi_1^2\Delta^2 E[q(Y)\{1-q(Y)\}Y^2] > E[q(Y)\tau(Y)\{1-\tau(Y)\}]. \tag*{(23)}

When (23) holds,

D=(IPCeff)−1−ICC−1D = (I_{\mathrm{PC}}^{\mathrm{eff}})^{-1} - I_{\mathrm{CC}}^{-1}

has one negative and one positive eigenvalue. The partially classified experiment then improves estimation in one discriminant direction while degrading it in another. By Theorem 3, neither experiment has a uniform first-order advantage over all deployment cost ratios.

Existence of a target-sensitive regime

Condition (23) identifies the geometry required for decision-target reversal, but does not by itself establish that such a configuration can arise at a fixed amount of missingness. We now show that it does.

Write

ξ1=−a,a>0,\xi_1 = -a,\qquad a > 0,

and, for each aa, choose ξ0=ξ0(a)\xi_0 = \xi_0(a) so that

E{qa(Y)}=γ,0<γ<1,(24)E\{q_a(Y)\} = \gamma,\qquad0 < \gamma< 1, \tag*{(24)}

where

qa(y)=expit⁡{ξ0(a)−aΔ2y2}.(25)q_a(y) = \operatorname{expit}\{\xi_0(a) - a\Delta^2y^2\}. \tag*{(25)}

The calibration in (24) is used only to compare data-generating mechanisms having the same marginal proportion of missing labels. The parameters ξ0\xi_0 and ξ1\xi_1 remain unrestricted nuisance parameters in the statistical model.

Let

VPC(a)={IPCeff(a)}−1,VCC=ICC−1,V_{\mathrm{PC}}(a) = \{I_{\mathrm{PC}}^{\mathrm{eff}}(a)\}^{-1},\qquad V_{\mathrm{CC}} = I_{\mathrm{CC}}^{-1},

and define

D(a)=VPC(a)−VCC.D(a) = V_{\mathrm{PC}}(a) - V_{\mathrm{CC}}.

Theorem 5. Under the fitted likelihood (15), suppose that the true values are b=0b = 0 and δ=Δ>0\delta= \Delta> 0, and that the missingness mechanism is given by (25), with ξ0(a)\xi_0(a) calibrated according to (24). For every γ∈(0,1)\gamma\in(0,1), there exists a finite a0=a0(Δ,γ)a_0 = a_0(\Delta,\gamma) such that, for all a>a0a > a_0,

D(a)=VPC(a)−VCCD(a) = V_{\mathrm{PC}}(a) - V_{\mathrm{CC}}

is indefinite. More specifically,

D00(a)<0,D11(a)>0.(26)D_{00}(a) < 0,\qquad D_{11}(a) > 0. \tag*{(26)}

Consequently, there exist positive misclassification-cost ratios for which partial classification has smaller first-order deployment risk than complete classification and other cost ratios for which the ordering is reversed.

The proof is given in Supplementary Section ??.

Theorem 5 shows that target dependence is not merely a possibility created by an arbitrary indefinite covariance matrix. It arises from the informative-missingness model itself while the marginal proportion of missing labels is held fixed. In the symmetric model, the missingness indicator can contribute sufficient information about the intercept direction to offset the information lost through unavailable labels, while no corresponding efficient missingness information remains in the slope direction.

The result is established through a limiting argument as aa becomes large, but the conclusion concerns finite values of aa. Moreover, whenever the inequalities in (26) are strict at a finite parameter value, continuity of the information matrices implies that they persist in an ordinary neighborhood of that configuration. If the fixed-γ\gamma calibration is imposed, the implicit-function theorem shows that the same inequalities persist in a relative neighborhood within the calibrated family. Thus the target-sensitive regime is not confined to an isolated parameter configuration.

Extension to multiclass finite-action losses

The one-dimensional binary Gaussian model provides explicit decision-target reversal thresholds. We now consider multiclass problems with finite action losses. Building on the zero–one active-boundary expansion of Setoudehtazangi and McLachlan [6], we derive the loss-specific curvature matrix and characterize reversal through the family of curvature matrices attainable by varying the deployment loss.

Let Z∈{1,…,K}Z \in\{1,\ldots,K\} and let τk(y;θ)\tau_k(y;\theta) denote the posterior probability of class kk. Suppose that the available actions are a∈{1,…,A}a \in\{1,\ldots,A\} and that C=(Cak)C=(C_{ak}) is a finite loss matrix. The conditional risk of action aa is

ρa(y;θ)=∑k=1KCakτk(y;θ),(27)\rho_a(y;\theta)=\sum_{k=1}^{K} C_{ak}\tau_k(y;\theta), \tag*{(27)}

and the Bayes action minimizes (27).

The decision problem is invariant to multiplication of CC by a common positive constant and to addition of the same class-dependent vector to every action row, since these transformations preserve the ordering of the conditional action risks. Accordingly, the decision-target frontier below is understood on the resulting equivalence classes of loss matrices.

For two actions aa and bb, define the contrast

gab(y;θ)=ρa(y;θ)−ρb(y;θ).(28)g_{ab}(y;\theta)=\rho_a(y;\theta)-\rho_b(y;\theta). \tag*{(28)}

At the true parameter θ0\theta_0, let FabC\mathcal{F}_{ab}^{C} denote the active decision face on which

ρa(y;θ0)=ρb(y;θ0)<ρc(y;θ0),c∉{a,b}.\rho_a(y;\theta_0)=\rho_b(y;\theta_0)<\rho_c(y;\theta_0),\qquad c\notin\{a,b\}.

Assume that the feature distribution has fixed support S⊆Rp\mathcal{S}\subseteq\mathbb{R}^{p} and a continuous, locally bounded density, and that the contrasts gabg_{ab} are jointly twice continuously differentiable in (y,θ)(y,\theta) near θ0\theta_0. The minimizing action is unique almost everywhere. On compact subsets of the interior of S\mathcal{S}, the active tie sets have a finite regular stratification: pairwise faces are smooth with nonzero spatial contrast gradient, and higher-order active intersections are transverse and have codimension at least two. Assume that compact sets KLK_L exhaust S\mathcal{S}, with boundaries transverse to these strata. The local chart and codimension conditions are detailed in Supplementary Section ??.

Define

bab(y)=∇θgab(y;θ0).(29)b_{ab}(y)=\nabla_\theta g_{ab}(y;\theta_0). \tag*{(29)}

Assume the surface-integrability condition

∑a<b∫FabCfY(y;θ0)∥bab(y)∥2∥∇ygab(y;θ0)∥ dS(y)<∞.(30)\sum_{a<b}\int_{\mathcal{F}_{ab}^{C}} \frac{f_Y(y;\theta_0)\lVert b_{ab}(y)\rVert^2} {\lVert\nabla_y g_{ab}(y;\theta_0)\rVert}\,dS(y)<\infty. \tag*{(30)}

Let ah(y)a_h(y) minimize ρa(y;θ0+h)\rho_a(y;\theta_0+h) under a fixed tie convention, and set

LC(y;h)=ρah(y)(y;θ0)−min⁡aρa(y;θ0).\mathcal{L}_C(y;h)=\rho_{a_h(y)}(y;\theta_0)-\min_a\rho_a(y;\theta_0).

In addition, assume the uniform quadratic tail condition

lim⁡L→∞lim sup⁡h→01∥h∥2∫S∖KLfY(y;θ0)LC(y;h) dy=0.(31)\lim_{L\to\infty}\limsup_{h\to0}\frac{1}{\lVert h\rVert^2} \int_{\mathcal{S}\setminus K_L} f_Y(y;\theta_0)\mathcal{L}_C(y;h)\,dy=0. \tag*{(31)}

Proposition 6. Under the preceding regularity conditions, as ∥h∥→0\lVert h\rVert\to0,

RC(θ0+h)−RC∗=12h⊤HCh+o(∥h∥2),(32)R_C(\theta_0+h)-R_C^*=\frac{1}{2}h^\top H_C h+o(\lVert h\rVert^2), \tag*{(32)}

where

HC=∑a<b∫FabCfY(y;θ0)bab(y)bab(y)⊤∥∇ygab(y;θ0)∥ dS(y).(33)H_C=\sum_{a<b}\int_{\mathcal{F}_{ab}^{C}} \frac{f_Y(y;\theta_0)b_{ab}(y)b_{ab}(y)^\top} {\lVert\nabla_y g_{ab}(y;\theta_0)\rVert}\,dS(y). \tag*{(33)}

If, in addition,

n(θ^−θ0)→dN(0,V),\sqrt{n}(\widehat{\theta}-\theta_0)\xrightarrow{d}N(0,V),

the sequence

{∥n(θ^−θ0)∥2}n≥1\left\{\left\lVert\sqrt{n}(\widehat{\theta}-\theta_0)\right\rVert^2\right\}_{n\geq1}

is uniformly integrable, and the remainder in (32), evaluated at h=θ^−θ0h=\widehat{\theta}-\theta_0, is uniformly integrable after multiplication by nn, then

E{RC(θ^)}−RC∗=12ntr⁡(HCV)+o(n−1).(34)\mathbb{E}\{R_C(\widehat{\theta})\}-R_C^*=\frac{1}{2n}\operatorname{tr}(H_CV)+o(n^{-1}). \tag*{(34)}

The proof is given in Supplementary Section ??.

For the complete- and partially classified experiments, write

D=VPC−VCC.(35)D=V_{\mathrm{PC}}-V_{\mathrm{CC}}. \tag*{(35)}

Their first-order deployment-risk difference is then governed by

ΔC=tr⁡(HCD).(36)\Delta_C=\operatorname{tr}(H_CD). \tag*{(36)}

With the convention in (35),

ΔC<0\Delta_C<0

means that partial classification has smaller first-order deployment risk, whereas ΔC>0\Delta_C>0 favors complete classification.

The set

BD={C:tr⁡(HCD)=0}(37)\mathcal{B}_D=\{C:\operatorname{tr}(H_CD)=0\} \tag*{(37)}

defines the decision-target frontier. In contrast with the one-dimensional binary Gaussian case, this frontier is generally not available in closed form because changing CC moves the active decision faces and may also change which actions are locally optimal. Decision-target reversal occurs whenever the attainable family {HC}\{H_C\} intersects both sides of the hyperplane

H↦tr⁡(HD)=0.H\mapsto\operatorname{tr}(HD)=0.

More generally, for a class C\mathcal{C} of admissible deployment losses, decision-target reversal occurs precisely when

inf⁡C∈Ctr⁡(HCD)<0<sup⁡C∈Ctr⁡(HCD).(38)\inf_{C\in\mathcal{C}}\operatorname{tr}(H_CD)<0<\sup_{C\in\mathcal{C}}\operatorname{tr}(H_CD). \tag*{(38)}

Thus indefiniteness of DD alone is not sufficient in the general multiclass problem: the relevant question is whether the attainable family of loss-specific curvature matrices {HC:C∈C}\{H_C:C\in\mathcal{C}\} probes both favourable and unfavourable directions of the covariance difference.

Finite-sample validation of decision-target reversal

We next examine whether the decision-target reversal predicted by the asymptotic theory is visible at practically relevant sample sizes, and whether the local risk expansion explains the finite-sample ordering of the two experiments. The purpose of the experiment is to compare deployment risks and examine how closely the local quadratic expansion tracks the estimated finite-sample risk curves. Differences from the population curve can reflect finite-sample estimation effects as well as Monte Carlo variability.

We use the symmetric Gaussian configuration

π1=π2=12,Δ=1.5,\pi_1 = \pi_2 = \frac{1}{2}, \qquad\Delta= 1.5,

with missing-label probability

q(y)=expit⁡{ξ0+ξ1(Δy)2}.q(y) = \operatorname{expit}\left\{\xi_0 + \xi_1(\Delta y)^2\right\}.

The mechanism strength is fixed at

ξ1=−0.25,\xi_1 = -0.25,

and the intercept is calibrated to

ξ0=−0.206813,\xi_0 = -0.206813,

which gives the marginal missing-label proportion

Pr⁡(M=1)=0.30.\Pr(M = 1) = 0.30.

For this configuration, the population covariance difference derived in § 3 is

D=VPC−VCC=(−0.471312000.447128).D = V_{\mathrm{PC}} - V_{\mathrm{CC}} = \begin{pmatrix} -0.471312 & 0 \\ 0 & 0.447128 \end{pmatrix}.

Thus the partially classified experiment is asymptotically more efficient in the intercept direction and less efficient in the slope direction. The corresponding population critical cost ratios are

clow=0.214374,chigh=4.664740.c_{\mathrm{low}} = 0.214374, \qquad c_{\mathrm{high}} = 4.664740.

Consequently, the first-order theory predicts that partial classification is favourable for deployment targets between these critical values and unfavourable for sufficiently asymmetric costs outside this interval.

For each

n∈{500,1000,2000},n \in\{500, 1000, 2000\},

we generated 5000 independent samples. For every sample we fitted both the complete-classification estimator and the partially classified maximum-likelihood estimator, including estimation of the missingness parameters. The same generated sample was used for the two estimators within each replication. For deployment-risk evaluation, we normalized C21=1C_{21} = 1 and set C12=cC_{12} = c. Risk was evaluated exactly under the data-generating distribution over a grid of positive cost ratios. All 15000 paired fits were successful. Across all replications and sample sizes, the realized mean missing-label proportion was 0.29994, close to its target value of 0.30.

For a given cost ratio cc, let

ΔR^n(c)=1B∑b=1B{RC(β^PC(b))−RC(β^CC(b))},B=5000,\widehat{\Delta R}_n(c) = \frac{1}{B}\sum_{b=1}^{B}\left\{R_C\left(\widehat{\beta}_{\mathrm{PC}}^{(b)}\right) - R_C\left(\widehat{\beta}_{\mathrm{CC}}^{(b)}\right)\right\}, \qquad B = 5000,

denote the Monte Carlo estimate of the difference in deployment risk. Negative values therefore favour partial classification. We compare this quantity with the first-order approximation

ΔRn(1)(c;D)=mC2Δn{d00+2tCd01+tC2d11},tC=log⁡c−λΔ,\Delta R_n^{(1)}(c;D) = \frac{m_C}{2\Delta n}\left\{d_{00} + 2t_Cd_{01} + t_C^2d_{11}\right\}, \qquad t_C = \frac{\log c - \lambda}{\Delta},

first using the population covariance difference DD, and then using the empirical covariance difference

D^n=Cov⁡^{n(β^PC−β⋆)}−Cov⁡^{n(β^CC−β⋆)}.\widehat{D}_n = \widehat{\operatorname{Cov}}\left\{\sqrt{n}\left(\widehat{\beta}_{\mathrm{PC}} - \beta^\star\right)\right\} - \widehat{\operatorname{Cov}}\left\{\sqrt{n}\left(\widehat{\beta}_{\mathrm{CC}} - \beta^\star\right)\right\}.

This is a diagnostic comparison based on the same paired replications as the Monte Carlo risk curve. Agreement between these summaries does not independently establish crossing precision or separate finite-sample effects from Monte Carlo variability. We also computed empirical second-moment differences about the true parameter. Replacing the centered covariance differences by these second-moment differences changes the matrices by approximately 0.08%–0.11% in relative Frobenius norm across the four simulation configurations. Empirical estimation bias therefore contributes little to the reported quadratic comparisons.

We also compared covariance-based approximations with risk curves computed from disjoint batches of simulation replications. The symmetric equal-cost advantage persists in both risk-evaluation batches, whereas the unequal-prior advantage remains unresolved. The split comparison and its Monte Carlo limitations are reported in Supplementary Section ??.

Figure 1 shows the resulting scaled risk difference

Finite-sample decision-target reversal plot

Figure 1. Finite-sample decision-target reversal for π1=π2=1/2\pi_1 = \pi_2 = 1/2, Δ=1.5\Delta= 1.5, Pr⁡(M=1)=0.30\Pr(M = 1) = 0.30, and ξ1=−0.25\xi_1 = -0.25, based on 5000 paired replications at n=2000n = 2000, with C21=1C_{21} = 1. The solid curve estimates nΔR^n(c)n\Delta\widehat{R}_n(c); the dashed curve is the quadratic comparison using the empirical covariance difference D^n\widehat{D}_n; and the dotted curve is the population first-order approximation. The blue ribbon gives pointwise 95% Monte Carlo intervals calculated from paired risk differences; it is not a simultaneous band. The grey region and vertical lines indicate the population favourable interval, bounded by clow=0.214374c_{\mathrm{low}} = 0.214374 and chigh=4.664740c_{\mathrm{high}} = 4.664740. Negative values favour partial classification and positive values favour complete classification.

nΔR^n(c)n\widehat{\Delta R}_n(c)

for n=2000n = 2000, together with the two first-order approximations. The estimated finite-sample curve exhibits the sign pattern predicted by the theory: partial classification is favourable over an intermediate range of deployment costs, whereas complete classification is preferable in the outer portions of the displayed range. The curve is closely tracked by the quadratic approximation using D^n\widehat{D}_n. This agreement is consistent with the covariance–risk relation underlying the asymptotic calculation.

The agreement can be quantified through the zero crossings of the risk difference. Table 1 reports the empirical crossings obtained directly from the Monte Carlo risk curve, the crossings implied by D^n\widehat{D}_n, and the population critical values. At every sample size, the crossings of the observed risk curve are closely reproduced by those obtained from the empirical covariance geometry. For example, at n=2000n = 2000, the Monte Carlo crossings are 0.2310 and 5.2777, while the corresponding first-order values based on D^2000\widehat{D}_{2000} are 0.2269 and 5.2774. This agreement is a diagnostic of the quadratic risk representation, since both estimates use the same replications. It does not establish independent predictive accuracy or precise crossing locations.

nnMonte Carlo risk clowc_{\mathrm{low}}Monte Carlo risk chighc_{\mathrm{high}}Empirical D^n\widehat{D}_n clowc_{\mathrm{low}}Empirical D^n\widehat{D}_n chighc_{\mathrm{high}}Population theory clowc_{\mathrm{low}}Population theory chighc_{\mathrm{high}}
5000.29284.24180.28744.61250.21444.6647
10000.30433.35200.29933.37850.21444.6647
20000.23105.27770.22695.27740.21444.6647

Table 1. Critical cost ratios obtained from the Monte Carlo deployment-risk curve, from the first-order approximation using the empirical covariance difference D^n\widehat{D}_n, and from the population theory. The simulation uses 5000 replications for each sample size. The Monte Carlo crossings are obtained by linear interpolation of the mean risk difference in log⁡c\log c on the evaluated cost grid.

The same conclusion is obtained from a global comparison of the risk curves. The root mean squared discrepancy between the Monte Carlo risk difference and the population first-order approximation is 6.12×10−66.12 \times10^{-6}, 9.03×10−69.03 \times10^{-6}, and 1.52×10−61.52 \times10^{-6} for n=500n = 500, 1000, and 2000, respectively. When the population covariance difference is replaced by D^n\widehat{D}_n, the corresponding discrepancies are 2.70×10−62.70 \times10^{-6}, 2.65×10−72.65 \times10^{-7}, and 1.19×10−71.19 \times10^{-7}. The substantially closer agreement with the empirical-covariance approximation supports the local quadratic description of the reported risk curves. The discrepancy from the population curve may include both finite-sample effects and Monte Carlo variability in the estimated covariance difference.

As a simple interior target, consider equal misclassification costs, c=1c = 1. The population theory predicts that partial classification is favourable at this target. The Monte Carlo risk differences are

−4.03×10−5,−1.80×10−5,−1.28×10−5-4.03 \times10^{-5}, \qquad-1.80 \times10^{-5}, \qquad-1.28 \times10^{-5}

for n=500n = 500, 1000, and 2000, respectively. Their corresponding 95% Monte Carlo intervals are

(−5.56,−2.51)×10−5,(-5.56, -2.51) \times10^{-5},
(−2.53,−1.08)×10−5,(-2.53, -1.08) \times10^{-5},
(−1.66,−0.91)×10−5,(-1.66, -0.91) \times10^{-5},

all lying below zero. The first-order population values are, respectively,

−4.73×10−5,−2.37×10−5,−1.18×10−5.-4.73 \times10^{-5}, \qquad-2.37 \times10^{-5}, \qquad-1.18 \times10^{-5}.

Thus the favourable ordering at equal costs is resolved at the pointwise 95% Monte Carlo level for every sample size considered.

The symmetric simulation resolves opposite risk orderings at separated deployment targets. Crossing locations nevertheless have appreciable Monte Carlo uncertainty. At n=2000n = 2000, we resampled the 5000 paired replication IDs 2000 times, recomputed the mean risk curve, and interpolated its crossings in log⁡c\log c. All resamples produced two crossings within the evaluated range. Their 2.5th and 97.5th percentile ranges are (0.155,0.331)(0.155, 0.331) and (3.635,8.036)(3.635, 8.036), respectively. Both contain the corresponding population critical values. The observed crossing displacements should therefore not be attributed solely to finite-sample effects.

As a robustness check, we considered unequal class probabilities, π1=0.30\pi_1 = 0.30 and π2=0.70\pi_2 = 0.70. The population covariance difference has a substantial off-diagonal component and remains indefinite, with eigenvalues −0.3085-0.3085 and 0.4123. This establishes that reversal is attainable beyond the equal-prior configuration. The finite-sample mean curve has two estimated sign changes, but its favourable portion is not resolved from zero at the present Monte Carlo precision. The population calculation therefore supplies the robustness argument; the finite-sample curve remains illustrative. Full results are reported in Supplementary Section ??.

Gastrointestinal-lesion application

We illustrate decision-target dependence using the gastrointestinal-lesion data of Mesejo and Pizarro [17] and the partially classified construction of Lyu et al. [18]. The data comprise 76 lesions, with histology providing the reference class: 55 require resection and 21 do not. We retain the four previously selected image-derived features from the published analysis. The comparison is conditional on this historical representation and does not evaluate the original feature-selection procedure.

Agreement among seven endoscopists determines label availability. When all seven agree, the histological class label is available for fitting; otherwise it is masked. This gives 35 labelled and 41 unlabelled lesions. Expert agreement determines only label availability. Histology supplies every available training label and every evaluation label, including cases in which a unanimous expert decision disagrees with histology.

We compare complete classification (CC) with informative partial classification (FULL) using two Gaussian classes with unrestricted means and a shared covariance matrix. This shared-covariance specification replaces the component-specific covariance specification of the published analysis. Under FULL, label availability is modelled jointly through a logistic function of log posterior classification entropy, with both missingness parameters estimated.

Evaluation uses leave-one-out fitting. In each fold, feature standardization and all starting values are computed from the 75 training lesions. CC uses all training histological labels, whereas FULL uses only the agreement-defined available labels. The evaluated lesion contributes neither to preprocessing nor to initialization or fitting. CC is fitted by its exact Gaussian maximum-likelihood solution; FULL is fitted from multiple training-only starts. All 76 paired fits satisfy the numerical checks described in Supplementary Section ??. These checks establish reproducible numerical local optima, rather than a guarantee of global maximization.

Panel (a) of Figure 2 shows the first two standardized principal components, explaining 44.8% and 26.2% of feature variation. This projection is used only for visualization. Panel (b) compares entropy calculated from the held-out FULL posterior predictions. Mean entropy is 0.0267 for lesions with available labels and 0.2007 for lesions with masked labels; the corresponding medians are 0.0024 and 0.1132. These descriptive differences do not establish M⊥Z∣YM \perp Z \mid Y or validate the parametric missingness model, which remain working assumptions.

Gastrointestinal-lesion application under a shared-covariance Gaussian specification

Figure 2. Gastrointestinal-lesion application under a shared-covariance Gaussian specification. Panel (a) shows the first two standardized principal components of the four previously selected features, with histological class indicated by colour and label availability by symbol; the projection is used only for visualization. Panel (b) shows entropy from the held-out FULL posterior predictions. Panel (c) shows the empirical leave-one-out risk difference R^FULL(c)−R^CC(c)\widehat{R}_{\mathrm{FULL}}(c) - \widehat{R}_{\mathrm{CC}}(c). Negative values favour FULL and positive values favour CC. The inset shows the narrow reversals and tie interval at lower cost ratios. For the held-out predictions, preprocessing, initialization and fitting use training observations only, and all 76 paired fits pass the numerical checks. The principal-component projection in panel (a) uses all lesions for visualization only. Cost ratios are sensitivity parameters rather than clinical recommendations.

Let class 1 denote resection and class 2 no resection. Set C21=1C_{21}=1 and c=C12/C21c=C_{12}/C_{21}, where C12C_{12} is the loss of recommending resection for a true no-resection lesion and C21C_{21} is the loss of failing to recommend resection for a true resection lesion. For each fitted method, the held-out decision assigns a lesion to class 1 when

τ^1(y)1−τ^1(y)>c.\frac{\hat{\tau}_1(y)}{1-\hat{\tau}_1(y)} > c.

We hold the fitted posterior predictions fixed and vary only cc. At equal costs,

R^CC(1)=1476=0.1842,R^FULL(1)=1176=0.1447.\hat{R}_{\mathrm{CC}}(1)=\frac{14}{76}=0.1842,\qquad\hat{R}_{\mathrm{FULL}}(1)=\frac{11}{76}=0.1447.

Thus FULL makes three fewer observed classification errors. Panel (c) displays

Δ^(c)=R^FULL(c)−R^CC(c)\hat{\Delta}(c)=\hat{R}_{\mathrm{FULL}}(c)-\hat{R}_{\mathrm{CC}}(c)

over log⁡c∈[−3,3]\log c \in[-3,3]. The risk difference takes both signs: it is positive at c=0.1c=0.1, negative at c=1c=1, and positive at c=5c=5. FULL has lower empirical risk throughout the interval 0.283236<c<2.4628880.283236 < c < 2.462888, while additional narrow reversals and a tie interval occur at lower cost ratios. Supplementary Section ?? reports the complete ordering.

The application illustrates the cost sensitivity of the fitted decision rules. It does not establish a population predictive advantage or identify the covariance mechanism derived for the restricted Gaussian model. The cost ratios are sensitivity parameters, rather than recommended clinical costs.

Discussion

The paper gives explicit first-order deployment-cost crossings for the one-dimensional Gaussian discrimination problem and proves that finite classifier-linked missingness mechanisms can generate the covariance geometry required for reversal at fixed marginal missingness. The existence result concerns a likelihood in which the class-probability logit and separation are estimated, while the class-mean midpoint and within-class variance are known. Estimating additional generative parameters requires their information and nuisance adjustment; canonical standardization alone does not remove them.

For general finite-action losses, the leading comparison is tr⁡(HCD)\operatorname{tr}(H_C D), where D=VPC−VCCD=V_{\mathrm{PC}}-V_{\mathrm{CC}} describes estimation uncertainty and HCH_C describes the active decision geometry. Indefiniteness is sufficient for reversal in the one-dimensional binary Gaussian case, but need not suffice in higher dimensions or multiclass problems. The attainable loss-specific curvature matrices must expose both signs of the covariance difference.

The reported simulation curves display changes in estimated risk ordering as the deployment loss varies. Their close agreement with an empirical quadratic comparison is consistent with the local risk mechanism, including under unequal priors. Differences between empirical and population crossings can reflect finite-sample effects and Monte Carlo variability; agreement between two summaries of the same replications does not separate these contributions. The gastrointestinal application illustrates cost sensitivity using agreement-defined availability of histological labels. The shared-covariance analysis uses training-only preprocessing and initialization, and all 76 paired fits pass the numerical checks. FULL has lower observed risk at equal costs, but the empirical ordering reverses as the deployment cost ratio varies. This exploratory comparison is conditional on the historical feature representation; it neither establishes a population predictive advantage nor identifies the covariance mechanism derived for the restricted Gaussian model. The relative costs remain sensitivity parameters rather than clinical utility estimates.

The theoretical comparison is local and asymptotic, and concerns the leading risk of regular estimators. It does not establish finite-sample dominance. Correct specification of the generative and classifier-linked missingness models is essential to the information calculation. The multiclass expansion assumes regular active faces, transverse higher-order ties, integrable boundary curvature, and uniform quadratic control of regret in the tails. Positive-measure ties, nontransverse intersections, or uncontrolled tail decision changes require a different analysis.

Extensions include comparison over a class of uncertain deployment losses and studying the frontier under classifier or mechanism misspecification. Designing label acquisition for a specified deployment loss is a related question. Work on classification-risk-optimal label acquisition [19] concerns changing the training experiment; the present comparison instead holds that experiment fixed while varying the deployment loss.

Statements and declarations

Data and code availability

The gastrointestinal-lesion dataset is publicly available from the UCI Machine Learning Repository at https://doi.org/10.24432/C5V02D. The analysis inputs, comprising the four previously selected features, histological reference classes and agreement-defined label mask, together with the code for the simulations, real-data analysis and manuscript figures, are available at https://github.com/fariborz-setoudeh/decision-target-reversal.

Declaration of competing interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

References

  1. [1]D. B. Rubin, “Inference and missing data,” Biometrika, vol. 63, no. 3, pp. 581–592, 1976, doi: 10.1093/biomet/63.3.581.DOI
  2. [2]D. Ahfock and G. J. McLachlan, “An apparent paradox: A classifier based on a partially classified sample may have smaller expected error rate than that if the sample were completely classified,” Statistics and Computing, vol. 30, pp. 1779–1790, 2020, doi: 10.1007/s11222-020-09971-5.DOI
  3. [3]Y.-G. Wang, J. Wu, and G. J. McLachlan, “Learning from uncertainty-dependent missing labels for semi-supervised classification,” arXiv:2608.23960, 2026, doi: 10.48550/arXiv.2608.23960.DOI
  4. [4]H. Zhou, J. Wu, F. Setoudehtazangi, and G. J. McLachlan, “Favourable missingness in semi-supervised classification for exponential mixture models,” arXiv:2608.22843, 2026, doi: 10.48550/arXiv.2608.22843.DOI
  5. [5]J. Wu, Y.-G. Wang, and G. J. McLachlan, “Semi-supervised classification with informative missing labels in Weibull mixture models,” arXiv:2609.00774, 2026, doi: 10.48550/arXiv.2609.00774.DOI
  6. [6]F. Setoudehtazangi and G. J. McLachlan, “Informative label missingness in multiclass classification: Information geometry and excess risk,” arXiv:2608.30561, 2026, doi: 10.48550/arXiv.2608.30561.
  7. [7]B. Efron, “The efficiency of logistic regression compared to normal discriminant analysis,” Journal of the American Statistical Association, vol. 70, no. 352, pp. 892–898, 1975, doi: 10.1080/01621459.1975.10480319.DOI
  8. [8]C. Elkan, “The foundations of cost-sensitive learning,” in Proc. 17th Int. Joint Conf. Artificial Intelligence, vol. 2. Morgan Kaufmann, 2001, pp. 973–978.
  9. [9]N. M. Adams and D. J. Hand, “Comparing classifiers when the misallocation costs are uncertain,” Pattern Recognition, vol. 32, no. 7, pp. 1139–1147, 1999, doi: 10.1016/S0031-3203(98)00154-X.DOI
  10. [10]C. Drummond and R. C. Holte, “Cost curves: An improved method for visualizing classifier performance,” Machine Learning, vol. 65, pp. 95–130, 2006, doi: 10.1007/s10994-006-8199-5.DOI
  11. [11]J. P. Dmochowski, P. Sajda, and L. C. Parra, “Maximum likelihood in cost-sensitive learning: Model specification, approximations, and upper bounds,” Journal of Machine Learning Research, vol. 11, pp. 3313–3332, 2012.
  12. [12]Y.-F. Li, J. T. Kwok, and Z.-H. Zhou, “Cost-sensitive semi-supervised support vector machine,” Proc. AAAI Conf. Artificial Intelligence, vol. 24, no. 1, pp. 500–505, 2010, doi: 10.1609/aaai.v24i1.7661.DOI
  13. [13]T. Wang, Z. Qin, S. Zhang, and C. Zhang, “Cost-sensitive classification with inadequate labeled data,” Information Systems, vol. 37, no. 5, pp. 508–516, 2012, doi: 10.1016/j.is.2011.10.009.DOI
  14. [14]D. Blackwell, “Comparison of experiments,” in Proc. 2nd Berkeley Symp. Mathematical Statistics and Probability, J. Neyman, Ed. Berkeley: University of California Press, 1951, pp. 93–102.DOI
  15. [15]D. Blackwell, “Equivalent comparisons of experiments,” Annals of Mathematical Statistics, vol. 24, no. 2, pp. 265–272, 1953, doi: 10.1214/aoms/1177729032.DOI
  16. [16]E. Torgersen, Comparison of Statistical Experiments. Cambridge: Cambridge University Press, 1991.DOI
  17. [17]P. Mesejo and D. Pizarro, “Gastrointestinal lesions in regular colonoscopy,” UCI Machine Learning Repository, 2016, doi: 10.24432/C5V02D.DOI
  18. [18]Z. Lyu, D. A. Ahfock, R. Thompson, and G. J. McLachlan, “Semi-supervised Gaussian mixture modelling with a missing-data mechanism in R,” Australian & New Zealand Journal of Statistics, vol. 66, no. 2, pp. 146–162, 2024, doi: 10.1111/anzs.12413.DOI
  19. [19]F. Setoudehtazangi and G. J. McLachlan, “Classification-risk-optimal label acquisition,” arXiv:2609.06873, 2026, doi: 10.48550/arXiv.2609.06873.

Paper details

vlnc:W_4jmf5n4v
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents