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.
Measurable threat correspondences and robust risk
Definition
Let and be measurable spaces, let be a measurable action space, and let be a probability measure on . A threat correspondence is a map with for every . It is measurable when its graph belongs to . For a measurable predictor and a nonnegative measurable loss , the pointwise robust loss is Its robust risk is the outer expectation If is measurable, this is its ordinary expectation. The supremum need not be attained. For a metric on and a radius , the closed-ball threat is . On , and the threat is . When with their discrete sigma-algebras and , the robust zero-one loss of a measurable classifier is .
Definition references
Measurable spaces and measurable sets: a measurable space is a set equipped with a sigma-algebra.
A measurable function between measurable spaces: measurability means every measurable target set has measurable preimage.
A function is a relation with and implying ; , the value , domain and codomain: a function is single-valued on its domain.
The product sigma-algebra and its finite iterates: is generated by measurable rectangles.
Probability measures and probability spaces: a probability measure has total mass one.
Expectation of a nonnegative or integrable random variable: expectation is the corresponding extended or finite Lebesgue integral.
Pydi, Chapter 2 §§2.2–2.3: expected-supremum risk and the measurability caveat.
Kolter–Madry, Chapter 1: input-dependent perturbation sets and expected worst-case loss.
Depends on
- Expectation of a nonnegative or integrable random variable
- Probability measures and probability spaces
- A function is a relation $f$ with $(a,b) \in f$ and $(a,c) \in f$ implying $b = c$; $f : A \to B$, the value $f(a)$, domain and codomain
- Measurable spaces and measurable sets
- A measurable function between measurable spaces
- The product sigma-algebra and its finite iterates
Used by
- Gaussian robust risk across dimensions and radii Example
- Natural and robust risk in the Gaussian model Example
- Thresholding removes Bernoulli sign perturbations Example
- Common shifts force binary robust risk at least one half Lemma
- Architecture-dependent robustness in the Bernoulli model Theorem
- Robust sample lower bound in the Gaussian model Theorem
- Robust sample upper bound in the Gaussian model Theorem
Dependency tree · two levels
20 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
- Muni Sreenivas Pydi, Adversarial Robustness in Machine Learning: An Optimal Transport Perspective, Chapter 2 §§2.2–2.3 (standard reference, not scraped)
- Zico Kolter and Aleksander Madry, Adversarial Robustness: Theory and Practice, NeurIPS 2018 tutorial notes, Chapter 1 (standard reference, not scraped)