# Doubly Decomposing Nonparametric Tensor Regression

Nonparametric extension of tensor regression is proposed. Nonlinearity in a high-dimensional tensor space is broken into simple local functions by incorporating low-rank tensor decomposition. Compared to naive nonparametric approaches, our formulation considerably improves the convergence rate of estimation while maintaining consistency with the same function class under specific conditions. To estimate local functions, we develop a Bayesian estimator with the Gaussian process prior. Experimental results show its theoretical properties and high performance in terms of predicting a summary statistic of a real complex network.

## Authors

• 21 publications
• 17 publications
05/03/2022

### Robust low-rank tensor regression via truncation and adaptive Huber loss

This paper investigates robust low-rank tensor regression with only fini...
04/06/2020

### Strong consistency of the nonparametric local linear regression estimation under censorship model

We introduce and study a local linear nonparametric regression estimator...
08/29/2020

We propose a novel broadcasting idea to model the nonlinearity in tensor...
08/27/2020

### Nonparametric Multivariate Density Estimation: A Low-Rank Characteristic Function Approach

Effective non-parametric density estimation is a key challenge in high-d...
12/11/2019

### Tensor Completion via Gaussian Process Based Initialization

In this paper, we consider the tensor completion problem representing th...
02/05/2015

### Provable Sparse Tensor Decomposition

We propose a novel sparse tensor decomposition method, namely Tensor Tru...
10/06/2020

### Improving Nonparametric Density Estimation with Tensor Decompositions

While nonparametric density estimators often perform well on low dimensi...
##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

## 1 Introduction

Tensor regression deals with matrices or tensors (i.e., multi-dimensional arrays) as covariates (inputs) to predict scalar responses (outputs) Wang et al. (2014); Hung and Wang (2013); Zhao et al. (2014); Zhou et al. (2013); Tomioka et al. (2007); Suzuki (2015); Guhaniyogi et al. (2015). Suppose we have a set of observations ; is a respondent variable in the space and is a covariate with th-order tensor form in the space , where is the dimensionality of order . With the above setting, we consider the regression problem of learning a function as

 Yi=f(Xi)+ui, (1)

where

is zero-mean Gaussian noise with variance

. Such problems can be found in several applications. For example, studies on brain-computer interfaces attempt to predict human intentions (e.g., determining whether a subject imagines finger tapping) from brain activities. Electroencephalography (EEG) measures brain activities as electric signals at several points (channels) on the scalp, giving channel time matrices as covariates. Functional magnetic resonance imaging captures blood flow in the brain as three-dimensional voxels, giving X-axis Y-axis Z-axis time tensors.

There are primarily two approaches to the tensor regression problem. One is assuming linearity to as

 f(Xi)=⟨B,Xi⟩, (2)

where is a weight parameter with the same dimensionalities as and denotes the inner product. Since is very high-dimensional in general, several authors have incorporated a low-rank structure to  Dyrholm et al. (2007); Zhou et al. (2013); Hung and Wang (2013); Wang et al. (2014); Suzuki (2015); Guhaniyogi et al. (2015). We collectively refer to the linear models (2) with low-rank as

tensor linear regression (TLR)

. As an alternative, a nonparametric approach has been proposed Zhao et al. (2013); Hou et al. (2015). When belongs to a proper functional space, with an appropriately choosing kernel function, the nonparametric method can estimate perfectly even if is nonlinear.

In terms of both theoretical and practical aspects, the bias-variance tradeoff is a central issue. In TLR, the function class that the model can represent is critically restricted due to its linearity and the low-rank constraint, implying that the variance error is low but the bias error is high if the true function is either nonlinear or full rank. In contrast, the nonparametric method can represent a wide range of functions and the bias error can be close to zero. However, at the expense of the flexibility, the variance error will be high due to the high dimensionality, the notorious nature of tensors. Generally, the optimal convergence rate of nonparametric models is given by

 O(n−β/(2β+d)), (3)

which is dominated by the input dimensionality and the smoothness of the true function  (Tsybakov, 2008). For tensor regression, is the total number of ’s elements, i.e., . When each dimensionality is roughly the same as , , which significantly worsens the rate, and hinders application to even moderate-sized problems.

In this paper, to overcome the curse of dimensionality, we propose

additive-multiplicative nonparametric regression (AMNR), a new class of nonparametric tensor regression. Intuitively, AMNR constructs as the sum of local functions taking the component of a rank-one tensor as inputs. In this approach, functional space and the input space are concurrently decomposed. This “double decomposition” simultaneously reduces model complexity and the effect of noise. For estimation, we propose a Bayes estimator with the Gaussian Process (GP) prior. The following theoretical results highlight the desirable properties of AMNR. Under some conditions,

• [topsep=0pt,itemsep=-1ex,partopsep=1ex,parsep=1ex]

• AMNR represents the same function class as the general nonparametric model, while

• the convergence rate (3) is improved as (), which is times better.

We verify the theoretical convergence rate by simulation and demonstrate the empirical performance for real application in network science.

## 2 AMNR: Additive-Multiplicative Nonparametric Regression

First, we introduce the basic notion of tensor decomposition. With a finite positive integer , the CANDECOMP/PARAFAC (CP) decomposition Harshman (1970); Carroll and Chang (1970) of is defined as

 X=R∗∑r=1λrx(1)r⊗x(2)r⊗…⊗x(K)r, (4)

where denotes the tensor product,

is a unit vector in a set

, and is the scale of satisfying for all . In this paper, is the rank of .

A similar relation holds for functions. Here, denotes a Sobolev space, which is times differentiable functions with support . Let be such a function. If is given by the direct product of multiple supports as , there exists a (possibly infinite) set of local functions satisfying

 g=∑m∏jg(j)m (5)

for any  (Hackbusch, 2012, Example 4.40). This relation can be seen as an extension of tensor decomposition with infinite dimensionalities.

### 2.1 The Model

For brevity, we start with the case wherein is rank one. Let with vectors and be a function on a rank one tensor. For any , we can construct such that using function composition as with . Then, using (5), is decomposed into a set of local functions as:

 f(X)=~f(x1,…,xK)=M∗∑m=1K∏k=1f(k)m(x(k)), (6)

where represents the complexity of (i.e., the “rank” of the model).

With CP decomposition, (6) is amenable to extend for having a higher rank. For , we define AMNR as follows:

 fAMNR(X):=M∗∑m=1R∗∑r=1λrK∏k=1f(k)m(x(k)r). (7)

Aside from the summation with respect to , AMNR (7) is very similar to CP decomposition (4) in terms of that it takes summation over ranks and multiplication over orders. In addition, as indicates the importance of component in CP decomposition, it controls how component contributes to the final output in AMNR. Note that, for , equality between and does not hold in general; see Section 4.

## 3 Truncated GP Estimator

### 3.1 Truncation of M∗ and R∗

To construct AMNR (7), we must know . However, this is unrealistic because we do not know the true function. More crucially, can be infinite, and in such a case the exact estimation is computationally infeasible. We avoid these problems using predefined rather than and ignore the contribution from . This may increase the model bias; however, it decreases the variance of estimation. We discuss how to determine in Section 4.2.

For , we adopt the same strategy as , i.e., we prepare some and approximate as a rank- tensor. Because this approximation reduces some information in X, the prediction performance may degrade. However, if is not too small, this preprocessing is justifiable for the following reasons. First, this approximation possibly removes the noise in . In real data such as EEG data, often includes observation noise that hinders the prediction performance. However, if the power of the noise is sufficiently small, the low-rank approximation discards the noise as the residual and enhances the robustness of the model. In addition, even if the approximation discards some intrinsic information of , its negative effects could be limited because s of the discarded components are also small.

### 3.2 Estimation method and algorithm

For each local function , consider the GP prior

, which is represented as multivariate Gaussian distribution

where is the zero element vector of size and is a kernel Gram matrix of size . The prior distribution of the local functions is then given by:

 π(F)=M∏m=1K∏k=1GP(f(k)m).

From the prior and the likelihood , Bayes’ rule yields the posterior distribution:

 π(F|Dn) =exp(−∑ni=1(Yi−G[F](Xi))2/σ)∫exp(−∑ni=1(Yi−G[~F](Xi))2/σ)π(~F)d~Fπ(F), (8)

where .

are dummy variables for the integral. We use the posterior mean as the Bayesian estimator of AMNR:

 ^fn=∫M∑m=1R∑r=1λr,iK∏k=1f(k)mdπ(F|Dn)dF. (9)

