A Tree-Based Multiscale Regression Method

A tree-based method for regression is proposed. In a high dimensional feature space, the method has the ability to adapt to the lower intrinsic dimension of data if the data possess such a property so that reliable statistical estimates can be performed without being hindered by the “curse of dimensionality.” The method is also capable of producing a smoother estimate for a regression function than those from standard tree methods in the region where the function is smooth and also being more sensitive to discontinuities of the function than smoothing splines or other kernel methods. The estimation process in this method consists of three components: a random projection procedure that generates partitions of the feature space, a wavelet-like orthogonal system deﬁned on a tree that allows for a thresholding estimation of the regression function based on that tree and, ﬁnally, an averaging process that averages a number of estimates from independently generated random projection trees.


INTRODUCTION
We consider the problem of estimating the unknown function in the model: with a sample (x i , y i ), i = 1, ..., n, where ε is a random variable with E(ε) = 0 and Var(ε) = σ 2 .
We are mainly interested in the case where the dimension p of the feature variable X is large, either relative to the sample size n of data or in itself, although the method of this paper also applies well to lower dimensional cases. When p is large, we assume that the domain of the function f is actually restricted to a much lower dimensional but unknown sub-manifold of R p . We refer to the dimension of this sub-manifold as the intrinsic dimension of the regression problem. An important question to ask in this regression setting is that without having to learn the sub-manifold first, can one find an estimator for f that automatically adapts to the intrinsic low dimensional structure of data in the sense that it can still provide efficient and reliable estimates, without being hindered by the "curse of dimensionality" [1,2] due to the large p? Bickel and Li [3] provide an affirmative answer to this question by showing that local polynomial regressions can achieve such a property under regularity conditions so that the decay of the prediction error in sample size depends only on the intrinsic dimension rather than p.
It turns out that the local polynomial regression is not the only approach that is capable of being adaptive to the intrinsic dimension of data. This is a more general phenomenon. Tree-based methods are useful and efficient alternatives and can be computationally more efficient. A work of Binev et al. [4,5] provides arguments implying that certain tree-based approximations are adaptive. Later, Dasgupta and Freund [6] and Kpotufe and Dasgupta [7] demonstrate explicitly such adaptability for their random projection trees when the intrinsic dimension is defined to be the so-called doubling dimension. A tree-based regression [7][8][9][10][11] is to partition recursively the feature space R p into finer and finer subsets and then estimate f locally within each finest subset. Such a process has a naturally hierarchical tree structure. The corresponding tree is called a partitioning tree. An extension of the tree methods is the random-forest approach [8]. In this approach, an average of individual tree estimates based on bootstrap samples is used. In addition to the adaptive property, Dasgupta et al. [6] and Kpotufe and Dasgupta [7] argue that tree methods can be computationally more efficient than kernel smoothing methods, including the local polynomial regressions, or k-nearest neighbor methods, because while it takes only O(log n) steps, the height of a balanced tree, for a tree method to reach to a prediction, it takes (n) for a kernel-type method and (n 1/2 ) for a k-nearest neighbor method to obtain a prediction.
We note that most of the tree-based regression methods depend exclusively on the means of y i 's over the partitioning subsets in constructing their partitioning trees, and use the means of the tree leaves for final estimates. While such estimates can be MLEs of the corresponding sampling distributions, they need not be optimal in terms of minimax theory [12]. Better nonparametric estimates can often be obtained through shrinkage and thresholding of the mean values. Some recent developments provide a framework for a waveletlike representation and analysis for tree-structure data. These methods adapt naturally to the shrinkage and thresholding processes in estimation. The unbalanced Haar orthogonal systems (also called the Haar-type wavelet orthogonal systems) on a given tree were constructed by several authors [13][14][15]. We note that the unbalanced Haar wavelets were first constructed in Mitrea [16] for dyadic cubes in R p and were later generalized in Girardi and Sweldens [15] to more general trees.
With the background above, we propose in this paper to integrate the wavelet-like analysis on trees with some efficient tree partitioning method so that an estimator for f that has the ability of adapting to the intrinsic low dimension of data can be obtained. However, our numerical experiments show that a simple combination of those ideas does not work well. Note that the ideas and results discussed above are mostly theoretical. There is little discussion in the literature on the actual numerical performance of those approaches. For example, the partition methods discussed in Binev et al. [4,5], while possessing very nice analytical properties (the rates of convergence), would have a computational complexity that grows exponentially in p. Our numerical experiments also indicate that, when compared to the standard methods like random-forest, support vector machines, or even classical CART, the random projection tree regression of Dasgupta et al. [6] and Kpotufe and Dasgupta [7] or a wavelet soft-thresholding method based on trees generated through various partitioning procedures, including CART and random projection, do not show much, if any, significant improvements in terms of prediction error. A better approach is needed in order to fulfill the theoretical potential of these ideas. We propose a regression estimator in this paper that mitigates the difficulties. Our focus in this paper is mainly the methodology.
We only consider binary trees in this paper. The same ideas can be easily applied to more general trees. The tree-based estimator proposed here consists of three components. The first component is a partitioning algorithm. In principle any reasonable binary classifier, supervised or un-supervised, can be a candidate. The random projection algorithm of Dasgupta et al. [6] and Kpotufe and Dasgupta [7] or uniform partition of Binev et al. [4,5] are un-supervised. For the kind of data we have, we however prefer supervised classifiers so that the information from y i 's can be utilized. We propose one such classifier below. The second component is a wavelet-like tree-based estimation process that incorporates thresholding and shrinkage operations. It turns out that this can be done in a statistically rather intuitive manner. The final component, a necessary and crucial one, is an averaging process, taking the average of the estimates across several independently generated partitioning trees on the same training data. This averaging process is different from that of a random-forest. In random-forest, the average is taken over bootstrapped samples, and our experiments indicate that it does not work well in some problems. We will call our method "averaging random tree regression." While proposed as a computationally feasible algorithm for regression with low intrinsic dimensional data, our method also possesses other good properties. This estimator is to be compared through numerical experiments to some standard non-parametric estimators using higher dimensional data. We will also compare it in a low dimensional setting to a smoothing spline and random-forest. In low dimensional experiments, we observe that the proposed estimator is capable producing visually smoother estimates than CART-based estimators and, at the same time, being much more sensitive than a smoothing spline estimator to discontinuities of f , as it would be expected. This paper is organized as follows. Section 2 gives a detailed description of the regression method and demonstrates some interesting features of the method. Section 3 gives some examples of our method. Section 4 provides a formulation of the method in terms of wavelet-like multilevel analysis on a tree. It includes a formal description of decomposition and reconstruction algorithms for the soft-thresholding estimation and an analytical study that establishes properties necessary for the thresholding method to work.

