Gaussian Sieve Priors

• Gaussian sieve priors are hierarchical Bayesian priors that express infinite-dimensional functions using truncated orthonormal basis expansions.
• They enable adaptive nonparametric inference by selecting a variable truncation level, achieving near-minimax global L2 contraction rates.
• However, they exhibit suboptimal performance for pointwise and semi-parametric loss functions due to insufficient regularization of intermediate-frequency components.

Gaussian sieve priors are hierarchical Bayesian priors designed for adaptive nonparametric inference, especially in settings where the underlying signal or function admits a sparse or truncated orthonormal expansion. In such models, the key feature is to express the infinite-dimensional parameter (such as a function or spectral density) in a suitable basis, and then encode prior information via a variable truncation level and, conditionally, independent Gaussian priors on the expansion coefficients. The formulation enables dimension adaptation and allows contraction rates that (up to logarithmic factors) closely track minimax optimality for certain global loss functions. Gaussian sieve priors have been rigorously analyzed for models including the Gaussian white noise model and semi-parametric Gaussian time series, revealing both their strengths in global $L_2$ adaptation and their limitations under pointwise or semi-parametric loss functions (Arbel et al., 2012, Kruijer et al., 2012).

1. Construction of Gaussian Sieve Priors

In the Gaussian white noise model

$dX^n(t)=f_0(t)dt+n^{-1/2}dW(t), \quad t\in[0,1],$

where $f_0$ is the unknown function and $W$ is standard Brownian motion, the function is expressed in an orthonormal basis $\{\varphi_j\}_{j\geq 1}$ as $f_0(t)=\sum_{j=1}^\infty \theta_{0j}\varphi_j(t)$. The observations in the basis are

$$X_j^n = \int_0^1 \varphi_j(t) dX^n(t) = \theta_{0j} + n^{-1/2}\xi_j, \quad \xi_j\sim N(0,1).$$

The Gaussian sieve prior places a hierarchical structure on the coefficients $\theta=(\theta_j)_{j\geq 1}$: $$\Pi(d\theta) = \sum_{k=1}^\infty \pi(k)\Pi_k(d\theta),$$ where

• $\pi(k)$ is a prior over truncation level $dX^n(t)=f_0(t)dt+n^{-1/2}dW(t), \quad t\in[0,1],$0,
• Conditionally on $dX^n(t)=f_0(t)dt+n^{-1/2}dW(t), \quad t\in[0,1],$1, $dX^n(t)=f_0(t)dt+n^{-1/2}dW(t), \quad t\in[0,1],$2 for $dX^n(t)=f_0(t)dt+n^{-1/2}dW(t), \quad t\in[0,1],$3, and $dX^n(t)=f_0(t)dt+n^{-1/2}dW(t), \quad t\in[0,1],$4 for $dX^n(t)=f_0(t)dt+n^{-1/2}dW(t), \quad t\in[0,1],$5.

Canonical choices are $dX^n(t)=f_0(t)dt+n^{-1/2}dW(t), \quad t\in[0,1],$6 a Poisson distribution with parameter $dX^n(t)=f_0(t)dt+n^{-1/2}dW(t), \quad t\in[0,1],$7, and $dX^n(t)=f_0(t)dt+n^{-1/2}dW(t), \quad t\in[0,1],$8 for $dX^n(t)=f_0(t)dt+n^{-1/2}dW(t), \quad t\in[0,1],$9, $f_0$0 (Arbel et al., 2012). The prior is thus a random mixture over finite-dimensional Gaussians, which induces dimension reduction and penalizes complexity via the decay of $f_0$1 (typically $f_0$2 for constants $f_0$3).

In semi-parametric time series models, e.g., the FEXP model for Gaussian long-memory series,

$f_0$4

a sieve prior is formulated by independently assigning:

• $f_0$5 a (fixed) density supported in $f_0$6,
• $f_0$7 either fixed at a deterministic rate in $f_0$8 or random with a Poisson/geometric prior,
• $f_0$9 a distribution supported on a Sobolev ball of smoothness $W$0 (Kruijer et al., 2012).

2. Posterior Contraction Rates: $W$1 and Global Loss

Under mild regularity assumptions, Gaussian sieve priors yield adaptive minimax-optimal posterior contraction rates (up to log-factors) for global $W$2 (or $W$3) loss over appropriately defined Sobolev-type parameter spaces.

Specifically, for the Sobolev ball

$W$4

the minimax $W$5-estimation rate is $W$6. The Gaussian sieve prior achieves

$W$7

in the sense that, for any $W$8 and $W$9 sufficiently large,

$\{\varphi_j\}_{j\geq 1}$0