To obtain predictions with new inputs, we derive the mean of the predictive distribution in a similar manner.

Since the integrals in the above derivations have no analytical solution, we compute them numerically by sampling. The details of the entire procedure are summarized as follows. Note that denotes the number of random samples.

• Step 1: CP decomposition of input tensors
With the dataset , apply rank- CP decomposition to and obtain and for .

• Step 2: Construction of the GP prior distribution
Construct a kernel Gram matrix from for each and , and obtain random samples of the multivariate Gaussian distribution . For each sampling , obtain a value for each , and .

• Step 3: Computation of likelihood
To obtain the likelihood, calculate for each sampling and obtain the distribution by (8). Obtain the Bayesian estimator

and select the hyperparameters (optional).

• Step 4: Prediction with the predictive distribution
Given a new input , compute CP decomposition and obtain and . Then, sample from the prior for each . By multiplying the likelihood calculated in Step 3, derive the predictive distribution of and obtain its expectation with respect to .

##### Remark

Although CP decomposition is not unique up to sign permutation, our model estimation is not affected by this. For example, tensor with and has two equivalent decompositions: (A) and (B) . If training data only contains pattern (A), prediction for pattern (B) does not make sense. However, such a case is pathological. Indeed, if necessary, we can completely avoid the problem by flipping the sign of , and at random while maintaining the original sign of . Although the sign flipping decreases the effective sample size, it is absorbed as a constant term and the convergence rate is not affected.

## 4 Theoretical Analysis

Our main interest here is the asymptotic behavior of distance between the true function that generates data and an estimator (9). Preliminarily, let be the true function and be the estimator of . To analyze the distance in more depth, we introduce the notion of rank additivity111This type of additivity is often assumed in multivariate and additive model analysis Hastie and Tibshirani (1990); Ravikumar et al. (2009). for functions, which is assumed implicitly when we extend (6) to (7).

A function is rank additive if

 f(R∗∑r=1¯xr)=R∗∑r=1f(¯xr),

where .

Letting be a projection of onto the Sobolev space satisfying rank additivity, the distance is bounded above as

 ∥f0−^fn∥≤∥f0−f∗∥+∥f∗−^fn∥. (10)

Unfortunately, the first term is difficult to evaluate, aside from a few exceptions; if or is rank additive, .

Therefore, we focus on the rest term . By definition, is rank additive and the functional tensor decomposition (6) guarantees that is decomposed as the AMNR form (7) with some . Here, the behavior of the distance strongly depends on . We consider the following two cases: (i) is finite and (ii) is infinite. In case (i), the consistency of to is shown with an explicit convergence rate (Theorem 1). More surprisingly, the consistency also holds in case (ii) with a mild assumption (Theorem 2).

Figure 1 illustrates the relations of these functions and the functional space. The rectangular areas are the classes of functions represented by AMNR with small , AMNR with large , and Sobolev space with rank additivity.

Note that the formal assumptions and proofs of this section are shown in supplementary material.

### 4.1 Estimation with Finite M∗

The consistency of Bayesian nonparametric estimators is evaluated in terms of posterior consistency Ghosal et al. (2000); Ghosal and van der Vaart (2007); van der Vaart and van Zanten (2008). Here, we follow the same strategy. Let be the empirical norm. We define as the contraction rate of the estimator of local function

, which evaluates the probability mass of the GP around the true function. Note that the order of

depends on the covariance kernel function of the GP prior, in which the optimal rate of is given by (3) with . For brevity, we suppose that the variance of the noise is known and the kernel in the GP prior is selected to be optimal.222We assume that the Matérn kernel is selected and the weight of the kernel is equal to . Under these conditions, the optimal rate is achieved (Tsybakov, 2008). Then, we obtain the following result.

###### Theorem 1 (Convergence analysis).

Let . Then, with Assumption 1 and some finite constant ,

 E∥^fn−f∗∥2n≤Cn−2β/(2β+maxkIk).

Theorem 1 claims the validity of the estimator (9). Its convergence rate corresponds to the minimax optimal rate of estimating a function in on compact support in , showing that the convergence rate of AMNR depends only on the largest dimensionality of .

### 4.2 Estimation with Infinite M∗

When is infinite, we cannot use the same strategy used in Section 4.1. Instead, we truncate by finite and evaluate the bias error caused by the truncation. To evaluate the bias, we assume that the local functions are in descending order of their volumes , i.e., are ordered as satisfying for all . We then introduce the assumption that decays to zero polynomially with respect to .

###### Assumption 1.

With some constant ,

 ∥¯fm∥2=O(m−γ),

as .

This assumption is sufficiently limited. For example, if we pick as are orthogonal to each ,333For example, we can obtain such

by the Gram–Schmidt process.

then the Parseval-type inequality leads to , implying as .

Then we claim the main result in this section.

###### Theorem 2.

Suppose we construct the estimator (9) with

 M≍(n−2β/(2β+maxkIk))γ/(1+γ),

where denotes equality up to a constant. Then, with some finite constant ,

 E∥^fn−f∗∥2n≤C(n−2β/(2β+maxkIk))γ/(1+γ).

The above theorem states that, even if we truncate by finite , the convergence rate is nearly the same as the case of finite (Theorem 1), which is slightly worsened by the factor .

Theorem 2 also suggests how to determine . For example, if , and , is recommended, which is much smaller than the sample size. Our experimental results (Section 6.3) also support this. Practically, very small is sufficient, such as or , even if is greater than .

Here, we show the conditional consistency of AMNR, which is directly derived from Theorem 2.

###### Corollary 1.

For all function with finite or Assumption 1, the estimator (9) satisfies

 E∥^fn−f0∥2n→0,

as .

## 5 Related Work

### 5.1 Nonparametric Tensor Regression

The tensor GP (TGP) (Zhao et al., 2014; Hou et al., 2015) in a method that estimates the function in directly. TGP is essentially a GP regression model that flattens a tensor into a high-dimensional vector and takes the vector as an input. Zhao et al. (2014) proposed its estimator and applied it to image recognition from a monitoring camera. Hou et al. (2015) applied the method to analyze brain signals. Although both studies demonstrated the high performance of TGP, its theoretical aspects such as convergence have not been discussed.

Signoretto et al. (2013) proposed a regression model with tensor product reproducing kernel Hilbert spaces (TP-RKHSs). Given a set of vectors , their model is written as

 ∑jαj∏kf(k)j(xk), (11)

where is a weight. The key difference between TP-RKHSs (11) and AMNR is in the input. TP-RKHSs take only a single vector for each order, meaning that the input is implicitly assumed as rank one. On the other hand, AMNR takes rank- tensors where can be greater than one. This difference allows AMNR to be used for more general purposes, because the tensor rank observed in the real world is mostly greater than one. Furthermore, the properties of the estimator, such as convergence, have not been investigated.

### 5.2 Tlr

For the matrix case (), Dyrholm et al. (2007) proposed a classification model as (2), where is assumed to be low rank. Hung and Wang (2013)

proposed a logistic regression where the expectation is given by (

2) and is a rank-one matrix. Zhou et al. (2013) extended these concepts for tensor inputs. Suzuki (2015) and Guhaniyogi et al. (2015) proposed a Bayes estimator of TLR and investigated its convergence rate.

Interestingly, AMNR is interpretable as a piecewise nonparametrization of TLR. Suppose and have rank- and rank- CP decompositions, respectively. The inner product in the tensor space in (2) is then rewritten as the product of the inner product in the low-dimensional vector space, i.e.,

 ⟨B,Xi⟩=M∑m=1R∑r=1λr,iK∏k=1⟨b(k)m,x(k)r,i⟩, (12)

where is the order- decomposed vector of . The AMNR formation is obtained by replacing the inner product with local function .

From this perspective, we see that AMNR incorporates the advantages of TLR and TGP. AMNR captures nonlinear relations between and through , which is impossible for TLR due to its linearity. Nevertheless, in contrast to TGP, an input of the function constructed in a nonparametric way is given by an -dimensional vector rather than an -dimensional tensor. This reduces the dimension of the function’s support and significantly improves the convergence rate (Section 4).

### 5.3 Other studies

Koltchinskii et al. (2010) and Suzuki et al. (2013) investigated Multiple Kernel Learning (MKL) considering a nonparametric -variate regression model with an additive structure: . To handle high dimensional inputs, MKL reduces the input dimensionality by the additive structure for and

. Note that both studies deal with a vector input, and they do not fit to tensor regression analysis.

Table 1 summarizes the methods introduced in this section. As shown, MKL and TP-RKHSs are not applicable for general tensor input. In contrast, TLR, TGP, and AMNR can take multi-rank tensor data as inputs, and their applicability is much wider. Among the three methods, AMNR is only the one that manages nonlinearity and avoids the curse of dimensionality on tensors.

## 6 Experiments

### 6.1 Synthetic Data

We compare the prediction performance of three models: TLR, TGP, and AMNR. In all experiments, we generate datasets by the data generating process (dgp) as and fix the noise variance as . We set the size of , i.e., and . By varying the sample size as , we evaluate the empirical risks by the mean-squared-error (MSE) for the testing data, for which we use one-half of the samples. For each experiment, we derive the mean and variance of the MSEs in 100 trials. For TGP and AMNR, we optimize the bandwidth of the kernel function by grid search in the training phase.

#### 6.1.1 Low-Rank Data

First, we consider the case that and the dgp are exactly low rank. We set , the true rank of , as and

 f∗(X)=R∗∑r=1λrK∏k=1(1+exp(–γTx(k)r))−1

where . The results (Figure 3) show that AMNR and TGP clearly outperform TLR, implying that they successfully capture the nonlinearity of the true function. To closely examine the difference between AMNR and TGP, we enlarge the corresponding part (Figure 3(b)), which shows that AMNR consistently outperforms TGP. Note that the performance of TGP improves gradually as increases, implying that the sample size is insufficient for TGP due to its slow convergence rate.

#### 6.1.2 Full-Rank Data

Next, we consider the case that is full rank and the dgp has no low-rank structure, i.e., model misspecification will occur in TLR and AMNR. We generate as with

 f∗(X)=K∏k=1(1+exp(−∥X∥2/∏kIk))−1.

The results (Figure 3) show that, as in the previous experiment, AMNR and TGP outperform TLR. Although the difference between AMNR and TGP (Figure 3(b)) is much smaller, AMNR still outperforms TGP. This implies that, while the effect of AMNR’s model misspecification is not negligible, TGP’s slow convergence rate is more problematic.

### 6.2 Sensitivity of Hyperparameters

Here, we investigate how the truncation of and affect prediction performance. In the following experiments, we fix the sample size as .

First, we investigate the sensitivity of . We use the same low-rank dgp used in Section 6.1.1 (i.e., .) The results (Figure 5) show that AMNR and TGP clearly outperform TLR. Although their performance is close, AMNR beats TGP when is not too large, implying that the negative effect of truncating is limited.

Next, we investigate the sensitivity of . We use the same full-rank dgp used in Section 6.1.2. Figure 5 compares the training and testing MSEs of AMNR, showing that both errors increase as increases. These results imply that the model bias decreases quickly and estimation error is more dominant. Indeed, the lowest testing MSE is achieved at . This agrees satisfactory with the analysis in Section 4.2, which recommends small .

### 6.3 Convergence Rate

Here, we confirm how the empirical convergence rates of AMNR and TGP meet the theoretical convergence rates. To clarify the relation, we generate synthetic data from dgp with such that the difference between TGP and AMNR is maximized. To do so, we design the dgp function as and

 f(k)=∑lμlϕl(γTx),

where is an orthonormal basis function of the functional space and .444This dgp is derived from a theory of Sobolev ellipsoid; see Tsybakov (2008).

For we consider three variations: , , and (Table 2). Figure 6 shows testing MSEs averaged over trials. The theoretical convergence rates are also depicted by the dashed line (TGP) and the solid line (AMNR). To align the theoretical and empirical rates, we adjust them at . The result demonstrates the theoretical rates agree with the practical performance.

### 6.4 Prediction of Epidemic Spreading

Here, we deal with the epidemic spreading problem in complex networks Anderson and May (1991); Vespignani (2012) as a matrix regression problem. More precisely, given an adjacency matrix network , we simulate the spreading process of a disease by the susceptible-infected-recovered (SIR) model as follows.

1. We select 10 nodes as the initially infected nodes.

2. The nodes adjacent to the infected nodes become infected with probability .

3. Repeat Step 2. After 10 epochs, the infected nodes recover and are no longer infected (one iteration = one epoch).

After the convergence of the above process, we count the total number of infected nodes as . Note that the number of infected nodes depends strongly on the network structure and its prediction is not trivial. Conducting the simulation is of course a reliable approach; however, it is time-consuming, especially for large-scale networks. In contrast, once we obtain a trained model, regression methods make prediction very quick.

As a real network, we use the Enron email dataset Klimt and Yang (2004), which is a collection of emails. We consider these emails as undirected links between senders and recipients (i.e., this is a problem of estimating the number of email addresses infected by an email virus). First, to reduce the network size, we select the top email addresses based on frequency and delete emails sent to and received from other addresses. After sorting the remaining emails by timestamp, we sequentially construct an adjacency matrix from every emails, and we finally obtain input matrices.

For the analysis, we set for the AMNR and TLR methods.555We also tested , and ; however, the results were nearly the same. Although

seems small, we can still use the top-two eigenvalues and eigenvectors, which contain a large amount of information about the original tensor. In addition, the top eigenvectors are closely related to the threshold of outbreaks in infection networks

Wang et al. (2003). From these perspectives, the good performance demonstrated by AMNR with is reasonable. The bandwidth of the kernel is optimized by grid search in the training phase.

Figure 7 shows the training and testing MSEs. Firstly, there is a huge performance gap between TLR and the nonparametric models in the testing error. This indicates that the relation between epidemic spreading and a graph structure is nonlinear and the linear model is deficient for this problem. Secondly, AMNR outperforms TGP for every in both training and testing errors. In addition, the performance of AMNR is constantly good and almost unaffected by . This suggests that the problem has some extrinsic information that inflates the dimensionality, and the efficiency of TGP is diminished. On the other hand, it seems AMNR successfully captures the intrinsic information in a low-dimensional space by its “double decomposition” so that AMNR achieves the low-bias and low-variance estimation.

## 7 Conclusion and Discussion

We have proposed AMNR, a new nonparametric model for the tensor regression problem. We constructed the regression function as the sum-product of the local functions, and developed an estimation method of AMNR. We have verified our theoretical analysis and demonstrated that AMNR was the most accurate method for predicting the spread of an epidemic in a real network.

The most important limitation of AMNR is the computational complexity, which is better than TGP but worse than TLR. The time complexity of AMNR with the GP estimator is , where CP decomposition requires  Phan et al. (2013) for inputs and the GP prior requires for the local functions. On the contrary, TGP requires computation because it must evaluate all the elements of to construct the kernel Gram matrix. When and , which are satisfied in many practical situations, the proposed method is more efficient than TGP.

Approximation methods for GP regression can be used to reduce the computational burden of AMNR. For example, Williams and Seeger (2001) proposed the Nyström method, which approximates the kernel Gram matrix by a low-rank matrix. If we apply rank- approximation, the computational cost of AMNR can be reduced to .

## Appendix A Proof of Theorem 1

Here, we describe the detail and proof of Theorem 1. At the beginning, we introduce a general theory for evaluating the convergence of a Bayesian estimator.

Preliminary, we introduce some theorems from previous studies. Let be a true distribution of ,

be the Kullback-Leibler divergence, and define

. Let be the Hellinger distance, be the bracketing number, and be the packing number. Also we consider a reproducing kernel Hilbert space (RKHS), which is a closure of linear space spanned by a kernel function. Denote by the RKHS on .

The following theorem provides a novel tool to evaluate the Bayesian estimator by posterior contraction.

###### Theorem 3 (Theorem 2.1 in Ghosal et al. (2000)).

Consider a posterior distribution on a set . Let be a sequence such that and . Suppose that, for a constant and sets , we have

1. ,

2. ,

3. .

Then, for sufficiently large , .

Based on the theorem, van der Vaart and van Zanten (2008) provide a more useful result for the Bayesian estimator with the GP prior. They consider the estimator for an infinite dimensional parameter with the GP prior and investigated the posterior contraction of the estimator with GP. They provide the following conditions.

##### Condition (A)

With some Banach space and RKHS ,

1. ,

2. ,

3. ,

where is a random element in and is a true function in support of .

When the estimator with the GP prior satisfied the above conditions, the posterior contraction of the estimator is obtained as Theorem 2.1 in Ghosal et al. (2000).

Based on this, we obtain the following result. Consider a set of GP and let be a stochastic process that satisfies .

Also we assume that there exists a true function which is constituted by a unique set of local functions .

To describe posterior contraction, we define a contraction rate . It converges to zero as . Let be a concentration function such that

 ϕ(k)(ϵ):=infh∈H(k):∥h−w0∥<ϵ∥h∥2H(k)−logPr(∥W(k)∥<ϵ),

where is the norm induced by the inner product of RKHS. We define the contraction rate with . We denote a sequence satisfying

 ϕ(k)(ϵ(k)n)≤n(ϵ(k)n)2.

The order of depends on a choice of kernel function, where the optimal minimax rate is  Tsybakov (2008). In the following part, we set for every . As , the satisfies the condition about the concentration function.

We also note the relation between posterior contraction and the well-known risk bound. Suppose the posterior contraction such that holds, where is a parameter, is a true value, and is a bounded metric. Then we obtain the following inequality:

 EΠn(d2n(θ,θ0)|Dn)≤Cϵ2n+DEΠn(θ:d2n(θ,θ0)≥Cϵ2n|Dn),

where is a bound of . This leads . In addition, if is convex, the Jensen’s inequality provides . By taking the expectation, we obtain

 Ed2n(θ,θ0)≤EΠn(d2n(θ,θ0)|Dn)=O(Cϵ2n).

We start to prove Theorem 1. First, we provide a lemma for functional decomposition. When the function has a form of a -product of local functions, we bound a distance between two functions with a -sum of distance by the local functions.

###### Lemma 1.

Suppose that two functions have a form and with local functions . Then we have a bound such that

###### Proof.

We show the result based on induction. When , we have

 f−g=f1f2−g1g2=f1(f2−g2)+(f1−g1)g2,

and

 ∥f−g∥≤∥f1∥∥f2−g2∥+∥f1−g1∥∥g2∥.

Thus the result holds when .

Assume the result holds when . Let . The difference between -product functions is written as

 f−g=fk′+1∏k′fk−gk′+1∏k′gk=∏k′fk(fk′+1−gk′+1)+(∏k′fk−∏k′gk)gk′+1.

From this, we obtain the bound

The distance is decomposed recursively by the case of . Then we obtain the result. ∎

Now we provide the proof of Theorem 1. Note that in the statement in Theorem 1. Asume that are some positive finite constants and they are not affected by other values.

###### Proof.

We will show that satisfies the condition (A). Firstly, we check the third condition in the theorem.

According to Lemma 1, the value is bounded as

 ∥Fx−f0∥ ≤∑m∑r∥∥ ∥∥∏kW(k)r−∏kw(k)m,0∥∥ ∥∥

By denoting , we evaluate the probability as

 Pr(∥F−f0∥≤ϵn) ≥Pr⎛⎝∑m∑r∑k∥∥W(k)m−w(k)m,0∥∥∏k′≠k∥∥~W(k′)m∥∥≤ϵn⎞⎠ ≥Pr(∑r∑k∑m∥∥W(k)m−w(k)m,0∥∥≤1Ckϵn), (13)

where is a positive finite constant satisfying .

From van der Vaart and van Zanten (2008), we use the following inequality for every Gaussian random element :

 Pr(∥W−w0∥≤ϵn)≥exp(−nϵ2n),

Then, by seting and with some constant , we bound (13) below as

 Pr(∑r∑k∑m∥∥W(k)m−w(k)m,0∥∥≤1Ck∑m,r,kϵ(k)n) ≥∏m,r,kPr(∥∥W(k)m−w(k)m,0∥∥≤1Ckϵ(k)n) ≥∏m∏r∏kexp(−n(Ck)2ϵ(k),2n) ≥exp(−n∑m,r,kϵ(k),2n).

For the second condition, we define a subspace of the Banach space as

 B(k)n=ϵ(k)nB(k)1+M(k)nH(k)1,

for all . Note and are unit balls in and . Also, we define as

 Bn:={w:w=MR∏kwk,wk∈B(k)n,∀k}.

As shown in van der Vaart and van Zanten (2008), for every and ,

 Pr(W(k)m∉B(k)n)≤1−Φ(α(k)n+M(k)n),

where

is the cumulative distribution function of the standard Gaussian distribution;

and satisfy the following equation with a constant as

 α(k)n=Φ−1(Pr(W(k)m∈ϵnB(k)1))=Φ−1(exp(−ϕ0(ϵ(k)n))), M(k)n=−2Φ−1(exp(−C′n(ϵ(k)n