Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generated
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.

Contamination-robust expected risk and tail risk

Definition

Let the experiment in Statistical experiments have nonempty parameter set Θ. Choose a sigma-algebra T on Θ and take (Θ,T) as its measurable action space (Measurable spaces and measurable sets). Specialize the target-first loss of Loss functions and risk to L:Θ×Θ→[0,+∞] by taking its action space to be (Θ,T). Fix an integer sample size N≥1 and a measurable rule θ^:XN→Θ. Equip XN with the finite product sigma-algebra (The product sigma-algebra and its finite iterates); the iid sample law is the finite product measure supplied by The product measure of two sigma-finite measure spaces and For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique. Write X(x)=x for the canonical sample vector on this product space. The Huber sampling law is from Huber contamination model, and nonnegative expectations use Expectation of a nonnegative or integrable random variable. For 0≤ϵ≤1 and 0≤η≤1, its Huber robust expected risk at fraction ϵ is

sup⁡θ∈Θsup⁡QEPϵ,θ,Q⊗NL(θ,θ^(X)).

For the replacement risks, additionally assume ΔX={(x,x):x∈X}∈A⊗A, as required by Adversarial sample replacement. Its replacement robust expected risk at fraction η is the supremum of EL(θ,θ^(Y)) over θ and all couplings in Adversarial sample replacement. For t∈[0,+∞], the Huber tail risk at threshold t is sup⁡θ,QPϵ,θ,Q⊗N{x:L(θ,θ^(x))≥t}; the replacement tail risk is the supremum of Pr⁡{L(θ,θ^(Y))≥t} over θ and the same replacement couplings. Expected risk and tail risk are different criteria. The gross-error path in Gross-error contamination path is a path of laws; it is not a sample-replacement mechanism.

Depends on

Used by

Dependency tree · two levels

36 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