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.
Finite Gaussian-process regression observation model
Definition
Let be a set, let , and let be symmetric and positive semidefinite, meaning that for every finite ordered list in and every , For finite ordered lists and in , define repeated indices are allowed.
Given a real Gaussian process with mean and covariance , and a nonempty finite training list in , define and . For a centered Gaussian noise vector with symmetric positive-semidefinite covariance that is independent of , define the observation vector and the matrix .
For a nonempty finite test list in , define the latent test vector . If a centered Gaussian vector with symmetric positive-semidefinite covariance is independent of the pair , define the noisy test vector .
Definition references
Model diagram
The single prior node represents one process, so and may be correlated. Arrows into and denote vector addition. The training noise is independent of , and the test noise is independent of the pair ; the diagram records no posterior independence claim.
Depends on
Used by
- Finite Gaussian-process regression posterior and predictive law Corollary
- Noisy interpolation on two independent coordinates Example
- Positive observation noise with a singular rank-one prediction Example
- Positive definiteness is exactly the inverse condition for the observed GP covariance Lemma
- Computational costs and limits of finite Gaussian-process regression Remark
- Statistical and numerical limits of finite kernel solve guarantees Remark
- Kernel ridge regression equals the Gaussian-process posterior mean Theorem
- Log marginal likelihood for a finite Gaussian-process regression model Theorem
Dependency tree · two levels
19 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
- Carl Edward Rasmussen and Christopher K. I. Williams, Gaussian Processes for Machine Learning, Chapter 2 §2.2 (standard reference, not scraped)
- Christopher M. Bishop, Pattern Recognition and Machine Learning, §6.4.2 (standard reference, not scraped)