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.
Asymmetric loss can change the posterior-optimal action
Example
Let and let . Under zero–one loss the maximal-mass action is . Under the asymmetric loss with false-positive cost and false-negative cost , the unique Bayes action is instead .
Facts & Assumptions
Given: The posterior masses are and ; the actions are ; false-positive loss is , false-negative loss is , and correct classifications have loss zero.
Posterior risk is the posterior integral of the loss when finite. Finite posterior risk and Bayes action rule
Under finite-class zero–one loss, a maximal-posterior-mass class minimizes posterior risk. A maximal-mass action is Bayes under finite-class zero–one loss
Verification
Given: The hypotheses in the Example and Facts & Assumptions.
Under zero–one loss, the risks are for action and for action . Thus action is the unique zero–one Bayes action, in agreement with [F2].
Under the asymmetric loss, the risk of action is , while the risk of action is . Both risks are finite and the lower one is attained uniquely by action .
The two loss functions therefore select different actions under the same posterior: zero–one loss selects , while the stated asymmetric loss selects . This demonstrates that posterior modes alone do not determine a Bayes action without a specified loss.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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
- Andrew Gelman et al., Bayesian Data Analysis, 3rd ed., §9.1 (standard reference, not scraped)
- Ryan Martin, Lecture Notes on Advanced Statistical Theory, §5.3.1, PDF pp. 104–105 (standard reference, not scraped)