Manuscript Psy03-D@1 · Psy03-D-v1.tex · theorem · 3e18951d
Theorem: Cue-conditioned classification reference
Observable task designs are new protocols › Partially informative cues · lines 681–717 · proof included or linked
Psy03-D@1#thm:noisycues, Psy03-D@1#eq:cuebayes
For a uniform rule prior, the Bayes accuracy with the current cue is
If the cue reveals the rule with probability and otherwise reports a recognizable erasure,
Further rule-independent processing of a cue cannot improve its Bayes accuracy.
Proof. The inner sum is the joint conditional probability of cue and label at a fixed point. Optimize the prediction separately for every cue.
A nonerased cue gives accuracy one. An erased cue leaves the uncued reference . Average these two cases.
A predictor receiving a degraded cue can be simulated by a predictor receiving the original cue and applying the degrading channel before its decision.
Displayed formulas in this passage
Psy03-D@1#eq:cuebayes · line 685
unlabeled · line 698