Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

Inverse reconstruction risk under train and test laws

Definition

Let (Y,Y) and (Q,Q) be measurable data and target spaces, with Q the Borel sigma-algebra of the target metric space. Let P be a probability measure on the product space (Y×Q,Y⊗Q), and let ℓ:Q×Q→[0,+∞] be product-measurable, where ℓ(t,a) is the loss for target t and action a. For a point reconstruction rule g:(Y,Y)→(Q,Q) measurable with respect to the stated sigma-algebras, its risk under P is the extended nonnegative integral RP(g):=∫Y×Qℓ(t,g(y)) P(dy,dt). For a randomized reconstruction rule given by a probability kernel K from Y to Q, define RP(K):=∫Y×Q ⁣(∫Qℓ(t,a) K(y,da))P(dy,dt). The inner integral is measurable in (y,t) by kernel integration; a deterministic rule is the special case Ky=δg(y). When Ptrain and Ptest are specified joint laws on the same input-target space, the corresponding training-law risk and test-law risk are RPtrain(K) and RPtest(K). Either value may be +∞. This definition imposes no inequality between the two risks: any such comparison requires an additional assumption relating the joint laws or the rule's behavior under them.

Depends on

Used by

Dependency tree · two levels

29 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