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.
Gaussian-process posterior contraction in density and regression models
Statement
Let satisfy and . For the centered tight Gaussian prior in each branch, let be its law and let be a separable closed Banach carrier with the norm inherited from that branch's stated function space, as supplied by A tight Gaussian law is carried by a separable closed subspace. Write for the covariance RKHS of on , and define Suppose .
In each branch, parameter-to-data densities are jointly measurable and the posterior is the data-indexed normalization of the prior times the likelihood on fibers with finite positive evidence.
-
Log-Gaussian density estimation. On a measurable space with sigma-finite measure , let be a tight centered Borel Gaussian random element in , and let belong to its support. Assume path evaluation is jointly measurable, for prior-almost every and for , and set , . For IID data , sufficiently large fixed gives When , bounded paths imply the required normalizers are finite and positive.
-
Binary regression. Let be IID, with , and . Assume is differentiable, , and . Suppose the prior is either a tight centered Gaussian law in with a jointly measurable evaluation version representing its element almost everywhere, or a tight centered Gaussian law in with jointly measurable evaluation and bounded ; in either case belongs to the prior support. Then for sufficiently large fixed ,
-
Fixed-design Gaussian regression. For deterministic , assume independent , a centered tight Borel Gaussian prior in with in support, and an independent prior on the standard deviation supported on a fixed containing , with Lebesgue density bounded below by a positive constant. Put for . Then for sufficiently large fixed , The sharper conclusion with in place of holds if the Gaussian law is not the point mass at zero. It also holds when almost surely and the scale-prior density is bounded above on a neighborhood of ; this extra upper bound is needed only for that sharper degenerate-prior alternative, not for the universal conclusion. In the nondegenerate case , so the two formulations differ only by the fixed constant . Here .
The concentration-function hypothesis is interpreted on a separable Banach space carrying the prior. For a tight Gaussian law initially given in nonseparable , the separable-support reduction is A tight Gaussian law is carried by a separable closed subspace; the norm and prior law are restricted to that support space.
Facts & Assumptions
Given: The three model contracts above, a common rate sequence satisfying and , and the displayed Gaussian concentration-function inequality.
The support of a Banach Gaussian is the closure of its RKHS: under AC and countable choice, a centered tight Borel Gaussian law on a real separable Banach space has support equal to the Banach-norm closure of its covariance RKHS.
Concentration function of a Banach Gaussian prior: the current definition uses for .
Gaussian concentration-function sieve bounds: under AC and countable choice, the full-squared concentration hypothesis supplies measurable sieves with , prior tail at most , and mass at least in the -ball about the truth. Its sharp finite-dimensional expansion and Banach expansion suppliers have local proofs.
Centered Borel Gaussian random element on a separable Banach space: a centered Borel Gaussian random element is a Borel-measurable map into a real separable Banach space whose continuous linear images are centered normal.
Covariance operator and reproducing-kernel Hilbert space of a Banach Gaussian: under AC, the covariance RKHS is the completed covariance-form quotient embedded as a Hilbert space of shifts in the Banach space.
In the fixed-design branch the scale prior has density at least on . For , including when is an endpoint, its -neighborhood therefore has prior mass at least once . An upper density bound is assumed only in the sharper degenerate-prior alternative stated above.
Assume AC and countable choice for the Gaussian concentration-sieve interface The Axiom of Choice, The Axiom of Countable Choice (). The separate Hahn–Banach extension principle used in [F5] is not inferred from these assumptions.
Assume the separate relative Hahn–Banach extension principle The real dominated-extension principle as an additional hypothesis over ZF for the separable-support reduction [F5]; it is not silently deduced from AC.
KL prior mass gives a posterior denominator lower bound in probability: for a jointly measurable dominated IID model, local prior mass at least on a set with directional KL and log-square at most gives a denominator lower bound except with probability at most .
Sieve metric entropy produces uniform exponential tests: same-metric packing entropy at radius bounded by gives tests with exponentially small null and uniform alternative errors outside a sufficiently large multiple of ; for density the densities must be uniformly bounded.
Supremum distance controls local log-Gaussian density distances, The L² link norm controls binary-regression likelihood distances, and Empirical mean and scale distance control Gaussian-regression likelihoods give the local Hellinger, density-, directional KL and log-square comparisons used on this page.
Local KL and log-square mass bounds a non-IID posterior denominator and Tests and a sieve tail imply posterior contraction from a denominator bound give the non-IID denominator bound and the tested-numerator/sieve-tail split used in the IID and fixed-design arguments.
A tight Gaussian law is carried by a separable closed subspace: a tight Borel Gaussian law in a Banach space is carried by a separable closed subspace without changing its support or inherited norm.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: joint measurability and Tonelli make the log-Gaussian normalizer a measurable function of the path.
A nonzero Gaussian direction forces logarithmic small-ball cost: if the prior has a nonzero Gaussian direction, implies for a fixed constant.
A separable Banach space has a countable norming family under the declared Hahn–Banach and countable-choice assumptions. Thus a centered Gaussian law different from has a continuous linear functional with positive variance. A separable Banach space has a countable norming family.
A supremum-norm sieve with covering entropy at radius bounded by supplies fixed-design Gaussian tests outside a sufficiently large empirical-mean-plus-scale ball, with arbitrarily prescribed fixed exponential error exponent. Supremum sieves admit tests in fixed-design Gaussian regression.
The centered Gaussian residual-energy statistic has an exponential tail at deviations of order for fixed . Linear and quadratic Gaussian statistics have exponential tails.
Proof
Given: The hypotheses of the Statement and its three distinct model branches.
The separable-support reduction [F5] leaves the inherited norm, law and support point unchanged. For the first two branches use the rate ; for the universal fixed-design branch use . The concentration function is nonincreasing in its radius, because its feasible RKHS approximation set grows and centered small-ball probabilities increase. Thus . Both choices satisfy and . By [F8], the support point lies in the RKHS closure.
Now suppose almost surely and its scale density is bounded above by on within . The support assumption forces . Put , , and . On , write . Compactness of the positive scale interval and Taylor's formula give constants independent of with For verification, its deterministic part is , negative away from zero, with second derivative at zero; the remaining term is , bounded by . The residual-energy tail in [F15] with zero mean shift gives for fixed .
In log-Gaussian density estimation, evaluation measurability and Tonelli [F6] make measurable. On its full-prior positive-finite set, is a jointly measurable density family. The supremum ball has directional KL at most and log-square at most by [F3]. Choose a fixed sufficiently large . Its prior mass is at least by [F10], so [F1] at radius gives a denominator at least for fixed except with probability tending to zero.
In binary regression, [F3] places the prior ball in a directional KL/log-square set of radius for a fixed sufficiently large . Its mass is at least by [F10], so [F1] gives the same type of denominator bound. The joint Bernoulli densities relative to are bounded by one, as required for the density- tests in [F2].
For the universal fixed-design branch take . On and , [F3] bounds average directional KL and log-square by for fixed . Independence and [A2], together with [F10], give joint local prior mass at least . Since , eventually ; hence this mass is at least for fixed . The independent-observation denominator lemma in [F4] applies.
For each branch choose larger than its denominator exponent; eventually . Apply the prior sieve theorem [F10] using step 1.1 to get measurable with entropy at radius at most and tail at most . The same theorem supplies the local prior mass used in steps 2.1, 2.2, 2.3.
On integrate the likelihood over within . This interval has length at least for large , even at an endpoint; [A2] and step 1.2 bound its integral below by for some . On the local neighborhood where , substitute in the numerator outside . Dividing by that lower bound gives at most , since . Outside the local neighborhood, step 1.2 bounds by for large , whose integral against the entire probability prior is at most ; after dividing by the denominator this also tends to zero. First let and then . This proves the sharper degenerate-prior contraction in probability for every fixed .
In the density branch intersect with the measurable positive-finite-normalizer set, changing its prior tail by zero. From a radius- cover, select a valid center for every cover ball meeting that intersection; finite selection doubles the radius to without increasing the number. The pairwise norm comparison [F3] sends this to a Hellinger cover of radius at most for large . Thus any -separated set has size at most . Taking packing radius at least , [F2] gives tests with null and uniform sieve alternative errors at most for any fixed desired , by increasing the alternative multiple. The denominator and sieve tail now satisfy the posterior split in [F4], proving contraction in probability.
In binary regression the norm-ball and sieve cover map by [F3] to density- balls and covers of constant times . Taking packing radius at least twice the cover radius and at least gives packing entropy at most its squared radius times . By [F2] and [F4], the tests, denominator and sieve tail prove contraction in probability. Since the joint Bernoulli densities satisfy , this is the stated binary distance.
In fixed-design regression take the product sieve . Its prior tail is at most , and its function component has the radius- cover from step 2.4. The local fixed-design testing lemma [F14] gives tests outside with errors at most for any fixed by choosing fixed large. Choose and above the denominator exponent in step 2.3. The posterior split [F4] proves the universal contraction in probability.
If the Gaussian law is not , [F13] supplies a continuous linear functional with nonzero Gaussian variance. Indeed, otherwise every member of a countable norming family would vanish almost surely, forcing almost surely. By [F7] there is a fixed constant such that . Put ; then eventually, since . Consequently for fixed . The universal conclusion in step 3.3 therefore proves the sharper conclusion after enlarging by .
In each proved branch the posterior tail is a random variable converging to zero in probability. For , ; first take the limit superior and then . Thus all asserted expectation limits follow. The universal fixed-design rate requires no upper bound on the scale density; the sharper degenerate alternative uses only the explicitly local upper bound.
Remarks
A scale density bounded below supplies interval mass of order its radius, but the Gaussian concentration condition does not bound the logarithm of that radius when . An unrestricted scale density can have spikes that make the originally proposed arbitrary rate false; A spiky scale prior defeats an arbitrary degenerate-Gaussian concentration rate ↗ gives an explicit counterexample. The universal rate retains every allowed prior. A nonzero Gaussian direction or a local upper scale-density bound in the degenerate case supplies the sharper alternative by separate proved arguments.
Depends on
- A tight Gaussian law is carried by a separable closed subspace
- Supremum distance controls local log-Gaussian density distances
- The L² link norm controls binary-regression likelihood distances
- Empirical mean and scale distance control Gaussian-regression likelihoods
- Linear and quadratic Gaussian statistics have exponential tails
- Local KL and log-square mass bounds a non-IID posterior denominator
- Tests and a sieve tail imply posterior contraction from a denominator bound
- Supremum sieves admit tests in fixed-design Gaussian regression
- A nonzero Gaussian direction forces logarithmic small-ball cost
- KL prior mass gives a posterior denominator lower bound in probability
- Sieve metric entropy produces uniform exponential tests
- Parameter-measurable statistical models as kernels
- Dominated statistical experiments
- Likelihood densities
- The measure with density $f$ relative to $\mu$
- Probability measures and probability spaces
- Independent random elements
- Standard normal and normal laws
- Kullback–Leibler divergence
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The real dominated-extension principle as an additional hypothesis over ZF
- Centered Borel Gaussian random element on a separable Banach space
- Covariance operator and reproducing-kernel Hilbert space of a Banach Gaussian
- Concentration function of a Banach Gaussian prior
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- The support of a Banach Gaussian is the closure of its RKHS
- Gaussian concentration-function sieve bounds
- Borell–Sudakov–Tsirelson expansion for a Banach Gaussian law
- Finite-dimensional Gaussian isoperimetric expansion
- A separable Banach space has a countable norming family
Used by
Dependency tree · two levels
154 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
- A. W. van der Vaart and J. H. van Zanten, Rates of contraction of posterior distributions based on Gaussian process priors, §§2–3 (standard reference, not scraped)
- Bas J. K. Kleijn, Aad W. van der Vaart and Harry van Zanten, Lectures on Nonparametric Bayesian Statistics, Chapters 9 and 12 (standard reference, not scraped)
- Subhashis Ghosal and Aad W. van der Vaart, Convergence rates of posterior distributions for noniid observations, §§2–3 (standard reference, not scraped)