Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Split conformal prediction set for classification

Definition

Let K≥2, let the feature space be a measurable space X, and let the label set be Y={1,…,K} with all subsets measurable. Let H be a training statistic valued in a measurable rule space H, and let s:H×X×Y→R be a jointly measurable score rule. The rule is fixed after training and is used unchanged on calibration and test examples. Given m≥0 calibration examples (Xi,Yi) and 0<α<1, compute Ri=s(H,Xi,Yi),k=⌈(m+1)(1−α)⌉. If k≤m, sort the calibration scores by the ordered keys (Ri,i) and let q be the score value at position k. If k=m+1, set q=+∞. For a feature value x, return the prediction set

C(x)={y∈Y:s(H,x,y)≤q}.

For the optional tie-randomized version, use one random variable U that is uniform on [0,1] and independent of the training information and all calibration and test examples, shared across the candidate-label scan. For ry=s(H,x,y), define pU(y)=#{i≤m:Ri>ry}+U(1+#{i≤m:Ri=ry})m+1,CU(x)={y∈Y:pU(y)>α}. The candidate is included in its own tie group. The algorithm defines these sets; any coverage claim requires separate distributional hypotheses.

Definition references

Statistics and estimators: a training statistic is a measurable map into its stated measurable rule space.

Conformal scores and rank p-values: fixes the split-score convention, upper-rank formula, tie randomization, and independent uniform input.

Split conformal prediction set: supplies the general split-conformal quantile construction, including the +∞ sentinel.

Finite order statistics and rank maps are measurable: gives measurability of the finite score order statistic and rank maps.

Independent sigma-algebras and independent events: defines independence of the optional uniform variable from the data.

Lei et al., full paper, Section 2.2 and Appendix A.1: gives the split-conformal order-statistic construction and its finite-sample exchangeable-rank argument for regression.

Tibshirani, full lecture notes, Sections 1.2–2: derives the adjusted rank, split calibration score, sentinel convention, and optional exact tie randomization.

Depends on

Used by

Dependency tree · two levels

15 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources