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.
Conflicting labels, a soft-margin optimum, and the meaning of its score
Example
Take , , , and . For and the ordered sample , the soft-margin SVM has the optimum , , with objective ; dual multipliers are and . Its score is at , where the sample has one positive and one negative label. Applying the separately specified logistic map to that score gives , not the empirical positive-label frequency . These are finite-sample quantities; the SVM score is not a probability supplied by the SVM optimization.
Example references
Facts & Assumptions
Given: The feature map, the ordered sample, , and the soft-margin definition.
The soft-margin constraints and objective are those in the hard- and soft-margin SVM definition (Hard- and soft-margin support-vector machines with an unpenalized bias).
The SVM KKT equations include , , , and complementarity for both inequality families (Soft-margin SVM duality and KKT conditions).
The feature map realizes the positive semidefinite linear kernel (Linear and polynomial kernels as finite feature inner products).
Verification
The feature map in [F3] realizes the stated linear kernel. At , , the scores at all three observations equal . Their signed margins are respectively , so satisfies every soft-margin constraint, with objective .
For any feasible tuple, let , the score at . The two observations at require and . If these lower bounds sum to ; if , the second is ; and if , the first is . Thus for every feasible tuple, and its objective is at least .
The candidate in [step 1.1] is therefore globally optimal. For and , , , and for all three indices. Each margin constraint is active, so ; also for each . These are the KKT conditions in [F2].
The dual objective is , equal to the primal value. The score at is , while the empirical positive-label frequency among the two observations at is . The logistic transform of the score is ; the SVM optimization does not assert that this transformed value is a probability.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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
- Hastie, Tibshirani, and Friedman, The Elements of Statistical Learning, 2nd ed., corrected 12th printing (standard reference, not scraped)
- Rasmussen and Williams, Gaussian Processes for Machine Learning (standard reference, not scraped)