THE AVERAGING RANDOM TREE REGRESSION
Suppose a dataset {(x i , y i ), x i ∈ R p , y i ∈ R, i = 1, ..., n} is given. Let X = {x 1 , ..., x n } and Y = {y 1 , ..., y n }. For any subset B ⊂ X , we will writeȳ B for the mean of y i s in B: x i ∈B y i /n B , where n B denotes the size of B. Our tree-based method consists of three parts. We give a description for each of them below.

A Classifier for Space Partition and the Partitioning Tree
We first need a binary classifier which acts on the subsets of X and partitions any given subset A ⊂ X of at least two points into two finer subsets based on some classification criterion. Note that the partitioning method of the classical CART regression can certainly be one of such classifiers, but it can be computationally inefficient for higher dimensional data. Here we propose a different classifier based on the combination of an extension of the random projection proposed in Dasgupta and Freund [6] and Kpotufe and Dasgupta [7] and the idea of minimum sum of squares criterion of CART. The original random projection partition method do not utilize any information from y i 's. This is a weakness of that method and we try to avoid it in the current approach. The idea is to choose among several random projection partitions the one that has the least mean square error for y i 's. The partitioning classifier works as follows.
Let M be a preset integer number. For any subset A of X with r points, we generate M unit directional vectors v 1 , ..., v M in R p from a priori distribution (an uniform distribution for example). For each v j , j = 1, ...M, we project all the p-dimensional points x in A onto this unit vector to obtain a set of r scalars v T j x. Let m v j be the median of these scalars. Let If there are one or more x i ∈ A, i = 1, ..., r ≥ 1 such that v T j x i = m v j , we split these points randomly with equal probability into subsets of ⌊r⌋ (floor of r) and ⌈r⌉ (ceiling of r) points and assign the subsets with equal probability to A L,j or A R,j and still denote these subsets as A L,j and A R,j . In this way we obtain the partition A = A L,j ∪ A R,j . Next we find the sum of squares for this directional vector v j : (2) and choose the corresponding partitioning subsets A L and A R as the final partition of A and let m v be the corresponding dividing median. Let us denote the above process of obtaining a binary partition for a set A as where M is an adjustable parameter. Clearly, the outcomes of π M are random, depending on realizations of the random vectors v 1 , ..., v M . The reason for using median as the splitting point for partition is to keep the corresponding partition tree balanced. A balanced tree possesses some nice analytical properties for wavelet-like analysis on the tree, as we will see later.
With the partitioning classifier π M , we construct recursively a partitioning tree T so that each node in the tree T is a subset of X and the children nodes are partitioning subsets of their parent nodes. In other words, we set the root of T to be the whole point set X and, starting from the root, we keep partitioning each node into two children nodes with about the same size until a node becomes a singleton set. The leaves of T are singleton sets of X .
In this construction, each non-leaf node is associated with a pair (v, m v ) of a unit directional vector and the corresponding dividing median. All the pairs are pre-calculated and stored, and will serve as the parameters for partitioning the whole feature space R p . The space R p can now be partitioned into disjoint regions identified by the leaves of T as follows. To begin with, we classify every point x ∈ R p as an "X point." Next, for any x ∈ R p , if it is already classified as an "A point" for some tree node A ⊂ X of at least two points and if π M (A) = {A L , A R , v, m v }, we calculate the projection of x onto v and then classify x further as either an In the case of v T x = m v , we classify x with equal probability into either A L or A R . This classification process goes on and will eventually classify x into one and only one of the leaf nodes. If x is ultimately classified as a leaf node "{x i } point" for some x i ∈ X , we write Then A i , i = 1, ..., n forms a partition of R p according to the partitioning tree T . These trees are maximal trees. In order to preserve more local features of f in data, we do not prune them like CART. In fact, a default pruning process in CART destroys its ability to be adaptive to the intrinsic low dimension of data. On the other hand, as an implementation issue, if all y i s in a node A have very close values so that S(v j ) is small in all M selected directions, we can stop splitting this node and treat it as a leaf and use the mean of y i s as the y-value for this node. All computations below can still be carried out without change. The overfitting issue caused by a large tree will be addressed in the last step of our estimation process to be described later.

A Multiscale Soft-Thresholding Estimate of f(x i )
As we will see in section 4, the procedure described below is actually a modified version of a common wavelet denoising process with an unbalanced Haar wavelet on a tree. But since this process can also be described in a statistically more intuitive manner with simpler notations, we give the following algorithmic description first.
Suppose a partitioning tree T is obtained. A hierarchical representation of the data X × Y = {(x i , y i ), i = 1, ..., n} can be obtained according to the tree T as follows. For each non-leaf node in the tree A ⊂ X , we find the meanȳ A of the node and the difference of the means of its children nodes A L and A R : If A is a leaf, we set d A = 0. The original data can now be represented with the set of the numbers based on which regression estimates will be obtained.
Frontiers in Applied Mathematics and Statistics | www.frontiersin.org To estimatef (x i ), i = 1, ..., n, we first apply a soft-thresholding operation with a given α ≥ 0 to d A for all the non-leaf nodes A according to the formulâ as follows. We start with settinĝ For each node A, onceŷ A is obtained, we calculate the estimates for its two children nodes,ŷ A L andŷ A R , according to the formula: Repeat this process until one reaches all the leaves.
as an estimate of f (x i ). We will writeŷ i forŷ {x i } for short below. Note that, if α = 0 in (6), thend A = d A for all nodes A and, as a consequence,ŷ A =ȳ A for all A ∈ T . To see this, we note that y X =ȳ X , and if we haveŷ A =ȳ A andd A = d A , then Also note that |A L | and |A R | are differed by at most 1 and therefore for large nodes, |A L |/|A| ≃ |A R |/|A| ≃ 1/2. The smoothing parameter α can be determined through crossvalidation.
In the framework of wavelet analysis,d A are the wavelet coefficients and (7)-(8) is the fast wavelet reconstruction algorithm to be derived in section 4.

The Averaging Random Tree Regression
Now to estimate f (x) for any x ∈ R p , we can in principle usê In other words, a search along the tree T (with O(log 2 n) steps) will allow us to determined for each x ∈ R p which partitioning subset A i , as defined in (4), it belongs to and then useŷ i as an estimate for f (x). However, despite some nice theoretical properties, this estimate itself doesn't perform very well in our simulation experiments. It turns out that a significant improvement can be achieved by an averaging procedure described below. For a given integer K, we repeat the process described in Section 2.1 K times, independently, on the same data to obtain trees T k , k = 1, ..., K. For each tree T k , we calculate estimatesf k (x) according to (9). Finally, we take the averagê as the final estimate of f (x). Let's call this estimate an "Averaging Random Tree Regression" estimate, or ARTR estimate for short. This averaging step improves significantly the accuracy of the estimates for the regression function. The resulting estimates can be adaptive to lower intrinsic dimension of data. It can also be visually smoother than other tree-based regression methods in two or three dimensional cases even with piecewise constant Haar wavelets, and being sensitive to discontinuities at the same time.
It also addresses efficiently the overfitting problem. We summarize the process into the following steps: 1. Generate a partitioning tree T according to classifier π M . 2. Obtainȳ X and d A =ȳ A L −ȳ A R for all non-leave nodes A ∈ T and A L , A R ∈ π M (A). 3. ObtainD from D based on (6) for a given α andŷ i , i = 1, ..., n, through recursively applying (7) and (8). 4. Calculate the estimatef of f using (9). 5. Repeat steps 1-4 K times and take the average according to (10).
There are three tuning parameters in this process: M, the number of random projection directions for each partition in generating a partitioning tree; K, the number of trees to generate for averaging; and α, a factor in the threshold for smoothing. Cross-validation can be used to choose the values of these parameters. Simulation studies show that ARTR estimation outperforms some standard methods, as can be seen through the examples in the following subsection. Note that our averaging approach is similar in its appearance to but different in principle from that of the random forests. In fact, the random forests approach which averages tree estimates based on resampling dataset does not produce good results in our experiments. Formally, our estimate can be viewed as a kernel method which takes a weighted average of nearby data points to obtain an estimate.

EXAMPLES OF APPLICATIONS TO SOME STATISTICAL PROBLEMS
We give three examples demonstrating potential applications of the ARTR method. In all computations below, we set the number of random projections for partitioning M = 10 and the number of partition trees for averaging K = 36.

Example 1: Regression on a Lower Intrinsic Dimensional Manifold
This example is about high dimensional regression where the values of predictors are actually from an embedded unknown sub-manifold with a much lower dimension. In our example, this sub-manifold is the surface of a two-dimensional "Swiss roll" given by the parametric equations: and ε ∼ N(0, 1). Our data do not contain exact values of (x 1 , x 2 , x 3 ). Rather, all the 3-dimensional points are embedded isometrically (with an arbitrary and unknown isometric transformation) into the space R 4,000 . Therefore, each feature point is recorded as a p = 4, 000 dimensional point. We apply support vector machine regression (SVMR), random forests regression (RFR), extreme gradient boost regression (XGBR) with the parameter nrounds set to 100, our ART regression (ARTR) without averaging (K = 1) and with averaging (K = 36) to a training dataset of n = 1, 000 points and then apply the estimated models from these different methods to an independent testing dataset of 1,000 points. Predictions of the values for the function are obtained at these 1,000 testing points.
The approximation error at a point x is the difference between the predicted value at x and the true value of the function at x. Table 1 shows the mean squared approximation errors in this computation. We see that in terms of the mean approximation errors, ARTR with K = 36 is better than SVMR, and significantly better than RFR or XGBR. We also see that without taking average, ARTR with K = 1 has the worse performance. In ARTR we have used α = 2.0.

Example 2: Discovering Mixtures in a Higher Dimensional Space
This is a higher dimensional example. The problem in this example can be described in more general terms as follows. Suppose S 1 and S 2 are two unknown lower dimensional submanifolds embedded in R p . Suppose that data are sampled from S 1 ∪ S 2 and that y i 's sampled from S 1 have distribution N(µ 1 , σ 2 ) and y i 's from S 2 has distribution N(µ 2 , σ 2 ). In other words, where ε ∼ N(0, σ 2 ). We ask, from the data can we discover that y i 's are a mixture of two different distributions? We show that ARTR can achieve this while some standard method fails in the following experiment.
In this example, S 1 and S 2 are two intersecting unit 2-spheres embedded into a p = 6, 000 dimensional space R 6,000 . The centers of the 2-spheres are set to be 0.35 apart. We set µ 1 = 0, µ 2 = 2, and σ = 1. The data consists of n = 4, 000 sample points. A histogram of y i 's would reveal no signs that y i are from a mixture of two distributions. Four different methods are applied to fit the data: SVMR, RFR, XGBR, all with the default settings in R packages "svm, " "randomForest, " and "xgboost" (nround=100), and our ART regression. Estimatesŷ i of f (x i ) are obtained from the methods and their histograms are displayed also in Figure 1. For the ARTR we choose K = 36 and α = 2.0.
We see from the histograms in Figure 1 that SVMR fails to recognize correctly the underlying lower dimensional structure of the data. It mistakenly treats the central region bounded by the intersection of the two spheres as the third region in which y i 's have a mean value (µ 1 + µ 2 )/2 = 1. A much larger sample size is needed for SVMR to achieve a correct estimate, demonstrating the effect of the curse of dimensionality on the method. The RFR is capable of noticing the mixture and XGBR is better than RFR, but ARTR is clearly much more powerful than all others in detecting the mixture. This comparison between ARTR and RFR or XGBR supports the comment we make in the introduction section that a mean-based estimate can be significantly improved through shrinkage and thresholding operations.
The mean squared errors, calculated usingŷ i , i = 1, ..., 4, 000, and the true means µ 1 = 0 and µ 2 = 2, are listed in Table 2. It shows that ARTR has the smallest mean squared error among the four methods. We also notice that, while the mean squared error of SVMR is smaller than those of RFR or XGBR, the estimates from SVMR can be totally misleading.