as $\{\varphi_j\}_{j\geq 1}$1 [(Arbel et al., 2012), Theorem 3.4, Proposition 4.1, Section 5.1]. The Bayes risk associated with the posterior mean also achieves $\{\varphi_j\}_{j\geq 1}$2.

The key mechanism underlying these results is a balance of approximation error (controlled by the truncation $\{\varphi_j\}_{j\geq 1}$3 and the prior scales $\{\varphi_j\}_{j\geq 1}$4) and stochastic error (arising from the noise level and the prior’s effective sample size). The proof utilizes decisive prior-mass bounds over Kullback–Leibler neighborhoods, metric entropy estimates, and non-asymptotic testing inequalities.

3. Adaptation and Suboptimality for Other Losses

While Gaussian sieve priors provide sharp global $\{\varphi_j\}_{j\geq 1}$5 adaptation, their behavior under other loss functions can be markedly different. For pointwise (local) risk

$\{\varphi_j\}_{j\geq 1}$6

where $\{\varphi_j\}_{j\geq 1}$7, the minimax rate over $\{\varphi_j\}_{j\geq 1}$8 is $\{\varphi_j\}_{j\geq 1}$9. Under the Gaussian sieve prior, the attained pointwise risk decays only as

$f_0(t)=\sum_{j=1}^\infty \theta_{0j}\varphi_j(t)$0

which is slower than the minimax rate by a polynomial factor in $f_0(t)=\sum_{j=1}^\infty \theta_{0j}\varphi_j(t)$1 [(Arbel et al., 2012), Proposition 5.3]. The dominant error arises from intermediate-frequency coefficients that are insufficiently regularized by the sieve prior, causing excess local variance.

A similar phenomenon appears in semi-parametric estimation of long-memory parameters in time series. With random truncation priors (Poisson or geometric) on the expansion length $f_0(t)=\sum_{j=1}^\infty \theta_{0j}\varphi_j(t)$2, the contraction rate of the long-memory parameter $f_0(t)=\sum_{j=1}^\infty \theta_{0j}\varphi_j(t)$3 is

$f_0(t)=\sum_{j=1}^\infty \theta_{0j}\varphi_j(t)$4

whereas the minimax rate is $f_0(t)=\sum_{j=1}^\infty \theta_{0j}\varphi_j(t)$5. Only when $f_0(t)=\sum_{j=1}^\infty \theta_{0j}\varphi_j(t)$6 is tuned deterministically to scale as $f_0(t)=\sum_{j=1}^\infty \theta_{0j}\varphi_j(t)$7 (rather than assigned a prior) does the sieve prior attain the nearly optimal rate [(Kruijer et al., 2012), Theorems 3.2–3.4].

4. Key Technical Conditions and Proof Structure

Contraction theorems for sieve priors rest on an overview of several analytic conditions:

• KL-approximation (A1): Existence of low-dimensional truncations that approximate the true model in Kullback–Leibler divergence.
• Reverse KL–$f_0(t)=\sum_{j=1}^\infty \theta_{0j}\varphi_j(t)$8 control (A2): Uniform control of KL divergence in terms of $f_0(t)=\sum_{j=1}^\infty \theta_{0j}\varphi_j(t)$9-distance around the truncation.
• Metric entropy and covering (A3): Ability to cover sieved parameter sets in $$X_j^n = \int_0^1 \varphi_j(t) dX^n(t) = \theta_{0j} + n^{-1/2}\xi_j, \quad \xi_j\sim N(0,1).$$0-distance by $$X_j^n = \int_0^1 \varphi_j(t) dX^n(t) = \theta_{0j} + n^{-1/2}\xi_j, \quad \xi_j\sim N(0,1).$$1-balls, which facilitates the construction of exponentially powerful tests.
• Testing (A4): Construction of tests with exponentially decaying type I and II errors for hypotheses separated in $$X_j^n = \int_0^1 \varphi_j(t) dX^n(t) = \theta_{0j} + n^{-1/2}\xi_j, \quad \xi_j\sim N(0,1).$$2.
• Prior tails and scales (A5): Appropriate decay of $$X_j^n = \int_0^1 \varphi_j(t) dX^n(t) = \theta_{0j} + n^{-1/2}\xi_j, \quad \xi_j\sim N(0,1).$$3, sufficient mass for scales $$X_j^n = \int_0^1 \varphi_j(t) dX^n(t) = \theta_{0j} + n^{-1/2}\xi_j, \quad \xi_j\sim N(0,1).$$4, and tail regularity for the conditional prior densities.

