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.
Finite nested decision families and bounded risk
Definition
Let , , and . Fix a deterministic strictly ordered grid and a probability space . For , let be a random element of with its Borel sigma-algebra, and write . The rows are exchangeable when their joint law is invariant under every permutation of the row indices. The coordinates are the losses of the finite decision family at observation ; in a prediction problem they may be obtained by applying each fixed prediction rule to that observation and evaluating a specified loss.
The family is loss-nested when, with probability one, for every . It is endpoint-safe at level when, with probability one, for every . For any measurable selector taking values in and determined by the calibration rows , its marginal expected test risk is , with expectation over all rows. This expectation is finite because every loss lies in . Here “nested” means nonincreasing loss on the specified grid; literal inclusion of prediction sets is not required.
Definition references
Exchangeable random elements: exchangeability means invariance of the joint law under every coordinate permutation.
Random elements and real random variables: a random element is a measurable map from a probability space into a measurable space.
Expectation of a nonnegative or integrable random variable: the expectation of a bounded nonnegative loss is its Lebesgue integral against the probability measure.
Depends on
Used by
- Finite-grid conformal risk control Algorithm
- Fallback when the calibration correction exceeds the target Example
- Multilabel false-negative risk control Example
- The all-zero loss boundary Example
- Finite-grid risk control by monotone envelopes Theorem
- Finite-sample expected-risk control on a finite grid Theorem
Dependency tree · two levels
11 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
- Anastasios N. Angelopoulos, Stephen Bates, Adam Fisch, Lihua Lei, and Tal Schuster, Conformal Risk Control, arXiv:2208.02814v4 (standard reference, not scraped)
- Anastasios N. Angelopoulos, Rina Foygel Barber, and Stephen Bates, Theoretical Foundations of Conformal Prediction, prepublication book manuscript (standard reference, not scraped)