Example 3: Smoothness and Sensitivity to Discontinuities
This is a two dimensional example to show smoothness and sensitivity to discontinuities of ARTR estimates. We do this through comparing ARTR to the thin plate splines (TPS) and random forests regression (RFR). The regression function we use is and ε ∼ N(0, 1). An image of f (x) is given in Figure 2 (in these figures, the valleys are shown in red and the peaks are shown in white). The data consist of n = 4, 000 points with points in X generated uniformly inside a two-dimensional unit square. Setting α = 2.0, we obtain ARTR estimates at 100 × 100 grid-points which is compared to the estimates at the same grid-points from the TPS and the RFR. In Figure 2, we observe that both TPS and ARTR produce smoother estimates than RFR does. Furthermore, the estimates from TPS and ARTR look more similar in local regions.
We note that the surface of the true regression function has a discontinuity line. Figure 3 provides a comparison among the three estimates. The two figures in the top row are the plots of errors from ARTR estimates and TPS estimates respectively. A difference between the two estimates along the discontinuity line is visible. The left plot in the second row of Figure 3 shows an even more significant difference. This figure displays a difference in sensitivity to discontinuities between the two methods. Note that, while such a property is what one would expect from a wavelet-type method, estimates from ARTR are smoother than those from a Haartype wavelet. In contrast, the difference between the TPS estimates and the RFR estimates, while visible, is more noisy and less definite. Overall, ARTR performs best in this example. The "ARTR vs TPS" figure in Figure 3 suggests that one might even consider using such a figure, obtained completely from data, as a mean for detecting discontinuity of a noisy surface.
The mean squared approximation errors of the three methods from the same simulation computation are listed in Table 3. We see that in terms of approximation errors, ARTR is similar to (or slightly better than) TPS, and RFR is worse among the three.

WAVELET-LIKE ANALYSIS ON TREES
It is possible that the tree-based method proposed above be formulated and applicable within a more general context in which X can be an arbitrary point set with a given partitioning tree T . In particular, X need not be a subset of R p . An important concept that makes an analysis possible for this setting is the tree metric [14] which characterizes the smoothness of the functions defined on X in terms of their tree wavelet coefficients. In this section we first give a formal description of a Haar wavelet-like orthogonal system on the tree T , then we present a fast-algorithm for decomposition and reconstruction of functions defined on X according to the tree T . This algorithm includes the algorithm in section 2 as a special case. The discussion below is for more general trees for which a leaf node can have more than one point and in this case the corresponding y-value is the average of y i s in the node.

Wavelet-Like Orthogonal Systems on T
Without loss of generality, we can assume that the binary partitioning tree T has L levels, with the root X at level 0 and  all the leaves at level L. This would be exactly the case for a tree T constructed in the previous section if X consists of 2 L points. To achieve this for an arbitrary X and tree T , if A is a node of the tree at level ℓ < L which is a leaf node, we simply define its offspring at level ℓ + 1 to be the node itself. For each ℓ = 0, 1, ..., L, we index all the nodes in T at level ℓ with an index set I ℓ and let P ℓ be the set of these nodes : Then P ℓ forms a partition of X : A ℓ,i ∩ A ℓ,j = ∅ for i = j and X = j∈I ℓ A ℓ,j . Further more, P ℓ+1 is a refinement of P ℓ with for some A ℓ+1,j ′ , A ℓ+1,j ′′ ∈ P ℓ+1 if |A ℓ,j | > 1, and for some A ℓ+1,j ′ ∈ P ℓ+1 if |A ℓ,j | = 1. With these notations, A 0,0 = X is the root and A L,j , j ∈ I L are the leaves of T .
A wavelet-like orthogonal system can now be defined on T as follows. Let be the space of all functions defined on X , equipped with the inner product: Let ν be the empirical probability measure of X induced by the set X of sample feature points: with the understanding that ν depends on the sample size n. For a function f on X , then  is just f , f . An orthogonal system on V with respect to the inner product in (12) can now be constructed based on the partitioning tree T . The following describes the construction of Haar-type wavelets on T , [13][14][15].

Theorem 1. The system of Haar-type wavelets
together with φ 0,0 (x) ≡ 1 form an orthogonal basis of V L . More precisely, V L can be decomposed as (16) with f ∈ V L represented as where B ℓ,j = ψ ℓ,j 2 is given by (17).
Since V L = V, (19) is a representation of all functions f on X .

Fast Multiresolution Algorithm For Wavelet Transform
The orthogonal system we discussed above allows for a fast algorithm for computing wavelet coefficients f , ψ ℓ,j . Let f ∈ V L be the input data given by with a L,j : = n f , φ L,j /|A L,j | = the average value of f (x) at the leave node A L,j . From and that for any L 0 with 0 ≤ L 0 ≤ L − 1, φ L 0 ,i , ψ ℓ,j , L 0 ≤ ℓ ≤ L − 1, i ∈ I L 0 , j ∈ J ℓ form an orthogonal basis for V L , we know that f ∈ V L can also be represented as where a 0,0 = 1 n x∈X f (x), and the wavelet coefficients d ℓ,j are given by A multiscale fast algorithm to compute the wavelet coefficients can be obtained based on the refinement of the scaling function φ ℓ,j . Next, let us look at the decomposition algorithm for calculating a L−1,j , d L−1,j from a L,j , and the reconstruction algorithm for recovering a L,j from a L−1,j , d L−1,j . Clearly, if k ∈ I L−1 \J L−1 , then a L−1,k ′ = a L−1,k , where k ′ ∈ I L−1 is such an index that A L−1,k ′ = A L,k . Next we consider k ∈ J L−1 , and let A L,k ′ and A L,k ′′ be two children of A L−1,k . From (20), (21), the orthogonality of φ L−1,j , ψ L−1,j and the fact supp With φ L−1,k 2 = ν(A L−1,k ) = ν(A L,k ′ ) + ν(A L,k ′′ ), we have Similarly, we have Thus, we have Combining these calculations, we obtain the following decomposition algorithm One can obtain as above by the refinement of φ L,j : φ L−1,j = φ L,j ′ + φ L,j ′′ and the orthogonality of φ L,j the following reconstruction algorithm (which can also be obtained directly from the above decomposition algorithm): We can obtain the algorithms in the same way for all other a ℓ,k , d ℓ,k . To summarize, we have the following theorem. Theorem 2. Let a ℓ,k , d ℓ,k be coefficients of f ∈ V L with the wavelet expansion. Then for every non-leave node A ℓ−1,k , k ∈ J ℓ−1 , and its children nodes A ℓ,k ′ and A ℓ,k ′′ , where 1 ≤ ℓ ≤ L, we have the decomposition algorithm: and the reconstruction algorithm: It can be easily verified that here a ℓ,k is exactly the mean of f (x i )'s over the subset A ℓ,k and d ℓ,k is the difference of the means of f (x i ) over the children subsets A ℓ+1,k ′ and A ℓ+1,k ′′ , respectively. This justifies (5), (7), and (8) without shrinking.
Observe that (26) is the algorithm (7) and (8) we use in section 2, and (27) is the representation (9) we also use in section 2 for estimation of f (x).

DISCUSSION
The regression method discussed in this paper is based on a tree-based representation of data and a wavelet-like multiscale analysis. The tree-based representation organizes data into hierarchically related partitioning subsets of feature points together with the differences of means of the response variables over the partitioning children subsets. With this representation, a wavelet soft-thresholding and reconstruction procedure allow us to fit the data into the tree-structure. For normal data, the softthresholding is equivalent to shrink a t-confidence interval about the origin to the origin on the real-line.
Through the examples (section 3), we see that this tress regression method can be an effective alternative to CART, random-forest, smoothing splines, or support vector machines in various circumstances. Its ability of being adaptive to intrinsic low dimension of data allows it to detect some hidden features of data, as is shown in Example 2, when the standard methods like support vector machine fail to archive this. It outperforms another popular tree-based method, random-forest in terms of prediction error in our regression example (Example 1) in high dimensional feature space with low intrinsic dimension of data.
When applied to lower dimensional data (Example 3), it again shows lower prediction error than CART or random-forest, and outperforms other smoothing method when regression function has discontinuities.
Other partitioning trees could be used in subsection 2.1. Rules for stopping further splitting a node can also be considered, provided that the local structures of the regression function in data can be optimally preserved. Another feature of this regression is that, unlike a standard wavelet analysis, the unbalanced Haar orthogonal system here is data dependent.
For large and high dimensional datasets, our method takes significantly more computation time than the other algorithms we used in our examples above. How to improve the speed of computation in our method is a challenge. One possible direction in searching for a faster algorithm is to use smaller and random subsets of the features for splitting each node in growing a tree.