The proof proceeds via a testing–prior-mass approach. The numerator of the posterior probability for "bad" sets (where the contraction fails) is controlled by a union bound over tests, while the denominator is lower-bounded by the prior mass of suitable KL neighborhoods. Contributions from large and small $$X_j^n = \int_0^1 \varphi_j(t) dX^n(t) = \theta_{0j} + n^{-1/2}\xi_j, \quad \xi_j\sim N(0,1).$$5 are handled via tail bounds on $$X_j^n = \int_0^1 \varphi_j(t) dX^n(t) = \theta_{0j} + n^{-1/2}\xi_j, \quad \xi_j\sim N(0,1).$$6 (Arbel et al., 2012).

5. Implications for Adaptive Bayesian Estimation

Gaussian sieve priors illustrate both the strengths and limitations of hierarchical Bayesian adaptivity. For global loss functions such as integrated squared error, the prior achieves adaptive minimax rates over a large class of smoothness spaces (e.g., Sobolev balls). The adaptation occurs via the random selection (or deterministic choice) of the truncation level $$X_j^n = \int_0^1 \varphi_j(t) dX^n(t) = \theta_{0j} + n^{-1/2}\xi_j, \quad \xi_j\sim N(0,1).$$7, which balances bias and variance automatically.

However, for more localized or semi-parametric functionals (e.g., pointwise function estimation, long-memory parameter estimation), full Bayesian adaptation via a sieve prior leads to a trade-off in contraction rate. The failure to attain optimal local rates is due to a fundamental mismatch between the global regularization induced by the sieve structure and the localized risk structure of the problem (Arbel et al., 2012, Kruijer et al., 2012).

This behavior underscores the necessity of careful prior design or tuning for objectives that go beyond global estimation: for instance, fixing the sieve truncation to match the minimax-optimal dimension achieves nearly optimal rates for long-memory parameters in time series, whereas data-driven or fully random truncation does not.

6. Comparison with Frequentist and Other Bayesian Approaches

Analysis reveals that the convergence properties of Gaussian sieve priors often parallel those of frequentist sieve estimators, particularly in nonparametric and semi-parametric models. For example, periodogram-based estimators for long-memory time series achieve the minimax rate $$X_j^n = \int_0^1 \varphi_j(t) dX^n(t) = \theta_{0j} + n^{-1/2}\xi_j, \quad \xi_j\sim N(0,1).$$8, which matches the contraction rate of the sieve prior with deterministic $$X_j^n = \int_0^1 \varphi_j(t) dX^n(t) = \theta_{0j} + n^{-1/2}\xi_j, \quad \xi_j\sim N(0,1).$$9 (up to log-factors) (Kruijer et al., 2012).

In contrast to fully Bayesian methods that randomize $\theta=(\theta_j)_{j\geq 1}$0 with heavy-tailed priors (facilitating automatic adaptation over the entire parameter space), deterministic or empirically tuned sieves can deliver sharper convergence rates for specific functionals. This reflects an inherent trade-off: full Bayesian adaptation excels for function estimation in global metrics, but sacrifices efficiency for certain semi-parametric objectives.

7. Summary Table: Sieve Prior Contraction Rates

Problem/Class	Sieve Prior Type	Achieved Rate (up to logs)	Minimax/Optimal Rate
Global $\theta=(\theta_j)_{j\geq 1}$1 (Sobolev, white noise)	Poisson $\theta=(\theta_j)_{j\geq 1}$2, $\theta=(\theta_j)_{j\geq 1}$3	$\theta=(\theta_j)_{j\geq 1}$4	$\theta=(\theta_j)_{j\geq 1}$5
Pointwise (Sobolev, white noise)	Same	$\theta=(\theta_j)_{j\geq 1}$6	$\theta=(\theta_j)_{j\geq 1}$7
Long-memory $\theta=(\theta_j)_{j\geq 1}$8, FEXP (semi-parametric)	$\theta=(\theta_j)_{j\geq 1}$9 (deterministic)	$$\Pi(d\theta) = \sum_{k=1}^\infty \pi(k)\Pi_k(d\theta),$$0	$$\Pi(d\theta) = \sum_{k=1}^\infty \pi(k)\Pi_k(d\theta),$$1
Long-memory $$\Pi(d\theta) = \sum_{k=1}^\infty \pi(k)\Pi_k(d\theta),$$2, FEXP	Poisson/geometric $$\Pi(d\theta) = \sum_{k=1}^\infty \pi(k)\Pi_k(d\theta),$$3	$$\Pi(d\theta) = \sum_{k=1}^\infty \pi(k)\Pi_k(d\theta),$$4	$$\Pi(d\theta) = \sum_{k=1}^\infty \pi(k)\Pi_k(d\theta),$$5

The contraction properties confirm that Gaussian sieve priors are robust tools for adaptive nonparametric Bayes inference in high-dimensional and infinite-dimensional settings, but their performance must be evaluated in light of the specific estimation criterion of interest.

References: (Arbel et al., 2012, Kruijer et al., 2012).