Because white-noise observations are not themselves in , define the least-squares estimator as a minimizer of the Gaussian least-squares contrast, equivalently a maximizer over of
where is the isonormal Gaussian process on . The entropy assumption makes sample-continuous on compact , so a maximizer exists.
Put . Comparison with gives the basic inequality
For
the entropy assumption and the Dudley entropy integral give
The Borell-TIS inequality further gives
Set . This is the balance
On the shell , the basic inequality would require
For sufficiently large, the expectation bound is at most half this threshold for every . Borell concentration then bounds the shell probability by
Summing the geometric sequence of shell bounds gives a quantity tending to zero, uniformly in . Therefore
Write , , and choose
Take a -net of in , with centers in . Since every alternative lies in the -dimensional Euclidean ball of radius , the volumetric covering bound gives
for all large . Put and define the Gaussian net test
The inner products are well-defined Gaussian linear functionals because . Under ,
and . A Gaussian tail bound and a union bound give
For any , choose with . Then
Another Gaussian tail bound gives
Because , the entropy term in the type-I bound is dominated by the signal exponent when is sufficiently large. Also implies eventually, so . Given , choose large enough to obtain
Enlarging if necessary handles the finitely many initial .
Let
so . In the Gaussian sequence model, put . For each relevant coordinate, the posterior density of relative to the standard-normal density is
The log-Lipschitz assumption implies
These bounds provide Gaussian-integrable domination, while the ratio converges pointwise to one. Dominated convergence, coordinate independence, and the same argument after multiplying by show that, under the posterior,
almost surely. The supplied moment-generating-function criterion therefore gives the finite-functional Bernstein-von Mises theorem
with uniform convergence of distribution functions.
If , the posterior quantile defining consequently satisfies
in probability. Under ,
for every . Quantile convergence and the Slutsky theorem now yield
Let . Away from ties and zero coordinates, its gradient is for a maximizing coordinate . Conditional on , the random variable is centered Gaussian with variance at most one. The supplied Gaussian concentration inequality therefore gives
A Chernoff bound, optimized at , yields
It remains to bound the mean. For , Jensen's inequality and the Gaussian moment-generating function give
Taking gives . Consequently

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact