Adaptive and non-adaptive minimax rates for weighted Laplacian-Eigenmap based nonparametric regression


Abstract

We show both adaptive and non-adaptive minimax rates of convergence for a family of weighted Laplacian-Eigenmap based nonparametric regression methods, when the true regression function belongs to a Sobolev space and the sampling density is bounded from above and below. The adaptation methodology is based on extensions of Lepski’s method and is over both the smoothness parameter (\(s\in\mathbb{N}_{+}\)) and the norm parameter (\(M>0\)) determining the constraints on the Sobolev space. Our results extend the non-adaptive result in [1], established for a specific normalized graph Laplacian, to a wide class of weighted Laplacian matrices used in practice, including the unnormalized Laplacian and random walk Laplacian.

1 Introduction↩︎

Consider the following regression model, \[\begin{align} \label{regressmodel} Y_{i}=f(X_{i})+\varepsilon_{i},\quad i=1,\ldots,n, \end{align}\tag{1}\] where \(f:\mathcal{X}\to \mathbb{R}\) is the true regression function, \(X_{i} \overset{\text{i.i.d.}}{\sim} g\), where \(g\) is a density on \(\mathcal{X}\subset \mathbb{R}^d\), and \(\varepsilon_{i}\overset{\text{i.i.d.}}{\sim} N(0,1)\) is the noise (independent of the \(X_{i}\)’s). The goal is to estimate the regression function \(f\) given pairs of observations \((X_{1}, Y_{1}),\ldots, (X_{n}, Y_{n})\). Our main contribution in this work is to develop non-adaptive and adaptive estimators that achieve minimax optimal estimation rates, when \(f\) lies in Sobolev spaces.

The estimators we study are based on performing principal components regression using the estimated eigenfunctions of a family of weighted Graph Laplacian operators. To this end, various versions of Graph Laplacian matrices have been considered in the literature. Recently, [2] proposed a unifying framework by describing a family of Graph Laplacian matrices, parametrized by \(w\in\mathbb{R}^3\); see 2 and 3 for details. This captures Laplacian matrices used widely in practice, including the normalized, unnormalized and the random walk Laplacian.

[1] analyzed principal components regression specifically using unnormalized graph Laplacian matrices constructed over \(\epsilon\)-graphs, and established non-adaptive minimax rates when \(f\) lies in Sobolev spaces. In this paper, we first extend this result to the entire family of weighted Laplacian matrices from 2 and 3 ; Theorem 1. These results are established by assuming a sampling density bounded from above and below and a true regression function belonging to a Sobolev space.

Note that technically, the weighted Laplacian matrices correspond to a family of weighted Sobolev spaces which all become equivalent under the above-mentioned boundedness assumption on the sampling density. However, the parameters of the corresponding Sobolev spaces, in particular the smoothness parameter (\(s\in\mathbb{N}_{+}\)) and the norm parameter (\(M>0\)) determining the constraints on the Sobolev space, both change on \(w\).

While the minimax rate optimal non-adaptive estimator depends on the knowledge of the smoothness and norm parameters of the true regression function, these parameters are unknown in practice. Tuning parameters, such as \(\epsilon\), the graph radius (or the bandwidth for the kernel) and \(K\), the number of eigenvectors considered, require knowledge of the smoothness and the norm parameters. Hence, in order to apply the Laplacian-based regression methodology in practice, we develop an adaptive estimator, based on Lepski’s method, and show in Theorem 2 that the developed estimator achieves minimax rates (up to \(\log\) factors) without requiring the knowledge of either the smoothness or the norm parameters.

The main technical contributions we make in this work towards establishing the aforementioned both adaptive and non-adaptive results include the following:

  • As a part of the proofs of our main results in Theorem 1, we rigorously prove the idea roughly outlined by [2] on showing the convergence of the discrete weighted graph Laplacian matrices to their continuum counterparts (in appropriately well-defined sense) by leveraging the concentration result established by [3] for kernel density estimators.

  • We generalize the convergence property of the eigenvalues of the Laplacian matrices in [4] to the weighted Laplacian matrices by providing an analogous bound for the eigenvalues combined with Weyl’s law.

  • We formulate a simultaneous two-parameter Lepski’s procedure and obtain the adaptive minimax rate (see Theorem 2) through deriving a high-order-moment-based concentration inequality of the weighted Sobolev semi-norm.

Our contributions not only highlight the significance of utilizing the weighted graph Laplacians for nonparametric regression but also establish a solid statistical foundation for this method, offering a robust framework that underpins the reliability and effectiveness of this approach.

1.1 Related works↩︎

Graph Laplacians are widely used in many data science problems for feature learning and spectral clustering [5][8], extracting heat kernel signatures for shape analysis [9][11], reinforcement learning [12], [13] and dimensionality reduction [14], [15], among other applications. There is an ever-growing literature on further applications of graph Laplacian in data science topic, and we also refer to [16][18] for more discussions.

As mentioned above, we consider the application of the weighted graph Laplacian for achieving minimax optimal rates in nonparametric regression. Other works focusing on this problem (including the semi-supervised setting) include [19] and  [1] using unnormalized Laplacian based on the Laplacian eigenmaps [14], [20] with Laplacian smoothing, [21] adopting spectral series regression on the Sobolev spaces, [22] applying the graph Poly-Laplacians (see Remark 4 for specific comparison to this method) and [23] using topological data analysis. We also refer to [24], [25], [26], [27] and [28] for related analysis in the context of regression problems.

In recent years, there has been a great deal of progress on obtaining theoretical rates of convergence in the context of Laplacian operator estimation and related eigenvalue and/or eigenfunction estimation. Early work on consistency of graph Laplacians focused on pointwise consistency results for \(\epsilon\)-graphs, see [29][32] and references therein for more details. For fixed neighborhood size \(\epsilon\), [33] and [34] considered spectral convergence of graph Laplacians. Furthermore, [35] established conditions on connectivity for the above spectral convergence with no specific error estimates. Later on, the convergence of Laplacian matrices to Laplacian operators has been considered where, for instance, unnormalized, random walk Laplacians and \(k\)-NN graph based Laplacians are considered; e.g. see  [4], [36], [37]. There, rates of convergences of Laplacian eigenvalues and eigenvectors to population counterparts with explicit error estimates are derived. Following the above literature, [2] developed a framework for extending the above convergence results to a general Laplacian family, the weighted Laplacians (see below), and presented some heuristic asymptotic analysis.

To the best of our knowledge, the only work that considers adaptivity in the context of Laplacian estimation is [38]. They use Lepski’s method for adaptive estimation of the unnormalized Laplace-Beltrami operators, focusing on bandwidth parameters. Also, they adopt a more flexible version of Lepski’s method introduced in [39] that involves certain multiplicative coefficients introduced in the variance and bias terms to develop the method. Therefore, their proof technique is to consider the trade-off between the bounds on the approximation error and the variance of Laplacian estimators. However, in this paper, we apply Lepski’s method in the context of regression problem by using weighted Laplacians instead of just the unnormalized Laplacians (as in [38]). Additionally, besides the bandwidth parameter, our method is also adaptive to the smoothness parameter and the norm parameter of the Sobolev space under consideration, i.e., in our work, we use Lepski’s method for simultaneous adaptation to the unknown parameters of the function class under consideration.

2 Preliminaries↩︎

In this section, we first describe the data-based weighted graph Laplacian matrices, and the corresponding nonparametric regression estimator. We then introduce the associated limiting operators and the weighted Sobolev spaces.

2.1 Weighted graph Laplacian matrices↩︎

Given i.i.d data \(X_{1},\ldots,X_{n}\) from a distribution \(G\) on \(\mathcal{X}\subseteq \mathbb{R}^{d}\) with the density \(g\), consider a graph \(G\) with vertex set \(\{X_1,\ldots,X_n\}\) and adjacency matrix \(\tilde{W}\) given by \[\begin{align} \label{eq:weights} \tilde{w}_{i,j}^{\epsilon}:=\frac{1}{n\epsilon^{d}}\eta\left(\frac{\|X_i-X_j\|}{\epsilon}\right),\quad i,j=1,\ldots,n, \end{align}\tag{2}\] where \(\| \cdot\|\) denotes the standard Euclidean norm. Here \(\eta \ge 0\) is a kernel function with support \([0,1]\), and \(\varepsilon\) is the bandwidth parameter. In other words, \(G\) is constructed by placing an edge \(X_i\sim X_j\), when \(\|X_i-X_{j}\|\le \epsilon,\) and this edge is given the weight \(\tilde{w}_{i,j}^{\epsilon}.\) The term \((n\epsilon^{d})^{-1}\) is a convenient normalization factor. The degree matrix is then given by a diagonal matrix \(\tilde{D}\) with the \(i\)-th diagonal element as \[\begin{align} \tilde{d}_{i}:=\sum_{j=1}^{n}\tilde{w}_{i,j}^{\epsilon},\quad i=1,\ldots,n, \end{align}\] which can also be thought of as the kernel density estimator (KDE) of the density \(g\) at \(X_i\).

The weighted graph Laplacian matrices are a family of graph Laplacians consisting of various types of normalizations characterized by a parameter \(w=(p,q,r)\in \mathbb{R}^{3}\) constructed as follows. First define a re-weighted adjacency matrix \(W\) with \((i,j)\)-th element as \[\begin{align} w_{i,j}^{\epsilon}:=\frac{\tilde{w}_{i,j}^{\epsilon}}{\tilde{d}_{i}^{1-\frac{q}{2}}\tilde{d}_{j}^{1-\frac{q}{2}}},\quad i,j=1,\ldots,n, \end{align}\] so that the corresponding diagonal degree matrix \(D\) as entries \[\begin{align} d_{i}:=\sum_{j=1}^{n}w_{i,j}^{\epsilon},\quad i=1,\ldots,n. \end{align}\] Then, the weighted graph Laplacian after re-weighting is defined in [2] as follows: for a tuple \(w=(p,q,r)\in\mathbb{R}^{3}\), \[\label{weightedgraph} L_{w,n,\epsilon}:= \left\{ \begin{align} &\frac{1}{\epsilon^{2}}D^{\frac{1-p}{q-1}}(D-W)D^{-\frac{r}{q-1}},\qquad\text{if}\;q\neq 1,\\ &\frac{1}{\epsilon^{2}}(D-W),\qquad\qquad\qquad\quad\text{if}\;q=1, \end{align} \right.\tag{3}\] where \(1/\epsilon^{2}\) is also a normalization factor. For \(u\in \mathbb{R}^{n}\), the \(i\)-th coordinate of the vector \(L_{w,n,\epsilon}u\) is given by \[\begin{align} \label{def:weightedL} (L_{w,n,\epsilon}u)_{i}=\frac{1}{\epsilon^{2}}\sum_{j=1}^{n}d_{i}^{\frac{1-p}{q-1}}w_{i,j}^{\epsilon}\left(d_{i}^{-\frac{r}{q-1}}u_i-d_{j}^{-\frac{r}{q-1}}u_j\right). \end{align}\tag{4}\] The above weighted graph Laplacian 3 generalizes many commonly used graph Laplacian. For \((p,q,r)=(1,2,0)\), it recovers the unnormalized graph Laplacian \(L_{u}\); if \((p,q,r)=(3/2,2,1/2)\), it gives the normalized graph Laplacian \(L_{n}\); if \((p,q,r)=(2,2,0)\), it corresponds to a non-symmetric matrix but can be interpreted as a transition probability of a random walk on a graph denoted by \(L_{r}\): \[\begin{align} L_{u}&:=D-W,\\ L_{n}&:=D^{-1/2}(D-W)D^{1/2},\\ L_{r}&:=D^{-1}(D-W), \end{align}\]

While the main focus on \(\epsilon\)-graphs, we highlight that the above formulation also caputures the limits of graph constructed based on the \(k\)-nearest neighbor graphs. In particular, when \((p,q,r)=(1,1-2/d,0)\), one can call the related normalization as the near \(k\)-NN normalization; see [4] and [2] for details.

Note that the weighted Laplacian matrix \(L_{w,n,\epsilon}\) is actually not self-adjoint with respect to the Euclidean inner product \(\langle\cdot,\cdot\rangle\) since it is in general not symmetric. However, it is self-adjoint with respect to the following weighted inner product \(\langle \cdot,\cdot\rangle_{g^{p-r}}\): \[\langle\cdot,\cdot\rangle_{g^{p-r}}:= \left\{ \begin{align} &\langle\cdot,\cdot\rangle_{D^{\frac{p-1-r}{q-1}}}\qquad \text{if}\;q\neq 1,\\ &\langle\cdot,\cdot\rangle\quad\quad\quad\quad\quad \text{if}\;q=1, \end{align} \right.\] where for a given a symmetric matrix \(A\in\mathbb{R}^{n\times n}\) and vectors \(u,v\in\mathbb{R}^{n}\), define \[\begin{align} \langle u,v \rangle_{A}:=u^{T}Av. \end{align}\] We also define the normalized weighted inner product: \(\langle\cdot,\cdot\rangle_{w,n}:=n^{-1}\langle\cdot,\cdot\rangle_{g^{p-r}}\) and the normalized Euclidean inner product: \(\langle\cdot,\cdot\rangle_{n}:=n^{-1}\langle\cdot,\cdot\rangle\) and denote by \(\|\cdot\|_{w,n}\) and \(\|\cdot\|_{n}\) their respective corresponding norms. Here, our estimation results are measure in \(\|\cdot\|_{w,n}\) and under our assumptions in Section 3.1, it can be shown to be equivalent to the classic norm \(\|\cdot\|_{n}\).

2.2 Weighted Laplacian-Eigenmap based nonparametric regression↩︎

Following the ideas in [14] and [1], we propose the following principal components regression with the weighted Laplacian eigenmaps (PCR-WLE) algorithm:

  • For a given parameter \(\epsilon>0\) and a kernel function \(\eta\), construct the \(\epsilon\)-graph according to Section 2.1.

  • Construct the weighted Laplacian matrix given by 3 and take its eigendecomposition \(L_{w,n,\epsilon}=\sum_{i=1}^{n}\lambda_{i}v_{i}v_{i}^{T}\) with respect to \(\langle\cdot,\cdot\rangle_{w,n}\), where \((\lambda_i,v_i)\) are the eigenpairs with eigenvalues \(0=\lambda_1 \le \ldots\le \lambda_{n}\) in an ascending order and eigenvectors normalized to satisfy \(\|v_{i}\|_{w,n}=1\).

  • Project the response vector \(Y=(Y_1,\ldots,Y_{n})^{T}\) onto the space spanned by the first \(K\) eigenvectors, i.e., denote by \(V_{K}\in \mathbb{R}^{n\times K}\) the matrix with \(j\)-th column as \(V_{K,j}=v_{j}\) for \(j=1,\ldots,K\) and define \[\begin{align} \hat{f}:=V_{K}V_{K}^{T}Y, \end{align}\] as the estimator.

The entries of the vector \(\hat{f}\) are the in-sample values of the estimator of the regression function \(f\). [1] considered the special case of the above approach for the case when \((p, q, r) = (1, 2, 0)\) corresponding to the unnormalized graph Laplacian. Here, we consider the entire family of graph Laplaicans for various choices of the parameters \((p, q, r)\), the generalization from [2].

2.3 Weighted Laplacians and weighted Sobolev spaces↩︎

[2] presented a heuristic framework for the convergence of the weighted graph Laplacian \(L_{w,n,\epsilon}\) defined in 3 to the following weighted Laplace-Beltrami operators, in the large sample limit, in terms of the eigenvalues and eigenvectors/eigenfunctions: \[\label{weightedop} \left\{ \begin{align} &\mathcal{L}_{w}u:=-\frac{1}{2g^{p}}\text{div}\left(g^{q}\nabla\left(\frac{u}{g^{r}}\right) \right),\qquad\text{in}\;\mathcal{X},\\ &g^{q}\frac{\partial}{\partial n}\left(\frac{u}{g^{r}}\right)=0,\qquad\qquad\qquad\qquad\text{on}\;\partial \mathcal{X}. \end{align} \right.\tag{5}\] Special cases of this convergence, including convergences of \(L_u,L_{n},\) have been studied in [4], [36], [37] as mentioned before in Section 1.1. Although our focus is not directly on the convergence of the weighted Laplacians but on regression problems, we digress slightly to make the following remark. The proof arguments developed in our paper, in the context of regression rates, can be applied to show the convergence of the weighted Laplacians, thereby rigorously proving the heuristic idea in [2]. This could be accomplished by using the concentration properties of kernel density estimators from [3] when the domain is has no boundary, like we do in the context of regression rates. For domains with boundary is well-known that the convergence of the Laplacian matrices to the Laplacian operators is problematic at the boundary  [40].

The weighted Laplacian operators are a generalization of the classical Laplacian operator with different values of \(w=(p,q,r)\). Similar to the fact that the Laplacian operator is linked with the Sobolev space, the weighted Laplacian operators in 5 share a close connection with the following so-called weighted Sobolev spaces; see [41] for a general introduction. Define the weighted \(L^{2}\) space for \(\ell>0\) on \(\mathcal{X}\) with a density \(g\) as \[\begin{align} L^{2}(\mathcal{X},g^{\ell}):=\left\{u:\int_{\mathcal{X}}|u(x)|^{2}g(x)^{\ell}dx<\infty\right\}, \end{align}\] with inner product \[\begin{align} \langle u,v \rangle_{g^{\ell}}:=\int_{\mathcal{X}}u(x)v(x)g(x)^{\ell}dx. \end{align}\] Then, for \(w:=(p,q,r)\in\mathbb{R}^{3}\) and \(s\in \mathbb{N}_{+}\), we define the weighted Sobolev space as: \[\begin{align} H^{s}(\mathcal{X},g):=\left\{\frac{u}{g^{r}}\in L^{2}(\mathcal{X},g^{p+r}):\|u\|_{H^{s}(\mathcal{X},g)}<\infty\right\}, \end{align}\] where the weighted Sobolev norm \(\|u\|_{H^{s}(\mathcal{X},g)}\) is \[\begin{align} \|u\|_{H^{s}(\mathcal{X},g)}^{2}:=\sum_{j=1}^{s}|u|_{H^{j}(\mathcal{X},g)}^2+\left\|\frac{u}{g^{r}}\right\|_{L^{2}(\mathcal{X},g^{p+r})}^{2}, \end{align}\] with the \(j\)-th order semi-norm \(|\cdot|_{H^{j}(\mathcal{X},g)}\) defined as \[|u|_{H^{j}(\mathcal{X},g)}:=\sum_{|\alpha|=j}\left\|D^{\alpha}\left(ug^{-r}\right)\right\|_{L^{2}(\mathcal{X},g^{p})}\] and using multi-index notation with \(x=(x^{(1)},\ldots,x^{(d)})\in \mathbb{R}^{d},\) we have that \(D^{\alpha}f(x):=\partial^{|\alpha|}f/\partial (x^{(1)})^{\alpha_1}\ldots \partial (x^{(d)})^{\alpha_d}\) and \(|\alpha|=\alpha_1+\ldots+\alpha_{d}\). When \(g\) is uniform or \(r=0\) and \(g\) is bounded from above and below, the weighted Sobolev space \(H^{s}(\mathcal{X},g)\) becomes (or is equivalent to) the classic Sobolev space \(H^{s}(\mathcal{X})\). However, when \(f/g^{r}\) is \(s\)-times differentiable but \(f\) is not, the weighted Sobolev space differs from the classic Sobolev space. See [42] for more details regarding Sobolev spaces. For \(M>0\), the class of all functions \(u\) such that \(\|u\|_{H^{s}(\mathcal{X},g)}\le M\) is a weighted Sobolev ball \(H^{s}(\mathcal{X},g;M)\) of radius \(M.\)

Furthermore, we say a function \(u\in H^{s}(\mathcal{X},g)\) belongs to the zero-trace weighted Sobolev space \(H_{0}^{s}(\mathcal{X},g)\) if there exists a sequence \(u_1g^{-r},\ldots,u_{m}g^{-r}\) of \(C_{c}^{\infty}(\mathcal{X})\) functions such that \[\begin{align} \underset{m\rightarrow\infty}{\lim}\|u_{m}-u\|_{H^{s}(\mathcal{X},g)}=0, \end{align}\] where \(C_{c}^{\infty}(\mathcal{X})\) stands for the \(C^{\infty}\) functions with compact support contained in \(\mathcal{X}\).

Similar to the weighted Laplacian matrix \(L_{w,n,\epsilon}\), the weighted Laplacian operators 5 are self-adjoint with respect to the following weighted inner product ([2]): \[\begin{align} \langle u, v\rangle_{g^{p-r}}:=\int_{\mathcal{X}}u(x)v(x)g^{p-r}(x)dx. \end{align}\] Note the following connection between the weighted norms and inner products: \[\begin{align} \left\|\frac{u}{g^{r}}\right\|_{L^{2}(\mathcal{X},g^{p+r})}^{2}=\|u\|_{L^{2}(\mathcal{X},g^{p-r})}^{2}=\langle u,u\rangle_{g^{p-r}}. \end{align}\]

A simple example showing the dependency of the choice \(M\) on \(p,q,r\) is as follows. Suppose that \(u/g^{r}\) is the constant function equal to \(1\), say, and take \(s=1\). Then, we have \[\begin{align} \|u\|_{H^{1}(\mathcal{X},g)}^{2}=\int_{\mathcal{X}}g(x)^{p+r}dx. \end{align}\] Clearly, the power \(p+r\) of the density function \(g\) determines the size of the weighted Sobolev ball, and thus \(M\). In other words, say for example, assuming \(g\ge 1\) for simplicity, larger configurations of \(p+r\) will result in large weighted Sobolev norm, thus requiring a large norm parameter \(M\). For generic \(u/g^{r}\), the situation is more intricate and depends on the geomtry of \(u\) and \(g\) and choices of \(p+r\).

3 Main results↩︎

We now present our main results on adaptive and non-adaptive rates for estimating the regression function \(f\) as in 1 under some smoothness assumptions. Before that, we recall that the minimax estimation error over \(H^{s}(\mathcal{X};M)\), a standard Sobolev ball of radius \(M\), is given by \[\begin{align} \underset{\hat{f}}{\inf}\underset{f\in H^{s}(\mathcal{X};M)}{\sup}\|\hat{f}-f\|_{n}^{2}\asymp M^{2}(M^{2}n)^{-\frac{2s}{2s+d}}, \end{align}\] with high probability [43][45]. Moreover, there are other methods that can achieve the above minimax rate such as kernel smoothing, local polynomial regression, thin-plate splines, etc. In this context, [1] showed that PCR-WLE method with the unnormalized Laplacian1 \(L_{u}\) achieves the minimax rate, provided that \(n^{-1/2}\lesssim M\lesssim n^{s/d}\) under appropriate assumptions, where for two real-valued quantities, \(A,B\), the notation \(A \lesssim B\) means that there exists a constant \(C > 0\) not depending on \(f\), \(M\) or \(n\) such that \(A\le CB\) and \(A\asymp B\) stands for \(A\lesssim B\) and \(B\lesssim A\).

3.1 Assumptions↩︎

We now list the major assumptions that are needed for our theoretical results.

  • The distribution \(G\) is supported on \(\mathcal{X}\), which is an open, connected, and bounded subset of \(\mathbb{R}^{d}\) with Lipschitz boundary.

  • The distribution \(G\) has a density \(g\) on \(\mathcal{X}\) such that \[\begin{align} 0<g_{\min}\le g(x)\le g_{\max}<\infty,\;\text{for all}\;x\in \mathcal{X}, \end{align}\] for some \(g_{min},g_{\max}>0\). Additionally, \(g\) is Lipschitz on \(\mathcal{X}\) with Lipschitz constant \(L_{g}>0\).

  • The kernel \(\eta\) is a non-negative, monotonically non-decreasing function supported on the interval \([0,1]\) and its restriction on \([0,1]\) is Lipschitz and for convenience, we assume \(\eta(1/2)>0\) and define \[\begin{align} \sigma_{0}:=\int_{\mathbb{R}^{m}}\eta(\|x\|)dx,\quad \sigma_{1}:=\frac{1}{d}\int_{\mathbb{R}^{m}}\|y\|^{2}\eta(\|y\|)dy. \end{align}\] Without loss of generality, we will assume \(\sigma_0=1\) from now on.

  • The kernel \(\eta\) satisfies a kernel VC-type condition as follows. Let \[\begin{align} \mathscr{K}:=\left\{y\rightarrow \eta\left(\frac{x-y}{\epsilon}\right): \epsilon>0,x\in\mathbb{R}\right\} \end{align}\] be the collection of kernel functions indexed by \(x\) and \(\epsilon\). For a density \(\rho\), let the \(L^{2}(\mathcal{X},\rho)\)-covering number \(N(\epsilon, {\mathscr{K}}, \|\cdot\|_{L^{2}(\mathcal{X},\rho)})\) of \({\mathscr{K}}\) be the smallest number of \(L^{2}(\mathcal{X},\rho)\)-balls of radius \(\epsilon\) needed to cover \(\mathscr{K}\). With that we say that \(\eta\) satisfies the kernel VC-type condition if there exist constants \(A,\nu>0\) such that \[\begin{align} \label{VC} \sup_{\rho}~N(\zeta,\mathscr{K},\|\cdot\|_{L^{2}(\mathcal{X},\rho)})\le \left(\frac{A}{\zeta}\right)^{\nu}, \end{align}\tag{6}\] See Remark 2 for some examples.

Assumptions [a1] and [a2] are mild assumption on the density function, which are also made in [1]. In particular [a2] is important for us, as it gives us the norm equivalence between the various families of weighted Sobolev spaces. Assumption [a3] is a standard normalization condition made on the smoothing kernel, also made in [1]. Assumption [a4] is not used in [1]. It is used here because the general family of weighted Laplacian matrices that we work with involve kernel density estimation normalization, with which the normalization in 3 will not tend to either infinity or zero. Also note that in general condition \((\ref{VC})\) involves the \(L^{2}(\mathcal{X},\rho)\)-norm of an envelope function \(\eta_0\) for \(\mathscr{K}\), i.e. of a function \(\eta_0 \le h\) for all \(h \in \mathscr{K}\). Since, by our assumptions, \(\eta\) is bounded, we can use the maximum of \(\eta\) as an envelope, for which the \(L^{2}(\mathcal{X},\rho)\)-norm obviously does not depend on \(\rho\) and can thus be absorbed by the constant \(A\).

3.2 Non-adaptive rates↩︎

In the following, we present the non-adaptive minimax optimal rate of convergence of the PCR-WLE estimator in Section 2.2 for \(s=1\) and \(s>1\) separately. These rates are non-adaptive as the choice of \(K\) and \(\epsilon\) depends on unknown problem parameters, the smoothness parameter \(s\) and the norm parameter \(M\).

Theorem 1 (Non-adaptive minimax rate of PCR-WLE algorithm). Assume [a1]-[a4].

  • For \(s\in \mathbb{N}_{+}\backslash\{1\}\), assume \(f\in H_{0}^{s}(\mathcal{X},g;M)\), \(f\in H^{1}(\mathcal{X},g;M)\) and \(g\in C^{s-1}(\mathcal{X})\). Suppose there exist constants \(c_0,C_0>0\) such that \[\begin{align} \label{coneps} c_0\Bigg(\left(\frac{\log n}{n}\right)^{\frac{1}{d}}\vee &\;(M^{2}n)^{-\frac{1}{2(s-1)+d}}\Bigg)\le \,\epsilon \le C_0 K^{-\frac{1}{d}}, \nonumber\\[3pt] \text{\rm and}\nonumber\\[-10pt] &\sqrt{\frac{|\log \epsilon |}{n\epsilon^{d}}}\rightarrow 0, \end{align}\qquad{(1)}\] where \[\begin{align} \label{conK} K=\min\left\{\lfloor (M^{2}n)^{\frac{d}{2s+d}}\rfloor \vee 1,n\right\}. \end{align}\qquad{(2)}\] Then, there exist constants \(c,C>0\) not depending on \(f,M\) or \(n\) such that for \(n\) large enough and any \(0<\delta<1\), we have: \[\begin{align} \|\hat{f}-f\|_{w,n}^{2}\le C\big\{\big(\delta^{-1}M^2(M^2n)^{-\frac{2s}{2s+d}}\wedge 1\big) \vee {n^{-1}}\big\}, \end{align}\] with probability at least \(1-\delta-Cne^{-cn\epsilon^{d}}-e^{-K}\).

  • For \(s=1\), assume \(f\in H^{1}(\mathcal{X},g;M)\). Suppose there exist constants \(c_0,C_0>0\) such that \[\begin{align} c_0\left(\frac{\log n}{n}\right)^{\frac{1}{d}}&\le \epsilon \le C_0 K^{-\frac{1}{d}}, \end{align}\] and ?? , where \(K\) is given in ?? for \(s=1\). Then, the assertion in part (a) also holds for \(s=1\).

Remark 1. Notably, the above theorems do not require the assumption that \(s>d/2\). As we mentioned before in Section 2.2, this condition is commonly appeared in the literature as in the sub-critical regime, i.e., \(s\le d/2\), the (weighted) Sobolev space \(H^{s}\) is not a Reproducing Kernel Hilbert Space (RKHS) and cannot be continuously embedded into the space of continuous functions \(C^{0}(\mathcal{X})\). Theorem 1 highlights the point that PCR-WLE algorithm obtains the minimax optimal rate when \(n^{-1/2}\lesssim M\lesssim n^{s/d}\) and the error is measured by the weighted empirical norm \(\|\cdot\|_{w,n}\).

Remark 2. The kernel VC-type condition was first proposed in [3]. A simple sufficient condition for this condition to hold is that \(\eta\) is of bounded variation; see [46] or [47]. Clearly, many common kernels are of this type, including Gaussian, Epanechnikov and cosine kernels.

Remark 3. For practical consideration, there are two tuning parameters: the graph radius (the bandwidth for the kernel \(\eta\)) \(\epsilon\) and the number of eigenvalues \(K\). The lower bound for \(\epsilon\) makes sure that with this smallest radius, the resulting weighted graph will still be connected with high probability and the upper bound for \(\epsilon\) ensures the eigenvalue of the weighted graph Laplacian 3 to be of the same order as its continuum version, the eigenvalue of the weighted Laplacian operator 5 (Weyl’s law). The asymptotic assumption on \(\epsilon\) is from the concentration of the KDE. The condition on \(K\) is set to trade-off bias and variance. Both \(\epsilon\) and \(K\) depend on the true smoothness parameter \(s\in\mathbb{N}_{+}\).

3.3 Adaptive rates via Lepski’s method↩︎

Despite the minimax optimality of the PCR-WLE algorithm shown in Section 3.2, the main practical difficulties are the choice of several tuning parameters including the bandwidth parameter (or the graph radius) \(\epsilon\) and the number of eigenvalues \(K\), because optimal choices depend on the unknown true smoothness parameter \(s\) of the regression function \(f\) in the model 1 . Moreover, \(K\) also relies on the bound of the weighted Sobolev norm \(M\). This naturally brings about the issue of adaptation, which we address using Lepski’s method. Note that, as we are concerned with in-sample estimation error, other techniques like cross-validation are not directly applicable to set the tuning parameters.

Since its introduction in [48], Lepski’s method has been widely used for adaptive estimation and testing in various statistical contexts; e.g. see [39], [49][52]. In the following, we consider Lepski’s method on the product space of the smoothness parameter \(s\in\mathbb{N}_{+}\) and the constraint on the weighted Sobolev norm \(M\in \mathbb{R}_{+}\).

Recall that \(s\) and \(M\) denote the true smoothness parameter and the norm parameter, respectively for the weighted Sobolev norm of \(f\). Here, we actually take \(M\) as the minimum over all bounds of the weighted Sobolev norm. We start by picking \(s_{\min},s_{\max} \in \mathbb{N}_{+}\); here we can set \(s_{\min}=1\) under no availability of further information2 regarding the knowledge of \(s\). The goal is that \(s_{\max}\) is large enough that \(s\in\mathbb{N}_{+}\) satisfies \(s\in[s_{\min},s_{\max}]\). Similarly, we pick \(M_{\min},M_{\max}\) satisfying \(0<M_{\min}<M_{\max}<\infty\), where \(M_{\min}\) and \(M_{\max}\) are small and large enough respectively such that \(M\in [M_{\min},M_{\max}]\). Next, define the grid \(\mathcal{B}\times \mathcal{D}:=\{(s_j,M_j)\}_{j=1}^{N_l}\) given by: \[\begin{align} \label{eq:sinterval} \begin{aligned} \mathcal{B}\mathrel{\vcenter{:}}=[s_{\min},s_{\max}]\cap \mathbb{N}_{+} =\{s_{\min}=:s_1<s_2<\ldots<s_{N_{l}}:=s_{\max}\}, \end{aligned} \end{align}\tag{7}\] and \[\begin{align} \mathcal{D}\mathrel{\vcenter{:}}=[M_{\min},M_{\max}]=\{M_{\min}=:M_1<M_2<\ldots<M_{N_{l}}:=M_{\max}\}, \end{align}\] where \(N_{l}\asymp \log n\).

For any pair \((\tilde{s},\tilde{M})\) in the above grid, let \(\hat{f}_{\tilde{s},\tilde{M}}\) be the PCR-WLE estimator in Section 2.2 corresponding to the parameters \(\tilde{s}\) and \(\tilde{M}\). We define the Lepski’s estimator as \[\begin{align} \hat{f}_{\mathsf{adapt}}:=\hat{f}_{\hat{s},\hat{M}}, \end{align}\] where \(\hat{s}\) is given by \[\begin{align} \hat{s}:=\max \{\tilde{s}\in \mathcal{B}: \|\hat{f}_{\tilde{s},\tilde{M}}-\hat{f}_{\tilde{s}',\tilde{M}'}\|_{w,n} \le c_0 \tilde{M}'((\tilde{M}'^2 n/\log n)^{-\frac{\tilde{s}'}{2\tilde{s}'+d}}\;,\forall \tilde{s}'\le \tilde{s}, \tilde{s}'\in\mathcal{B}\}, \end{align}\] and \(\hat{M}\) is the corresponding couple of \(\hat{s}\) in the grid, where \(c_0>0\) is some finite constant. Here, we formulate the above simultaneous Lepski’s method by coupling the smoothness parameter and the norm parameter and only maximize through the smoothness parameter instead of dealing with a joint maximization, which is not needed for our purpose of showing the adaptive minimax rate in the following result as our focus is its convergence rate in \(n\).

The following result presents a near minimax optimal rate of convergence of the Lepski’s estimator \(\hat{f}_\mathsf{adapt}\) up to a logarithmic factor in \(n\).

Theorem 2. Assume [a1]-[a4] and \(g\in C^{s-1}(\mathcal{X})\). Also, assume \(f\in H^{1}(\mathcal{X},g;M) \cap H_{0}^{s}(\mathcal{X},g;M)\) and \(f_g:=f/g^r\) is \(M\)-Lipschitz, i.e., \(\|f_{g}(x)-f_{g}(x')\|\le M\|x-x'\|\) for any \(x,x'\in \mathcal{X}\). Furthermore, assume that (for large enough \(n\)) we have \(s \in [s_{\min},s_{\max}]\) and \(M \in [M_{\min},M_{\max}].\) Then, under the minimax optimal setting in Theorem 1 for \(M\), i.e., \(n^{-1/2}\lesssim M\lesssim n^{s/d}\), the estimator \(\hat{f}_{\mathsf{adapt}}\) satisfies: For \(n\) large enough and any \(\delta\in (0,1)\), there exists some constant \(C>0\) such that \[\begin{align} \|\hat{f}_{\mathsf{adapt}} -f\|_{w,n}^{2}\le C\delta^{-1}M^2(M^2n/\log n)^{-\frac{2s}{2s+d}}, \end{align}\] with probability at least \[\begin{align} 1-\delta \log^{-\frac{2s}{(2s+d)}}n -Cn e^{-Cn\epsilon^{d}}\log^2 n -16C c_0^{-4} n^{-1}\log^{2-\frac{2s_{\min}}{(2s_{\min}+d)}} n-e^{-\lfloor M_{\min}^2 n \rfloor^{\frac{d}{(2s+d)}}}\log^2 n. \end{align}\]

Remark 4. [22] proposed a graph poly-Laplacian regularization approach, where integer powers of the Laplacian matrices are used as regularization in a least-squares context. They showed that the proposed method achieves rate of convergence of order \(n^{-s/(d+4s)}\). While the rate is not optimal, in comparison to the [1] their estimator does not require the knowledge of the norm parameter \(M\) to achieve the derived rate (although they require the knowledge of \(s\)). In comparison to both the above works, our result in Theorem 2 achieves the optimal rate, up to \(\log\) factors, without requiring the knowledge of either \(s\) or \(M\).

Remark 5. As a part of our proof, a better concentration inequality for the non-adaptive PCR-WLE estimator \(\hat{f}\) is required compared to Theorem 1, for which the assumption that \(f_g\) is Lipschitz is required. As also discussed in [1], it remains open whether a weaker assumption or even the weighted Sobolev condition \(\|\nabla f_g\|_{L^{2}}<\infty\) alone might be sufficient establish the required concentration result for developing adaptive procedures.

4 PROOF↩︎

4.1 Proof of Theorem 1↩︎

In this section, we will prove both Theorem 1 for \(s=1\) and \(s>1\) together. We first present and prove some auxiliary lemmas. We will denote by \(B_x(r)\) a closed Euclidean ball with midpoint \(x\) and radius \(r\ge 0\).

Define the weighted Sobolev seminorm \(\langle L_{w,\epsilon}f,f\rangle_{g^{p-r}}\) given by the following non-local operator: \[\begin{align} L_{w,\epsilon}f(x):=\frac{1}{\epsilon^{d+2}}\int_{\mathcal{X}}g(x)^{1-p}\frac{\eta\big(\frac{\|x-z\|}{\epsilon}\big)}{g(x)^{1-q/2}g(z)^{1-q/2}}(g(x)^{-r}f(x)-g(z)^{-r}f(z))g(z)dz, \end{align}\] where according to 4 , \(L_{w,\epsilon}\) can be viewed as a population counterpart of the discrete graph weighted Laplacian \(L_{w,n,\epsilon}\). As in [1], we also call it a ‘non-local’ version. Note that the above non-local weighted Sobolev seminorm and non-local operator generalize the definitions in [1] as the latter belong to a special case when \((p,q,r)=(1,2,0)\). The following Lemmas 1-6 therefore extend their counterparts in [1] to the weighted Laplacians and the weighted Sobolev seminorm. Note that in our proofs, we also highlight and fix several important typos and errors that appeared in [1]. Despite the errors, the final results in [1] remain true.

Lemma 1. For \(f\in H^{1}(\mathcal{X},g;M)\), we have \[\begin{align} \langle L_{w,\epsilon}f,f\rangle_{g^{p-r}}\lesssim M^{2}. \end{align}\]

Proof of Lemma 1. Following the idea of [19], take \(\Omega\) as an arbitrary bounded open set such that \(B_{x}(c_0)\subseteq \Omega\) for all \(x\in\mathcal{X}\) for some \(c_0>0\) and we can assume that \(f\in H^{1}(\Omega,g)\) and \(\|f\|_{H^{1}(\Omega,g)}\lesssim \|f\|_{H^{1}(\mathcal{X},g)}\) without loss of generality due to the existence of an extension operator \(E:H^{1}(\mathcal{X},g)\rightarrow H^{1}(\Omega,g)\) such that \(Ef\) satisfies these properties, see Theorem 1 in Chapter 5.4 in [42]. Also, since \(C^{\infty}(\Omega)\) is dense in \(H^{1}(\Omega,g)\) and the integral in Lemma 1 is continuous in \(H^{1}(\Omega,g)\), we can assume \(f_{g}:=f/g^{r}\in C^{\infty}(\Omega)\) so that \[\begin{align} f_{g}(x')-f_{g}(x)=\int_{0}^{1}\nabla f_{g}(x+t(x'-x))^{T}(x'-x)dt. \end{align}\] Then, we have by symmetry in the first step: \[\begin{align} \label{s1decomp} &2\langle L_{w,\epsilon}f,f\rangle_{g^{p-r}} \nonumber\\&=\frac{1}{\epsilon^{d+2}}\int_{\mathcal{X}}\int_{\mathcal{X}}\frac{\eta\left(\frac{\|x-y\|}{\epsilon}\right)}{g(x)^{1-q/2}g(y)^{1-q/2}}\left|\frac{f(x)}{g(x)^{r}}-\frac{f(y)}{g(y)^{r}}\right|^{2}g(x)g(y)dxdy\nonumber\\&=\frac{1}{\epsilon^{d+2}}\int_{\mathcal{X}}\int_{\mathcal{X}}\frac{\eta\left(\frac{\|x-y\|}{\epsilon}\right)}{g(x)^{1-q/2}g(y)^{1-q/2}}\left(\int_{0}^{1}\nabla f_{g}(y+t(x-y))^{T}(x-y)dt\right)^{2}g(x)g(y)dxdy\nonumber\\&\le \frac{1}{\epsilon^{d+2}}\int_{\mathcal{X}}\int_{\mathcal{X}}\int_{0}^{1}\frac{\eta\left(\frac{\|x-y\|}{\epsilon}\right)}{g(x)^{1-q/2}g(y)^{1-q/2}}\left(\nabla f_{g}(y+t(x-y))^{T}(x-y)\right)^{2}g(x)g(y)dtdxdy\nonumber\\&\le \int_{\mathcal{X}}\int_{B_{\mathbf{0}}(1)}\int_{0}^{1}\left(\nabla f_{g}(y+\epsilon tz)^{T}z\right)^{2}\frac{\eta(\|z\|)}{g(y+\epsilon z)^{1-q/2}g(y)^{1-q/2}}g(y+\epsilon z)g(y)dtdzdy,\nonumber\\&\qquad \text{with}\;(x-y)/\epsilon=z\nonumber\\&\lesssim \int_{\mathcal{X}}\int_{B_{\mathbf{0}}(1)}\int_{0}^{1}\left(\nabla f_{g}(y+\epsilon tz)^{T}z\right)^{2}\eta(\|z\|)g(y+\epsilon tz)^{q}dtdzdy\nonumber\\&\le \int_{\Omega}\int_{B_{\mathbf{0}}(1)}\int_{0}^{1}\left(\nabla f_{g}(\tilde{y})^{T}z\right)^{2}\eta(\|z\|)g(\tilde{y})^{q}dtdzd\tilde{y},\quad \tilde{y}=y+\epsilon tz\in \Omega. \end{align}\tag{8}\] Since we have \(\left(\nabla f_{g}(\tilde{y})^{T}z\right)^{2}=\left(\sum_{i=1}^{d}(\nabla f_{g}(\tilde{y}))^{(i)}z^{(i)}\right)^{2}\) and \(\eta(\|z\|)\) is invariant with respect to the rotation, it yields that \[\begin{align} \label{s1decomppart} \int_{B_{\mathbf{0}}(1)}\left(\nabla f_{g}(\tilde{y})^{T}z\right)^{2}\eta(\|z\|)dz&=\sum_{i,j=1}^{d}(\nabla f_{g}(\tilde{y}))^{(i)}(\nabla f_{g}(\tilde{y}))^{(j)}\int_{B_{\mathbf{0}}(1)}z^{(i)}z^{(j)}\eta(\|z\|)dz\nonumber\\&=\sum_{i=1}^{d}\left((\nabla f_{g}(\tilde{y}))^{(i)}\right)^{2}\int_{B_{\mathbf{0}}(1)}\left(z^{(i)}\right)^{2}\eta(\|z\|)dz\nonumber\\&=\sigma_{1}\left\|\nabla\left(\frac{f(\tilde{y})}{g(\tilde{y})^{r}}\right)\right\|^{2}. \end{align}\tag{9}\] Plugging 9 in 8 , we conclude \[\begin{align} 2\langle L_{w,\epsilon}f,f\rangle_{g^{p-r}}\lesssim \sigma_1M^{2}. \end{align}\] This finishes the proof. ◻

Note that the proof of Lemma 1 also utilized the heuristic arguments given in [2] while we provide a rigorous proof here.

Lemma 2. Suppose \(f_{g}\in L^{2}(\mathcal{U},g^{p+r};M)\) for a Borel set \(\mathcal{U}\subseteq \mathcal{X}\). Then, there exists a constant \(C\) which does not depend on \(f\) or \(M\) such that \[\begin{align} \|L_{w,\epsilon}f\|_{L^{2}(\mathcal{U},g^{p+r})}\le \frac{C}{\epsilon^{2}}\|f_{g}\|_{L^{2}(\mathcal{U},g^{p+r})}. \end{align}\]

Proof. By Cauchy-Schwarz inequality, we have \[\begin{align} |L_{w,\epsilon}f(x)|^2&=\frac{1}{\epsilon^{2(d+2)}}\left(\int_{\mathcal{U}}g(x)^{1-p}\frac{\eta\left(\frac{\|x-z\|}{\epsilon}\right)}{g(x)^{1-q/2}g(z)^{1-q/2}}(g(x)^{-r}f(x)-g(z)^{-r}f(z))g(z)dz\right)^{2}\\&\lesssim \frac{1}{\epsilon^{2(d+2)}}g(x)^{2(1-p)}\int_{\mathcal{U}}\frac{\eta\left(\frac{\|x-z\|}{\epsilon}\right)}{g(x)^{1-q/2}g(z)^{1-q/2}}(f_{g}(x)-f_{g}(z))^2dz\cdot\int_{\mathcal{X}}\frac{\eta\left(\frac{\|x-z\|}{\epsilon}\right)}{g(x)^{1-q/2}g(z)^{1-q/2}}dz\\&\lesssim \frac{2\sigma_0}{\epsilon^{4+d}}g(x)^{2(q-p)}\int_{\mathcal{U}}\eta\left(\frac{\|x-z\|}{\epsilon}\right)(|f_{g}(x)|^2+|f_{g}(z)|^2)dz. \end{align}\] Then, we have \[\begin{align} \|L_{w,\epsilon}f\|_{L^{2}(\mathcal{U},g^{p+r})}^{2}&=\int_{\mathcal{U}}g^{p-r}(x)|L_{w,\epsilon}f(x)|^{2}dx\\&\lesssim \frac{2}{\epsilon^{4+d}}\int_{\mathcal{U}}\int_{\mathcal{U}}g(x)^{2(q-p)+p-r}(x)\eta\left(\frac{\|x-z\|}{\epsilon}\right)(|f_{g}(x)|^2+|f_{g}(z)|^2)dzdx\\&\lesssim \frac{2}{\epsilon^{4+d}}\int_{\mathcal{U}}\int_{\mathcal{U}}\eta\left(\frac{\|x-z\|}{\epsilon}\right)(|f_{g}(x)|^2+|f_{g}(z)|^2)dzdx\\&\lesssim \frac{4}{\epsilon^{4+d}}\int_{\mathcal{U}}\int_{\mathcal{U}}\eta\left(\frac{\|x-z\|}{\epsilon}\right)|f_{g}(x)|^2dzdx\\&\le \frac{4}{\epsilon^{4}}\int_{\mathcal{U}}|g(x)^{p+r}(x)f_{g}(x)|^2dx\\&\lesssim \frac{4}{\epsilon^{4}}\|f_{g}\|_{L^{2}(U,g^{p+r})}^{2} \end{align}\] ◻

Lemma 3. Suppose \(f_{g}\in L^{2}(\mathcal{U},g^{p+r};M)\) for a Borel set \(\mathcal{U}\subseteq \mathcal{X}\). Then, there exists a constant \(C>0\) such that \[\begin{align} E_{w,\epsilon}(f;\mathcal{U})\le \frac{C}{\epsilon^{2}}\|f_{g}\|_{L^{2}(\mathcal{U},g^{p+r})}^{2}, \end{align}\] where we define the Dirichlet energy for the set \(\mathcal{U}\) as \[\begin{align} E_{w,\epsilon}(f,\mathcal{U})&:=\frac{1}{\epsilon^{d+2}}\int_{\mathcal{U}}\int_{\mathcal{U}}(g(x)^{-r}f(x)-g(z)^{-r}f(z))^2\frac{\eta\left(\frac{\|x-z\|}{\epsilon}\right)}{g(x)^{1-q/2}g(z)^{1-q/2}}g(x)g(z)dxdz. \end{align}\]

Proof. Note that \[\begin{align} E_{w,\epsilon}(f;\mathcal{U})&=\frac{1}{\epsilon^{d+2}}\int_{\mathcal{U}}\int_{\mathcal{U}}(g(x)^{-r}f(x)-g(z)^{-r}f(z))^2\frac{\eta\left(\frac{\|x-z\|}{\epsilon}\right)}{g(x)^{1-q/2}g(z)^{1-q/2}}g(x)g(z)dxdz\\&\le \frac{2}{\epsilon^{d+2}}\int_{\mathcal{U}}\int_{\mathcal{U}}(|g(x)^{-r}f(x)|^2+|g(z)^{-r}f(z)|^2)\frac{\eta\left(\frac{\|x-z\|}{\epsilon}\right)}{g(x)^{1-q/2}g(z)^{1-q/2}}g(x)g(z)dxdz\\&= \frac{4}{\epsilon^{d+2}}\int_{\mathcal{U}}\int_{\mathcal{U}}|g(x)^{-r}f(x)|^2\eta\left(\frac{\|x-z\|}{\epsilon}\right)g(x)^{q/2}g(z)^{q/2}dxdz\\&\lesssim \frac{4}{\epsilon^{d+2}}\int_{\mathcal{U}}\int_{\mathcal{U}}|g(x)^{-r}f(x)|^2\eta\left(\frac{\|x-z\|}{\epsilon}\right)g(x)^{p+r}dxdz\\&\lesssim \frac{4}{\epsilon^{2}}\int_{\mathcal{U}}|g(x)^{-r}f(x)|^2g(x)^{p+r}dx. \end{align}\] ◻

We denote by \(\mathcal{X}_{t\epsilon}\) a subset of \(\mathcal{X}\) such that for any \(x\in \mathcal{X}_{t\epsilon}\), \(B_{x}(t\epsilon)\in \mathcal{X}\) consisting of points sufficiently far away from the boundary and \(\partial_{t\epsilon} \mathcal{X}\) by its complement within \(\mathcal{X}\) consisting of points close enough to the boundary.

Lemma 4. For \(f\in H^{1}(\mathcal{X},g;M)\cap H_{0}^{s}(\mathcal{X},g;M)\) with \(s\in\mathbb{N}_{+}\) and \(g\in C^{s-1}(\mathcal{X})\), there exist constants \(C_1,C_2>0\) such that

  • If \(s\) is odd, then we have with \(t=(s-1)/2\): \[\begin{align} \|L_{w,\epsilon}^{t}f-\sigma_1^{t}\mathcal{L}_{w}^{t}f\|_{L^{2}(\mathcal{X}_{t\epsilon},g^{p+r})}\le C_1 M\epsilon. \end{align}\]

  • If \(s\) is even, then we have with \(t=(s-2)/2\): \[\begin{align} \|L_{w,\epsilon}^{t}f-\sigma_1^{t}\mathcal{L}_{w}^{t}f\|_{L^{2}(\mathcal{X}_{t\epsilon},g^{p+r})}\le C_2 M\epsilon^{2}. \end{align}\]

Proof. Without loss of generality, we assume both \(g\) and \(f\) are \(C^{\infty}(\mathcal{X})\) due to the fact that \(C^{\infty}(\mathcal{X})\) is dense in both \(H^{s}(\mathcal{X},g)\) and \(C^{s-1}(\mathcal{X})\) and the norm in the statements is continuous with respect to \(\|\cdot\|_{H^{s}(\mathcal{X},g)}\) and \(\|\cdot\|_{C^{s-1}(\mathcal{X})}\).

Actually, we claim the following stronger result: for \(t<s/2\) and every \(x\in \mathcal{X}_{t\epsilon}\), \[\begin{align} \label{inter} L_{w,\epsilon}^{t}f(x)=\sigma_1^{t}\mathcal{L}_{w}f(x)+ \sum_{j=1}^{\lfloor (s-1)/2\rfloor-t}r_{2(j+t)}(x)\epsilon^{2j}+r_{s}(x)\epsilon^{s-2t}, \end{align}\tag{10}\] for some functions \(r_{j}\) such that \[\begin{align} \label{rjbound} \|r_j\|_{H^{s-j}(\mathcal{X}_{t\epsilon},g)}\le C\|g\|_{C^{s-1}(\mathcal{X})}^{t}M. \end{align}\tag{11}\] Note that the dependence of the functions \(r_{j}\) on \(t\) is suppressed in the notation.

The key idea underlying the proof of (10 ) is to consider the following Taylor expansion. For an \(s\)-times differentiable function \(F:\mathcal{X}\rightarrow \mathbb{R}\) and \(x\in\mathcal{X}\), define the following operator \(d_{x}^{s}\): \[\begin{align} (d_{x}^{s}F)(z):=\sum_{|\alpha|=s}D^{\alpha}F(x)z^{\alpha}. \end{align}\] Also, define \(d^{s}F:=\sum_{|\alpha|=s}D^{\alpha}F\). Then, for \(\phi\in C^{s}(\mathcal{X})\) and some \(h>0\), \(z\in\mathcal{X}_{h}\), \(x\in B_{z}(h)\), the Taylor expansion at \(z\) is given as: \[\begin{align} \phi(x)=\phi(z)+\sum_{j=1}^{s-1}\frac{1}{j!}(d_{x}^{j}\phi)(x-z)+R_{s}(x,z;\phi). \end{align}\] Here, we note that \((d_{x}^{j}\phi)(z)\) is a polynomial of degree \(j\) and we have for any \(y\in\mathbb{R}\): \[\begin{align} (d_{x}^{j}\phi)(yz)=y^j (d_{x}^{j}\phi)(z). \end{align}\] The remainder term \(R_{j}(x,z;\phi)\) is \[\begin{align} R_{j}(x,z;\phi):=\frac{1}{(j-1)!}\int_{0}^{1}(1-\theta)^{j-1}(d_{z+\theta(x-z)}^{j}\phi)(x-z)d\theta, \end{align}\] such that for any \(x^{*}\in B_{\mathbf{0}}(1)\), \[\begin{align} \underset{x\in\mathcal{X}_{h}}{\sup}|R_{j}(x,x+hx^{*};\phi)|\le Ch^{j}\|\phi\|_{C^{j}(\mathcal{X})}, \end{align}\] and \[\begin{align} \int_{\mathcal{X}_{h}}|R_{j}(z+\theta hx,z;\phi)|^{2}dz\le h^{2j}\int_{\mathcal{X}_{h}}\int_{0}^{1}|(d_{z+\theta hx}^{j}\phi)(z)|^{2}d\theta dz\le h^{2j}\|d^{j}\phi\|_{L^{2}(\mathcal{X})}^{2}. \end{align}\]

Now, we apply the above Taylor expansion on the function \(f_{g}(x):=f(x)/g(x)^{r}\) up to order \(s\) and the function \(g^{q/2}(x)\) up to order \(S\) in \(L_{w,\epsilon}f(x)\), where \(S=1\) if \(s=1\) and otherwise \(S=s-1\) and obtain: \[\begin{align} L_{w,\epsilon}f(x)&=\frac{1}{\epsilon^{d+2}}\sum_{j_1=1}^{s-1}\sum_{j_2=0}^{S-1}\frac{1}{j_1!j_2!}\int_{\mathcal{X}}g(x)^{q/2-p}\eta\left(\frac{\|x-z\|}{\epsilon}\right)(d_{x}^{j_1}f_{g})(x-z)(d_{x}^{j_2}g^{q/2})(z-x)dz\\&+\frac{1}{\epsilon^{d+2}}\sum_{j=1}^{s-1}\frac{1}{j!}\int_{\mathcal{X}}g(x)^{q/2-p}\eta\left(\frac{\|x-z\|}{\epsilon}\right)(d_{x}^{j_1}f_{g})(x-z)R_{S}(x,z;g^{q/2})dz\\&+\frac{1}{\epsilon^{d+2}}\int_{\mathcal{X}}g(x)^{p/2-p}\eta\left(\frac{\|x-z\|}{\epsilon}\right)R_{s}(x,z;f_g)g(z)^{q/2}dz. \end{align}\] Now, with the transformation \(y=(z-x)/\epsilon\), we have \[\begin{align} L_{w,\epsilon}f(x)&=-\frac{1}{\epsilon^{2}}\sum_{j_1=1}^{s-1}\sum_{j_2=0}^{S-1}\frac{\epsilon^{j_1+j_2}}{j_1!j_2!}\int_{B_{\mathbf{0}}(1)}g(x)^{q/2-p}\eta\left(\|y\|\right)(d_{x}^{j_1}f_{g})(y)(d_{x}^{j_2}g^{q/2})(y)dy\\&-\frac{1}{\epsilon^{2}}\sum_{j=1}^{s-1}\frac{\epsilon^{j}}{j!}\int_{B_{\mathbf{0}}(1)}g(x)^{q/2-p}\eta\left(\|y\|\right)(d_{x}^{j_1}f_{g})(y)R_{S}(x,\epsilon y+x;g^{q/2})dy\\&+\frac{1}{\epsilon^{2}}\int_{B_{\mathbf{0}}(1)}g(x)^{p/2-p}\eta\left(\|y\|\right)R_{s}(x,\epsilon y+x;f_g)g(\epsilon y+x)^{q/2}dy\\&=:L_{1}(x)+L_{2}(x)+L_{3}(x). \end{align}\] We will now prove 10 by induction on \(t,\) and throughout this proof, with a slight abuse of notation, the functions \(r_{j}\) in 10 may vary from line to line depending on \(t\) at the induction step but they will always satisfy the condition 11 as we are only interested in the bounds.

Firstly, we start with \(L_{1}(x)\). If \(s=1\), we can see \(L_{1}(x)=0\). Therefore, in the following, we only focus on \(s\ge 2\). Now, we define \[\begin{align} l_{j_1,j_2}(x):=\int_{B_{\mathbf{0}}(1)}g(x)^{q/2-p}\eta(\|y\|)(d_{x}^{j_1}f_{g})(y)(d_{x}^{j_2}g^{q/2})(y)dy, \end{align}\] such that \[\begin{align} L_{1}(x)=-\frac{1}{\epsilon^{2}}\sum_{j_1=1}^{s-1}\sum_{j_2=0}^{S-1}\frac{\epsilon^{j_1+j_2}}{j_1!j_2!}l_{j_1,j_2}(x). \end{align}\] Since \((d_{x}^{j}f_{g})(y)\) is a polynomial of degree \(j\), \(l_{j_1,j_2}\) actually depends on the sum \(j_1+j_2\) and \(d_{x}^{j_1}d_{x}^{j_2}\) is an order \(j_1+j_2\) multivariate monomial. Therefore, when \(j_1+j_2\) is odd, we have \[\begin{align} l_{j_1,j_2}(x)=0. \end{align}\] Then, when \(s=2\), we have \(j_1+j_2=1\) and \(L_{1}(x)=0\). As for \(s\ge 3\), we notice that the lowest order term of \(L_{11}(x)\) is from \(j_1+j_2=2\), which means either \(j_1=1,j_2=1\) or \(j_1=2,j_2=0\). We have \[\begin{align} l_{1,1}(x)&=\int_{B_{\mathbf{0}}(1)}g(x)^{q/2-p}\eta(\|y\|)(d_{x}^{1}f_{g})(y)(d_{x}^{1}g^{q/2})(y)dy\\&=\sum_{i_1=1,i_2=1}^{d}g(x)^{q/2-p}(Df_{g}(x))^{(i_1)}(Dg^{q/2}(x))^{(i_{2})}\int_{B_{\mathbf{0}}(1)}\|y\|^{2}\eta(\|y\|)dy, \end{align}\] and \[\begin{align} \frac{1}{2}l_{2,0}(x)&=\frac{1}{2}\int_{B_{\mathbf{0}}(1)}g(x)^{q/2-p}\eta(\|y\|)(d_{x}^{2}f_{g})(y)(d_{x}^{2}g^{q/2})(y)dy\\&\\&=\frac{1}{2}\sum_{i=1}^{d}g(x)^{q/2-p}((Df_{g}(x))^{(i)})^{2}g(x)^{q/2}\int_{B_{\mathbf{0}}(1)}\|y\|^{2}\eta(\|y\|)dy. \end{align}\] Therefore, we have by definition: \[\begin{align} \mathcal{L}_{w}f(x)=-\frac{1}{2g(x)^{p}}\left(\nabla g(x)^{q}\cdot \nabla\left(\frac{f(x)}{g(x)^{r}}\right)+g(x)^{q}\Delta\left(\frac{f(x)}{g(x)^{r}}\right)\right), \end{align}\] and \[\begin{align} -(l_{1,1}(x)+\frac{1}{2}l_{2,0}(x))=\sigma_1\mathcal{L}_{w}f(x). \end{align}\] This is exactly the leading term. We remark here that in [1], the negative sign is missing, which does not actually give the Laplacian operator by the leading term. Now, it remains to bound the higher order terms with \(j_1+j_2>2\). We will show that \[\begin{align} L_{1}(x)=\sigma_1\mathcal{L}_{w}+\sum_{j=1}^{\lfloor (s-1)/2\rfloor-1}r_{2(j+1)}(x)\epsilon^{2j}+r_{s}(x)\epsilon^{s-2}. \end{align}\] It suffices to show for \(j_1+j_2>2\), \(l_{j_1,j_2}\) satisfies 11 for \(j=\min\{j_1+j_2-2,s-2\}\). Through the multi-index notation, we write that \[\begin{align} l_{j_1,j_2}(x)=g(x)^{q/2-p}\sum_{|\alpha_1|=j_1,|\alpha_2|=j_2}D^{\alpha_1}f_g(x)D^{\alpha_2}g^{q/2}(x)\int_{B_{\mathbf{0}}(1)}y^{\alpha_1}y^{\alpha_2}\eta(\|y\|)dy, \end{align}\] where \(|\int_{B_{\mathbf{0}}(1)}y^{\alpha_1}y^{\alpha_2}\eta(\|y\|)dy|<\infty\) for all \(\alpha_1,\alpha_2\). Then, by Hölder’s inequality, we have for \(|\alpha_1|=j_1\), \(|\alpha_{2}|=j_2\), \[\begin{align} \|g(x)^{q/2-p}D^{\alpha_1}f_g D^{\alpha_2}g^{q/2}\|_{H^{s-(j+2)}(\mathcal{X},g)}&\lesssim \|D^{\alpha_1}f_g \|_{H^{s-(j+2)}(\mathcal{X},g)}\|g(x)^{q/2-p}D^{\alpha_2}g^{q/2}\|_{C^{s-(j+2)}(\mathcal{X})}\\&\lesssim \|D^{\alpha_1}f_g \|_{H^{s-j_1}(\mathcal{X},g)}\|D^{\alpha_2}g^{q/2}\|_{C^{s-(j_2+1)}(\mathcal{X})}\\&\le M\|g\|_{C^{s-1}}. \end{align}\] Summing over all \(|\alpha_1|=j_1\) and \(|\alpha_2|=j_2\), we obtain that \(l_{j_1,j_2}\) satisfies 11 .

Next, as for \(L_2(x)\), note that if \(s=1\), \(L_{2}(x)=0\). We want to show that for \(s\ge 2\), \[\begin{align} \|L_{2}\|_{L^{2}(\mathcal{X}_{\epsilon},g^{p+r})}\le C\epsilon^{s-2}M\|g\|_{C^{s-1}(\mathcal{X})}. \end{align}\] Clearly, if \(s=1\), \(L_2(x)=0\). Now, for \(s\ge 2\), we have \(S=s-1\) and since \(|R_{s-1}(x,x+\epsilon x^{*})|\le C\epsilon^{s-1}\|g\|_{C^{s-1}(\mathcal{X})}\) for any \(x^{*}\in B_{\mathbf{0}}(1)\) and \(d_{x}^{j}(\cdot)\) is a \(j\)-homogeneous function, we have \[\begin{align} |L_{2}(x)|&\le \sum_{j=1}^{s-1}\frac{\epsilon^{j-2}}{j!}\int_{B_{\mathbf{0}}(1)}g(x)^{q/2-p}\eta\left(\|y\|\right)|(d_{x}^{j_1}f_{g})(y)|\cdot|R_{S}(x,\epsilon y+x;g^{q/2})|dy\\&\le C\epsilon^{s-2}\|g\|_{C^{s-1}(\mathcal{X})}\sum_{j=1}^{s-1}\frac{1}{j!}\int_{B_{\mathbf{0}}(1)}g(x)^{q/2-p}\eta\left(\|y\|\right)|(d_{x}^{j_1}f_{g})(y)|dy. \end{align}\] Moreover, we have by Cauchy–Schwarz inequality, \[\begin{align} &\int_{\mathcal{X}_{\epsilon}}g(x)^{p+r}\left(\int_{B_{\mathbf{0}}(1)}g(x)^{q/2-p}\eta\left(\|y\|\right)|(d_{x}^{j_1}f_{g})(y)|dy\right)^{2}dx\\&\le \int_{\mathcal{X}_{\epsilon}}g(x)^{q-p+r}\left(\int_{B_{\mathbf{0}}(1)}\eta\left(\|y\|\right)|(d_{x}^{j_1}f_{g})(y)|^2dy\right)\left(\int_{B_{\mathbf{0}}(1)}\eta(\|y\|)dy\right)dx\\&\le \sigma_0 \int_{B_{\mathbf{0}}(1)}\int_{\mathcal{X}_{\epsilon}}g(x)^{q-p+r}\eta(\|y\|)((d^{j}f_g)(x))^{2}dxdy\\&\lesssim \sigma_0^{2}\int_{\mathcal{X}_{\epsilon}}g(x)^{p+r}((d^{j}f_g)(x))^{2}dx\\&=\sigma_{0}^{2}\|d^{j}f_g\|_{L^{2}(\mathcal{X}_{\epsilon},g^{p+r})}^{2}, \end{align}\] where in the last step, we use the fact that \(|d_{x}^{j}f(y)|\le |d^{j}f(x)|\) for all \(y\in B_{\mathbf{0}}(1)\). Therefore, it yields that \[\begin{align} &\int_{\mathcal{X}_{\epsilon}}g(x)^{p+r}|L_{2}(x)|^{2}dx\\&\le C\left(\epsilon^{s-2}\|g\|_{C^{s-1}(\mathcal{X})}\right)^{2}\sum_{j=1}^{s-1}\int_{\mathcal{X}_{\epsilon}}g(x)^{p+r}\left(\frac{1}{j!}\int_{B_{\mathbf{0}}(1)}g(x)^{q/2-p}\eta\left(\|y\|\right)|(d_{x}^{j_1}f_{g})(y)|dy\right)^{2}dx\\&\le C\left(\epsilon^{s-2}\|g\|_{C^{s-1}(\mathcal{X})}\right)^{2}\sum_{j=1}^{s-1}\|d^{j}f_{g}\|_{L^{2}(\mathcal{X}_{\epsilon},g^{p+r})}^{2}. \end{align}\] We obtain the desired bound.

Finally, similar to \(L_{2}(x)\), we obtain the same bound for \(L_3(x).\) Combining the obtained bounds for \(L_1(x) - L_3(x),\) we obtain 10 for \(t=1\).

Now, we perform the induction step. Assuming the bound 10 holds up to some \(t<s/2\), we want to show it also holds for \(t+1\), with \(t+1 < s/2\). For convenience, we introduce the following notation: for any \(1\le j\le l\le s\), denote by \(r_{j,l}(x)=r_{(s-l)+j}(x)\). Note again that the functions \(r_{j,l}\) implicitly depend on \(t\) at the induction step thus they may vary in the below arguments from line to line. For a function \(r\in H^{l}(\mathcal{X}_{t\epsilon},g;C\|g\|_{C^{s-1}(\mathcal{X})}^{t}M)\) for some \(l\le s\), if \(l\le 2\), we have by the inductive hypothesis that for any \(x\in\mathcal{X}_{(t+1)\epsilon}\), \[\begin{align} L_{w,\epsilon}r(x)=r_{l}^{l}(x)\epsilon^{l-2}. \end{align}\] On the other hand, if \(2<l\le s\), then by the inductive hypothesis, it holds that for any \(x\in\mathcal{X}_{(t+1)\epsilon}\), \[\begin{align} \label{inductive1} L_{w,\epsilon}r(x)=\sigma_{1}\mathcal{L}_{w}r(x)+\sum_{j=1}^{\lfloor (l-1)/2\rfloor-1}r_{2j+2,l}(x)\epsilon^{2j}+r_{l,l}(x)\epsilon^{l-2}. \end{align}\tag{12}\] Then, we have \[\begin{align} \label{inductive2} L_{w,\epsilon}^{t+1}f(x)&=(L_{w,\epsilon}\circ L_{w,\epsilon}^{t}f)(x)\nonumber\\&=\sigma_1^{t}L_{w,\epsilon}\mathcal{L}_{w}^{t}f(x)+\sum_{j=1}^{\lfloor (s-1)/2\rfloor-k}L_{w,\epsilon}r_{2(j+t)}(x)\epsilon^{2j}+L_{w,\epsilon}r_{s}(x)\epsilon^{s-2t}. \end{align}\tag{13}\] In the following, we will bound these terms on the right-hand side individually. First of all, since \(\mathcal{L}_{w}^{t}f\in H^{s-2t}(\mathcal{X},g;C\|g\|_{C^{s-1}(\mathcal{X})}^{t}M)\), applying 12 yields \[\begin{align} \label{t4311} L_{w,\epsilon}\mathcal{L}_{w}^{t}f(x)&=\sigma_1 \mathcal{L}_{w}^{t+1}f(x)+\sum_{j=1}^{\lfloor (s-2t-1)/2\rfloor-1}r_{2j+2,s-2t}(x)\epsilon^{2j}+r_{s-2t,s-2t}(x)\epsilon^{s-2t-2}\nonumber\\&=\sigma_1 \mathcal{L}_{w}^{t+1}f(x)+\sum_{j=1}^{\lfloor (s-1)/2\rfloor-(t+1)}r_{2(t+1+j)}(x)\epsilon^{2j}+r_{s}(x)\epsilon^{s-2(t+1)}, \end{align}\tag{14}\] where we apply the fact mentioned before that \(r_{j,l}(x)=r_{(s-l)+j}(x)\).

Next, suppose \(j<\lfloor (s-1)/2\rfloor-t\). We apply 12 and obtain \[\begin{align} L_{w,\epsilon}r_{2(j+t)}(x)&=\sigma_1 \mathcal{L}_{w}r_{2(j+t)}(x)+\sum_{i=1}^{\lfloor (s-2j-2t-1)/2\rfloor-1}r_{2i+2,s-2(j+t)}(x)\epsilon^{2i}\\&\quad+r_{s-2(j+t),s-2(j+t)}(x)\epsilon^{s-2(j+t)-2}\\&=r_{2(j+t+1)}(x)+\sum_{i=1}^{\lfloor (s-1)/2\rfloor-(j+t+1)}r_{2(i+j+t+1)}(x)\epsilon^{2i}+r_{s}(x)\epsilon^{s-2(j+t+1)}, \end{align}\] where we use the fact that \(r_{j,l}(x)=r_{(s-l)+j}(x)\) and \(\sigma_1\mathcal{L}_w r_{2(j+t)}(x)=r_{2,s-2(j+t)}(x)=r_{2(j+t+1)}(x)\). Therefore, we have \[\begin{align} \label{t4312} L_{w,\epsilon}r_{2(j+t)}(x)\epsilon^{2j}=r_{2(j+t+1)}(x)\epsilon^{2j}+\sum_{m=1}^{\lfloor (s-1)/2\rfloor-(k+1)}r_{2(m+t+1)}(x)\epsilon^{2m}+r_{s}(x)\epsilon^{s-2(k+1)}, \end{align}\tag{15}\] where the last equality is by changing the variable \(m=i+j\). Moreover, when \(j=\lfloor (s-1)/2\rfloor-t\), we have \(2(j+t)=2\lfloor (s-1)/2\rfloor\) and we simply calculate that \[\begin{align} \label{t4313} L_{w,\epsilon}r_{2(j+t)}(x)\epsilon^{2j}=r_{s-2(j+t)}^{s-2(j+t)}(x)\epsilon^{s-2(j+k)}\epsilon^{2j}=r_{s}(x)\epsilon^{s-2(k+1)}. \end{align}\tag{16}\] Finally, according to 12 , we have \[\begin{align} \label{t4314} L_{w,\epsilon}r_{s}(x)\epsilon^{s-2t}=r_{s}(x)\epsilon^{s-2(t+1)}. \end{align}\tag{17}\] Combining 14 17 with 13 , we obtain the proof for \(t+1\). ◻

Recall that we write \(\mathcal{X} = \mathcal{X}_{t\epsilon} \sqcup \partial \mathcal{X}_{t\epsilon}\), where for any \(x\in \mathcal{X}_{t\epsilon}\), \(B_{x}(t\epsilon)\subset \mathcal{X}\) and \(\partial_{t\epsilon} \mathcal{X}\) as its complement within \(\mathcal{X}\) consisting of points ‘close’ to the boundary.

Lemma 5. For \(f\in H^{s}_{0}(\mathcal{X},g;M)\) and \(t>0\) such that \(2t<s\), there exists a constant \(c>0\) not depending on \(M\) or \(f\) such that for all \(\epsilon<c\), \[\begin{align} \|L_{w,\epsilon}^{t}f\|_{L^{2}(\partial_{t\epsilon} \mathcal{X},g^{p+r})}^{2}\lesssim \epsilon^{2(s-2t)}M^{2}. \end{align}\]

Proof. Note that according to Lemma 2, we have \[\begin{align} \|L_{w,\epsilon}^{t}f\|_{L^{2}(\partial_{t\epsilon} \mathcal{X},g^{p+r})}^{2}\lesssim \frac{1}{\epsilon^{4}} \|L_{w,\epsilon}^{t-1}f\|_{L^{2}(\partial_{t\epsilon} \mathcal{X},g^{p+r})}^{2}\lesssim\ldots\lesssim \frac{1}{\epsilon^{4t}}\|f_{g}\|_{L^{2}(\partial_{t\epsilon} \mathcal{X},g^{p+r})}^{2}. \end{align}\] Therefore, it suffices to show for all \(\epsilon<c\), \[\begin{align} \label{boundarybound} \|f_{g}\|_{L^{2}(\partial_{t\epsilon} \mathcal{X},g^{p+r})}^{2}\lesssim\epsilon^{2s}\|f\|_{H^{s}(\mathcal{X},g)}^{2}. \end{align}\tag{18}\] In order to deal with \(f_{g}\) near the boundary, we will take a similar procedure used in [1] and [53] as follows. With loss of generality, we take \(t=1\) as one can view \(\epsilon<c/t\) for proving for the general case.

Step I: Local patch. We assume that for some \(c_0>0\) and a Lipschitz mapping \(\phi:\mathbb{R}^{d-1}\rightarrow [-c_0,c_0]\) and since \(f\in H^{s}_{0}(\mathcal{X},g;M)\), without loss of generality, we can assume that \(f_{g}\in C_{c}^{\infty}(U_{\psi}(c_0))\) with \[\begin{align} U_{\psi}(c_0):=\{y\in Q(0,c_0):\psi(y^{(-d)})\le y^{(d)}\}, \end{align}\] where \(Q(0,c_0)\) is the \(d\)-dimensional hypercube of side length \(c_0\) centered at \(\mathbf{0}\). Now, following step 1 in [1] by replacing \(f\) as \(f_{g}\), we have \[\begin{align} |f_{g}(y)|^2&\lesssim \epsilon^{2(s-1)}\left(\int_{\psi(y^{(-d)})}^{y^{(d)}}|(D^sf_{g}(y^{(-d)},z))^{(d)}|dz\right)^{2}\\&\lesssim \epsilon^{2s-1}\int_{\psi(y^{(-d)})}^{y^{(d)}}|(D^sf_{g}(y^{(-d)},z))^{(d)}|^{2}dz. \end{align}\] Then, we obtain: \[\begin{align} \label{step1:1} \int_{V_{\psi}(\epsilon)}g(y)^{p+r}|f_{g}(y)|^2dy&\lesssim \int_{Q_{d-1}(c_0)}\int_{\psi(y^{(-d)})}^{\psi(y^{(-d)})+\epsilon}|f_{g}(y^{(-d)},y^{(d)})|^{2}dy^{(d)}dy^{(-d)}\nonumber\\&\lesssim \epsilon^{2s-1}\int_{Q_{d-1}(c_0)}\int_{\psi(y^{(-d)})}^{\psi(y^{(-d)})+\epsilon}\int_{\psi(y^{(-d)})}^{y^{(d)}}|(D^sf_{g}(y^{(-d)},z))^{(d)}|^{2}dzdy^{(d)}dy^{(-d)}, \end{align}\tag{19}\] where \(Q_{d-1}(0,c_0)\) is the \(d\)-1 dimensional hypercube of side length \(c_0\) centered at \(\mathbf{0}\). Also, by changing the integration order, it yields that \[\begin{align} \label{step1:2} \int_{\psi(y^{(-d)})}^{\psi(y^{(-d)})+\epsilon}\int_{\psi(y^{(-d)})}^{y^{(d)}}|(D^sf_{g}(y^{(-d)},z))^{(d)}|^{2}dzdy^{(d)}&\lesssim \epsilon\int_{\psi(y^{(-d)})}^{\psi(y^{(-d)})+\epsilon}|(D^sf_{g}(y^{(-d)},z))^{(d)}|^{2}dz\nonumber\\&\lesssim \epsilon\int_{\psi(y^{(-d)})}^{c_0}|(D^sf_{g}(y^{(-d)},z))^{(d)}|^{2}dz. \end{align}\tag{20}\] Combining 19 and 20 , we obtain: \[\begin{align} \int_{V_{\psi}(\epsilon)}g(y)^{p+r}|f_{g}(y)|^2dy&\lesssim \epsilon^{2s}\int_{Q_{d-1}(c_0)}\int_{\psi(y^{(-d)})}^{c_0}g(y^{(-d)},z)^{q}|(D^sf_{g}(y^{(-d)},z))^{(d)}|^{2}dzdy^{(-d)}\\&\lesssim \epsilon^{2s}\|f\|_{H^{s}(U_{\psi}(c_0),g)}^{2}. \end{align}\]

Step 2: Rigid motion of local patch Now suppose at a point \(x_0\in \partial \mathcal{X}\), there exits a rigid motion \(T:\mathbb{R}^{d}\rightarrow \mathbb{R}^{d}\) such that \(T(x_0)=0\), and a number \(C_0\) such that we have all \(C_0\epsilon\le c_0\), \[\begin{align} \label{localrigid} T(Q_{T}(x_0,c_0)\cap \partial_{\epsilon} \mathcal{X})\subseteq V_{\psi}(C_0\epsilon)\quad \text{and}\quad T(Q_{T}(x_0,c_0)\cap \mathcal{X})=U_{\psi}(c_0), \end{align}\tag{21}\] where \(Q_{T}(x_0,c_0)\) is a hypercube in \(\mathbb{R}^{d}\) of side length \(c_0\) centered at \(x_0\) (not necessarily coordinate-axis-aligned). Let \(v_{g}(y):=f_{g}(T^{-1}(y))\) and \(v(y):=f(T^{-1}(y))\) for all \(y\in U_{\psi}(c_0)\). Then, if \(f_{g}\in C_{c}^{\infty}(\mathcal{X})\), we have \(v_{g}\in C_{c}^{\infty}(U_{\psi}(c_0))\) such that \(\|v_{g}\|_{H^{s}(U_{\psi}(c_0))}^{2}=\|f_g\|_{H^{s}(Q_{T}(x_0,c_0))\cap \mathcal{X}}^{2}\). Therefore, according to Step 1, we have \[\begin{align} \int_{V_{\psi}(C_0\epsilon)}g(x)^{p+r}|v_g(y)|^2dy\lesssim \epsilon^{2s}\|v\|_{H^{s}(U_{\psi}(c_0)),g}^{2}. \end{align}\] Then, it yields that \[\begin{align} &\int_{Q_{T}(x_0,c_0)\cap \partial_{\epsilon} \mathcal{X}}g^{p+r}(x)|f_g(x)|^{2}dx\\&=\int_{T(Q_{T}(x_0,c_0)\cap \partial_{\epsilon} \mathcal{X})}g^{p+r}(y)|v_g(y)|^{2}dx\\&\lesssim \int_{V_{\psi}(C_0\epsilon)}g(x)^{p+r}|v_g(y)|^2dy\\&\lesssim \epsilon^{2s}\|v\|_{H^{s}(U_{\psi}(c_0),g)}^{2}\\&\lesssim \epsilon^{2s}\|f\|_{H^{s}(Q_{T}(x_0,c_0)\cap \partial_{\epsilon} \mathcal{X},g)}^{2}\lesssim \epsilon^{2s}\|f\|_{H^{s}(\mathcal{X},g)}^{2}. \end{align}\]

Step 3: Lipschitz domain. Now we arrive at the last step where we shall deal with the case: \(\mathcal{X}\) is assumed to be an open, bounded subset of \(\mathbb{R}^{d}\) with Lipschitz boundary. Again, following the procedure in [1]. In this case, for every \(x_0\in \partial\mathcal{X}\), there exists a rigid motion \(T_{x_0}:\mathbb{R}^{d}\rightarrow\mathbb{R}^{d}\) such that \(T_{x_0}(x_0)=0\), a number \(c_0(x_0)\), a Lipshitz mapping \(\psi_{x_0}:\mathbb{R}^{d-1}\rightarrow [-c_0(x_0),c_0(x_0)]\) and a number \(C_{0}(x_0)\) satisfying for all \(C_0(x_0)\epsilon\le c_0(x_0)\), 21 holds for replacing \(c_0,C_0,T,\psi\) by \(c_0(x_0),C_0(x_0),T_{x_0},\psi_{x_0}\) respectively. Therefore, by Step 2, we have \[\begin{align} \int_{Q_{T_{x_0}}(x_0,c_0(x_0))\cap \partial_{\epsilon} \mathcal{X}}g^{p+r}(x)|f_g(x)|^{2}dx\lesssim_{x_0} \epsilon^{2s}\|f\|_{H^{s}(\mathcal{X},g)}^{2}. \end{align}\] Although the constant in the last bound depends on \(x_0\), by compactness assumption, there exists a finite subset (denoted by \(x_{0,1},\ldots,x_{0,N}\)) of the collection of hypercubes \(\{Q_{T_{x_0}}(x_0,c_0(x_0)/2):x_{0}\in\partial\mathcal{X}\}\) which covers \(\partial\mathcal{X}\). Then, by taking the minimum of all constants with respect to \(x_{0,1},\ldots,x_{0,N}\), we can conclude that \[\begin{align} \partial_{\epsilon}(\mathcal{X})\subseteq \bigcup_{i=1}^{N}Q_{T_{x_{0,i}}}(x_{0,i},c_{0}(x_{0,i})). \end{align}\] Consequently, we have \[\begin{align} \int_{\partial \mathcal{X}}g^{p+r}(x)|f_{g}(x)|^{2}dx\lesssim \sum_{i=1}^{N}\int_{Q_{T_{x_{0,i}}}(x_{0,i},c_0(x_{0,i}))\cap \partial_{\epsilon} \mathcal{X}}g^{p+r}(x)|f_g(x)|^{2}dx\lesssim \epsilon^{2s}\|f\|_{H^{s}(\mathcal{X},g)}^{2}. \end{align}\] Therefore, we proved the desired result 18 . ◻

The following result presents a higher order version of Lemma 1 for \(s>1\) and the non-local weighted Sobolev seminorm, \(\langle L_{w,\epsilon}^{s}f,f \rangle_{g^{p-r}}\).

Lemma 6. For \(f\in H^{1}(\mathcal{X},g;M)\cap H_{0}^{s}(\mathcal{X},g;M)\) with \(s\in\mathbb{N}_{+}\backslash\{1\}\), we have \[\begin{align} \langle L_{w,\epsilon}^{s}f,f\rangle_{g^{p-r}}\lesssim M^{2}. \end{align}\]

Proof of Lemma 6. Note here that we fix the assumption that \(f\in H^{1}(\mathcal{X},g;M)\) besides \(f\in H_{0}^{s}(\mathcal{X},g;M)\), which is missing in the statement of [1]. In general, it is not true for \(\mathcal{X}\neq\mathbb{R}^{d}\) that \(H_{0}^{1}(\mathcal{X},g;M)=H^{1}(\mathcal{X},g;M)\). Based on Lemma 1, we will prove Lemma 6 in a recursive way for \(s>1\). Recall that \(L_{w,\epsilon}\) is self-adjoint with respect to the weighted inner product, meaning \(\langle L_{w,\epsilon}f_1,f_2\rangle_{g^{p-r}}=\langle f_1,L_{w,\epsilon}f_2\rangle_{g^{p-r}}\) for any \(f_1/g^r,f_2/g^r\in L^{2}(\mathcal{X},g^{p+r})\). Also recall the definition of the Dirichlet energy given in Lemma 3, which can be stated as \(E_{w,\epsilon}(f,\mathcal{X}) = 2\langle L_{w,\epsilon}f,f\rangle_{g^{p-r}}\).

Following the procedure in [1] 3, when \(s=2t+1\) for \(t\ge 1\), by using self-adjointness, we have \[\begin{align} \langle L_{w,\epsilon}^{s}f,f\rangle_{g^{p-r}}=\langle L_{w,\epsilon}^{t+1}f,L_{w,\epsilon}^{t}f\rangle_{g^{p-r}}=\frac{1}{2}E_{w,\epsilon}(L_{w,\epsilon}^{t}f,\mathcal{X}). \end{align}\] We divide the Dirichlet energy into two parts: \[\begin{align} &E_{w,\epsilon}(L_{w,\epsilon}^{t}f,\mathcal{X})\\&=\frac{1}{\epsilon^{d+2}}\int_{\mathcal{X}_{t\epsilon}}\int_{\mathcal{X}_{t\epsilon}}(g(x)^{-r}f(x)-g(z)^{-r}f(z))^2\frac{\eta\left(\frac{\|x-z\|}{\epsilon}\right)}{g(x)^{1-q/2}g(z)^{1-q/2}}g(x)g(z)dxdz\\&\quad+\frac{1}{\epsilon^{d+2}}\int_{\partial_{t\epsilon} \mathcal{X}}\int_{\partial_{t\epsilon} \mathcal{X}}(g(x)^{-r}f(x)-g(z)^{-r}f(z))^2\frac{\eta\left(\frac{\|x-z\|}{\epsilon}\right)}{g(x)^{1-q/2}g(z)^{1-q/2}}g(x)g(z)dxdz\\&=:E_{w,\epsilon}(L_{w,\epsilon}^{t}f,\mathcal{X}_{t\epsilon})+E_{w,\epsilon}(L_{w,\epsilon}^{t}f,\partial_{t\epsilon} \mathcal{X}), \end{align}\] where \(\mathcal{X}_{t\epsilon}\) and \(\partial \mathcal{X}_{t\epsilon}\) have been introduced right before Lemma 4 (\(\partial \mathcal{X}_{t\epsilon} \subset \mathcal{X}\) consists of points \(t\epsilon\)-close to the boundary of \(\mathcal{X}\), and \(\mathcal{X}_{t\epsilon} = \mathcal{X} \setminus \partial \mathcal{X}_{t\epsilon}\)). By Jensen’s inequality, we have \[\begin{align} E_{w,\epsilon}(L_{w,\epsilon}^{t}f,\mathcal{X}_{t\epsilon})&\le 3\sigma_{1}^{2t}E_{w,\epsilon}\left(\sigma_{1}^{t}L_{w}^{t}f,\mathcal{X}_{t\epsilon}\right)\\&\quad+\frac{6}{\epsilon^{d+2}}\int_{\mathcal{X}_{t\epsilon}}\int_{\mathcal{X}_{t\epsilon}}\left(g(x)^{-r}L_{w,\epsilon}^{t}f(x)-g(z)^{-r}\sigma_{1}^{t}L_{w}^{t}f(z)\right)^2\\&\qquad\qquad\qquad\frac{\eta\left(\frac{\|x-z\|}{\epsilon}\right)}{g(x)^{1-q/2}g(z)^{1-q/2}}g(x)g(z)dxdz. \end{align}\] By definition 5 , we have \(\mathcal{L}_{w}^{t}f\in H^{1}(\mathcal{X},g;C\|g\|_{C^{s-1}(\mathcal{X})}^{t}M)\) for some constant \(C>0\), an application of Lemma 1 shows \(E_{w,\epsilon}\left(\sigma_{1}^{t}L_{w}^{t}f,\mathcal{X}_{t\epsilon}\right)\lesssim M^{2}\). We then focus on the second term on the right-hand side of the above inequality. According to Lemma 4, we obtain: \[\begin{align} &\frac{1}{\epsilon^{d+2}}\int_{\mathcal{X}_{t\epsilon}}\int_{\mathcal{X}_{t\epsilon}}\left(g(x)^{-r}L_{w,\epsilon}^{t}f(x)-g(z)^{-r}\sigma_{1}^{t}\mathcal{L}_{w}^{t}f(z)\right)^2\frac{\eta\left(\frac{\|x-z\|}{\epsilon}\right)}{g(x)^{1-q/2}g(z)^{1-q/2}}g(x)g(z)dxdz\\&\lesssim \frac{1}{\epsilon^{d+2}}\int_{\mathcal{X}_{t\epsilon}}\int_{\mathcal{X}_{t\epsilon}}g(x)^{p+r}\left(g(x)^{-r}L_{w,\epsilon}^{t}f(x)-g(x)^{-r}\sigma_{1}^{t}\mathcal{L}_{w}^{t}f(x)\right)^2\eta\left(\frac{\|x-z\|}{\epsilon}\right)dxdz\\&\lesssim \frac{1}{\epsilon^{2}}\int_{\mathcal{X}_{t\epsilon}}g(x)^{p-r}\left(L_{w,\epsilon}^{t}f(x)-\sigma_{1}^{t}\mathcal{L}_{w}^{t}f(x)\right)^2dx\\&\lesssim M^{2}. \end{align}\] Furthermore, near the boundary, according to Lemma 3 and Lemma 5, it yields that \[\begin{align} E_{w,\epsilon}(L_{w,\epsilon}^{t}f,\partial_{t\epsilon} \mathcal{X})\lesssim \frac{1}{\epsilon^{2}}\|L_{w,\epsilon}^{t}f\|_{L^{2}(\partial_{t\epsilon}\mathcal{X},g^{p+r})}\lesssim M^2. \end{align}\]

Putting all pieces above together, we obtain the proof for the case when \(s\) is odd and \(t:=(s-1)/2\). Similar arguments can be applied to the case when \(s\) is even and \(t:=(s-2)/2\). Therefore, combining all above together, we obtain for all integer \(s>1\): \[\begin{align} \langle L_{w,\epsilon}^{s}f,f \rangle_{g^{p-r}}\lesssim M^{2}. \end{align}\] ◻

We are now in the position to prove the main results of Section 3.2.

Proof of Theorem 1. By Cauchy-Schwarz inequality, we have: for all \(s\in\mathbb{N}_{+}\): \[\begin{align} \|\hat{f}-f\|_{w,n}^2\le 2(\|\mathbb{E}\hat{f}-f|_{w,n}^2+\|\hat{f}-\mathbb{E}\hat{f}\|_{w,n}^2). \end{align}\] Then, according to PCR-WLE algorithm in Section 2.2, we obtain \[\begin{align} \label{decomp:bias} \|\mathbb{E}\hat{f}-f\|_{w,n}^{2}=\sum_{k=K+1}^{n}\langle v_k,f \rangle_{w,n}^2\le \frac{\langle L_{w,n,\epsilon}^{s}f,f\rangle_{w,n}}{\lambda_{K+1}^{s}}, \end{align}\tag{22}\] and \[\begin{align} \|\hat{f}-\mathbb{E}\hat{f}\|_{w,n}^2=\sum_{k=1}^{K}\langle v_k,\varepsilon\rangle_{w,n}^{2}. \end{align}\] Since \(\langle v_k,\varepsilon\rangle_{w,n}\) is normally distributed with \(0\) mean and variance: \[\begin{align} \label{var1} \mathop{\mathrm{Var}}\langle v_k,\varepsilon\rangle_{w,n}=\frac{1}{n^2}v_k^TD^{\frac{2(p-1-r)}{q-1}}v_k, \end{align}\tag{23}\] where \(\langle v_k,v_k\rangle_{w,n}=\frac{1}{n}v_{k}^{T}D^{\frac{p-1-r}{q-1}}v_k=1\). Note that \(\langle v_k/\sqrt{n},v_k/\sqrt{n}\rangle_{g^{p-r}}=1\), then we have \[\begin{align} \label{eigenD} \underset{v_{k}/\sqrt{n}\in\mathbb{R}^{n}}{\min}~\frac{1}{n}v_k^{T}D^{\frac{p-1-r}{q-1}}D^{\frac{p-1-r}{q-1}}v_{k} \end{align}\tag{24}\] is the smallest eigenvalue of the matrix \(D^{\frac{p-1-r}{q-1}}\) with respect to the inner product \(\langle\cdot,\cdot\rangle_{g^{p-r}}\). As \(D\) is a diagonal matrix with the \((i,i)\)-element as \(d_i\), according to Section 6.1, it is bounded from below, say by a constant \(C>0\), almost surly for \(n\) large enough. Then, combining 23 and 24 , we have: \[\begin{align} \|\hat{f}-\mathbb{E}\hat{f}\|_{w,n}^2=\frac{1}{n}\sum_{k=1}^{K}(\sqrt{n}\langle v_k,\epsilon\rangle_{w,n})^{2}, \end{align}\] with \(\sqrt{n}\langle v_k,\epsilon\rangle_{w,n}\) being normal with mean \(0\) and variance \[\begin{align} \mathop{\mathrm{Var}}(\sqrt{n} \langle v_k,\epsilon\rangle_{w,n})\ge C>0. \end{align}\] According to an exponential inequality for chi-square distributions from [54], we obtain: \[\begin{align} \label{decomp:variance} \mathbb{P}\left(\|\hat{f}-\mathbb{E}\hat{f}\|_{w,n}^2\ge \frac{CK}{n}+2\frac{\sqrt{K}}{n}\sqrt{t}+2\frac{t}{n}\right)\le e^{-t}. \end{align}\tag{25}\] With 22 and 25 , it yields \[\begin{align} \label{biasvariancedecomp} \|\hat{f}-f\|_{w,n}^{2}\le \frac{\langle L_{w,n,\epsilon}^{s}f,f\rangle_{w,n}}{\lambda_{K+1}^{s}}+\frac{CK}{n}, \end{align}\tag{26}\] with probability at least \(1-e^{-K}\) if \(1\le K\le n\). Then, it remains to bound the empirical weighted Sobolev seminorm \(\langle L_{w,n,\epsilon}^{s}f,f\rangle_{w,n}\) and the graph weighted Laplacian eigenvalue \(\lambda_{K+1}^{s}\).

We will first focus on \(\langle L_{w,n,\epsilon}^{s}f,f\rangle_{w,n}\) for \(s=1\). By definition 4 , we have by symmetry: \[\begin{align} \label{disexpress} \mathbb{E}\langle L_{w,n,\epsilon}f,f\rangle_{w,n}=\frac{1}{2}\mathbb{E}\left(\frac{1}{\epsilon^{d+2}}|d_{i}^{-\frac{r}{q-1}}f(X_i)-d_{j}^{-\frac{r}{q-1}}f(X_j)|^{2}d_{i}^{\frac{1-p}{q-1}}\frac{\eta\left(\frac{\|X_i-X_{j}\|}{\epsilon}\right)}{\tilde{d}_{i}^{1-q/2}\tilde{d}_{j}^{1-q/2}}\right). \end{align}\tag{27}\] We would like to point out here that the normalization factor \(\epsilon^{-(d+2)}\) is motivated by the fact that a factor of \(\epsilon^{-d}\) is needed to scale \(\eta\left(\frac{\|X_i-X_j\|}{\epsilon}\right)\) and the remaining factor, \(\epsilon^{-2},\) stabilized the squared differences of \(d_{i}^{-\frac{r}{q-1}}\) under the expectation.

According to Section 6.1 and by conditioning on \(X_i\) and the law of iterated expectation, we have for \(n\) large enough, \[\begin{align} \label{distononlocal} {!}{\left|\mathbb{E}\left(\frac{1}{\epsilon^{d+2}}|d_{i}^{-\frac{r}{q-1}}f(X_i)-d_{j}^{-\frac{r}{q-1}}f(X_j)|^{2}d_{i}^{\frac{1-p}{q-1}}\frac{\eta\left(\frac{\|X_i-X_{j}\|}{\epsilon}\right)}{\tilde{d}_{i}^{1-q/2}\tilde{d}_{j}^{1-q/2}}\right)-2\langle L_{w,\epsilon}f,f\rangle_{g^{p-r}}\right| \lesssim \Delta(n,\epsilon,\eta,g)+\epsilon,} \end{align}\tag{28}\] where \[\begin{align} \Delta(n,\epsilon,\eta,g): =\frac{1}{n}g_{\max}+\frac{\eta(0)}{n\epsilon^{d}}+\frac{n-1}{n}\Big(\sqrt{\frac{|\log \epsilon|}{n\epsilon^{d}}}+\epsilon\Big) \to 0\quad\text{as }\;n\to \infty. \end{align}\]

Combining 27 , 28 and Lemma 1, we obtain: \[\begin{align} \mathbb{E}\langle L_{w,n,\epsilon}f,f\rangle_{w,n}\lesssim M^{2}+\Delta(n,\epsilon,\eta,g)+\epsilon. \end{align}\] Consequently, by Markov’s inequality, we have: for any \(\delta\in(0,1)\), \[\begin{align} \label{markovs611} \langle L_{w,n,\epsilon}f,f\rangle_{w,n}\lesssim \frac{1}{\delta}\left(M^{2}+\Delta(n,\epsilon,\eta,g)+\epsilon\right), \end{align}\tag{29}\] with probability at least \(1-\delta\). Note that the above bound on the expected weighted Sobolev seminorm generalizes the results in [1] to the weighted Laplacians by some properties of KDE.

Next, we proceed to the higher order case when \(s>1\) for \(\langle L_{w,n,\epsilon}^{s}f,f\rangle_{w,n}\). We define the following difference operator: \[\begin{align} D_{j}f(x)=(d_{\cdot}^{-\frac{r}{q-1}}f(x)-d_{j}^{-\frac{r}{q-1}}f(X_j))d_{\cdot}^{\frac{1-p}{q-1}}w_{\cdot,j}^{\epsilon}, \end{align}\] where \(d_{\cdot}\) and \(w_{\cdot,j}^{\epsilon}\) are defined by replacing \(X_i\) by \(x\) in both \(d_{i}\) and \(w_{i,j}^{\epsilon}.\) Furthermore, let \(D_{\mathbf{j}}f(x):=(D_{j_1}f\circ\ldots\circ D_{j_s}f)(x)\), where \(\boldsymbol{j} = (j_1,\ldots,j_s) \in [n]^s := \{1,\ldots,n\}^s\). Denote by \((n)^{s}\) the sub-collection of vectors in \([n]^s\) with no repeated indices and let by \(i\mathbf{j}\mathrel{\vcenter{:}}= (i,j_1,\ldots,j_{s}).\)

Following the idea of [1], we decompose the weighted Sobolev seminorm into a U-statistic, which is an unbiased estimator of the non-local Sobolev seminorm \(\langle L_{w,\epsilon}^{s}f,f\rangle_{g^{p-r}}\), and a pure bias term: \[\begin{align} \label{I1I2} \langle L_{w,n,\epsilon}^{s}f,f\rangle_{w,n}&=\frac{1}{n}\sum_{i=1}^{n}d_{i}^{\frac{p-1-r}{q-1}}L_{w,n,\epsilon}^{s}f(X_i)\cdot f(X_i)\nonumber\\&=\frac{1}{n\epsilon^{2s}}\sum_{i\mathbf{j}\in (n)^{s+1}}d_{i}^{\frac{p-1-r}{q-1}}D_{\mathbf{j}}f(X_i)\cdot f(X_i)\nonumber\\&\qquad+\frac{1}{n\epsilon^{2s}}\sum_{i\mathbf{j}\in [n]^{s+1}\backslash(n)^{s+1}}d_{i}^{\frac{p-1-r}{q-1}}D_{\mathbf{j}}f(X_i)\cdot f(X_i)\nonumber\\&=:I_1+I_2. \end{align}\tag{30}\]

Note that there are errors in [1] when bounding both \(\mathbb{E}I_{1}\) and \(\mathbb{E}I_{2}\). Specifically, in [1], there should not be a \(\delta\) appearing in Equation D.4 by Markov’s inequality and the power of \(\epsilon\) should be \(2s+d\). Although their final result is correct, we will fix these errors in the following proof. Now, determined by whether all \(i\mathbf{j}\) are distinct, the empirical weighted Sobolev seminorm can be divided into two parts, \(I_1\) and \(I_2\). The first one involves all distinct indices where we make approximation by the so-called non-local weighted sobolev norm \(\langle L_{w,\epsilon}^{s}f,f\rangle_{g^{p-r}}\); the second part focuses on the case where not all \(i\mathbf{j}\) are distinct and use the fact that it is related to a connected subgraph.

As for \(I_1\) from 30 , we have \[\begin{align} \mathbb{E}I_1&=\frac{1}{n\epsilon^{2s}}\frac{n!}{(n-s-1)!}\mathbb{E}\left(d_{i}^{\frac{p-1-r}{q-1}}D_{\mathbf{j}}f(X_i)\cdot f(X_i)\right)\\&=\frac{1}{n\epsilon^{2s}}\frac{n!}{(n-s-1)!}\mathbb{E}\langle D_{\mathbf{j}}f(X_i),f(X_i)\rangle_{g^{p-r}}, \end{align}\] where the operator \(D_{\mathbf{j}}\) is iterated for \(s\) different times due to the fact that \(i\mathbf{j}\) are all distinct. For each iteration, say \(s=1\), we have \[\begin{align} \label{alldiffers1} &\quad\mathbb{E}\langle D_{j}f(X_i),f(X_i)\rangle_{g^{p-r}}\nonumber\\&=\frac{\epsilon^{2}}{2n}\mathbb{E}\left(\frac{1}{\epsilon^{d+2}}|d_{i}^{-\frac{r}{q-1}}f(X_i)-d_{j}^{-\frac{r}{q-1}}f(X_j)|^{2}d_{i}^{\frac{1-p}{q-1}}\frac{\eta\left(\frac{\|X_i-X_{j}\|}{\epsilon}\right)}{\tilde{d}_{i}^{1-q/2}\tilde{d}_{j}^{1-q/2}}\right). \end{align}\tag{31}\] Then, plugging 28 in 31 , we obtain \[\begin{align} \left|\mathbb{E}\langle D_{j}f(X_i),f(X_i)\rangle_{g^{p-r}}-\frac{\epsilon^{2}}{n}\langle L_{w,\epsilon}f,f\rangle_{g^{p-r}}\right|\lesssim \frac{\epsilon^{2}}{2n}(\Delta(n,\epsilon,\eta,g)+\epsilon). \end{align}\] After \(s\) times iteration, it yields that \[\begin{align} \left|\mathbb{E}\langle D_{\mathbf{j}}f(X_i),f(X_i)\rangle_{g^{p-r}}-\frac{\epsilon^{2s}}{n^{s}}\langle L_{w,\epsilon}^{s}f,f\rangle_{g^{p-r}}\right|\lesssim \frac{\epsilon^{2s}}{2^{s}n^{s}}(\Delta(n,\epsilon,\eta,g)+\epsilon). \end{align}\] Putting all above results back in \(\mathbb{E}I_1\), we conclude that for \(n\) large enough, \[\begin{align} \label{beforestirling} \left|\mathbb{E}I_1-\frac{n!}{n^{s+1}(n-s-1)!}\langle L_{w,\epsilon}^{s}f,f \rangle_{g^{p-r}}\right|\lesssim \frac{n!}{n^{s+1}(n-s-1)!}(\Delta(n,\epsilon,\eta,g)+\epsilon). \end{align}\tag{32}\] The Stirling’s formula shows \[\begin{align} \underset{n\rightarrow\infty}{\lim}~\frac{n!}{n^{s+1}(n-s-1)!}=1. \end{align}\] Therefore, by 32 , we have for \(n\) large enough, \[\begin{align} \mathbb{E}I_{1}\lesssim \langle L_{w,\epsilon}^{s}f,f \rangle_{g^{p-r}}+(\Delta(n,\epsilon,\eta,g)+\epsilon). \end{align}\] According to Lemma 6, it yields that \[\begin{align} \label{ExpectI1} \mathbb{E}I_{1}\lesssim M^{2}+(\Delta(n,\epsilon,\eta,g)+\epsilon). \end{align}\tag{33}\]

We next shift our attention to \(I_{2}\) in 30 : \[\begin{align} \frac{1}{n\epsilon^{2s}}\sum_{i\mathbf{j}\in [n]^{s+1}\backslash(n)^{s+1}}d_{i}^{\frac{p-1-r}{q-1}}D_{\mathbf{j}}f(X_i)\cdot (f(X_i)-f(X_{j_1})). \end{align}\]

For \(i\mathbf{j}\) not all distinctive, if they contains a total of \((k+1)\) distinct indices for example for \(1\le k\le s-1\), we have by symmetry: \[\begin{align} \sum_{i\mathbf{j}\in [n]^{s+1}\backslash(n)^{s+1}}d_{i}^{\frac{p-1-r}{q-1}}D_{\mathbf{j}}f(X_i)\cdot f(X_i)=\frac{1}{2}\cdot \sum_{i\mathbf{j}\in [n]^{s+1}\backslash(n)^{s+1}}d_{i}^{\frac{p-1-r}{q-1}}D_{\mathbf{j}}f(X_i)\cdot (f(X_i)-f(X_{j_1})). \end{align}\] Observe that in order for \[\begin{align} d_{i}^{\frac{p-1-r}{q-1}}|D_{\mathbf{j}}f(X_i)|\cdot |f(X_i)-f(X_{j_1})| \end{align}\] to be non-zero, it must be the case that the graph \(G_{n,\epsilon}(X_{i\mathbf{j}})\) which is the subgraph induced by the vertices \(X_i,X_{j_1},\ldots,X_{j_{s}}\) is complete. Since we have: \[\begin{align} D_{ij}f(x)&=D_{i}(D_{j}f(x))\\&=D_{i}\left((d_{\cdot}^{-\frac{r}{q-1}}f(x)-d_{j}^{-\frac{r}{q-1}}f(X_j))d_{\cdot}^{\frac{1-p}{q-1}}w_{\cdot,j}^{\epsilon}\right)\\&=(d_{\cdot}^{-\frac{r}{q-1}}D_j f(x)-d_{i}^{-\frac{r}{q-1}}D_{j}f(X_i))d_{\cdot}^{\frac{1-p}{q-1}}w_{\cdot,i}^{\epsilon}, \end{align}\] then \[\begin{align} |D_{j_{1}j_{2}}f(X_{i})|\le \left(d_{i}^{-\frac{r}{q-1}}|D_{j_2}f(X_{i})|+d_{j_1}^{-\frac{r}{q-1}}|D_{j_2}f(X_{j_1})|\right)d_{i}^{\frac{1-p}{q-1}}w_{i,j_1}^{\epsilon}. \end{align}\] Repeating the above computation and by induction, it yields that for \(s\ge 2\), \[\begin{align} |D_{\mathbf{j}}f(X_i)|\le (s-1)d_{\max/\min}^{-\frac{(s-1)r}{q-1}}d_{\max/\min}^{\frac{(s-1)(1-p)}{q-1}}\left(w_{\max}^{\epsilon}\right)^{s-1}\sum_{j\in i\mathbf{j}\backslash\{j_{s}\}}|D_{j_{s}}f(X_{j})|, \end{align}\] where \(d_{\max}:=\underset{i=1,\ldots,n}{\max}~d_{i}\), \(d_{\min}:=\underset{i=1,\ldots,n}{\min}~d_{i}\), \(w_{\max}:=\underset{i,j=1,\ldots,n}{\max}~w_{i,j}\) and \(d_{\max/\min}\) means it is \(d_{\max}\) if \(-(s-1)r/(d-1)\) (respectively \((s-1)(1-p)/(q-1)\)) are positive and it is \(d_{\min}\) otherwise.

According to Section 6.1, we have for \(n\) large enough, \(d_{\max}\) is bounded from above and \(d_{\min}\) is bounded from below a.s. and \[\begin{align} w_{\max}\lesssim \frac{1}{n\epsilon^{d}}, \end{align}\] almost surely.

Consequently, it yields that \[\begin{align} \label{iteration} &d_{i}^{\frac{p-1-r}{q-1}}|D_{\mathbf{j}}f(X_i)|\cdot |f(X_i)-f(X_{j_1})|\nonumber\\&=d_{i}^{\frac{p-1-r}{q-1}}|D_{\mathbf{j}}f(X_i)|\cdot |f(X_i)-f(X_{j_1})|\cdot\mathbf{1}_{\{G_{n,\epsilon}(X_{i\mathbf{j}})\;\text{is connected}\}}\nonumber\\&\lesssim \frac{1}{(n\epsilon^{d})^{s-1}}\sum_{j\in i\mathbf{j}\backslash\{j_s\}}\left(d_{i}^{\frac{p-1-r}{q-1}}|D_{j_{s}}f(X_{j})|\cdot|f(X_i)-f(X_{j_1})|\cdot\mathbf{1}_{\{G_{n,\epsilon}(X_{i\mathbf{j}})\;\text{is connected}\}}\right)\nonumber\\&=\frac{\epsilon^{2}}{n^{s}\epsilon^{d(s-1)}}\sum_{j\in i\mathbf{j}\backslash\{j_s\}}\Bigg(\frac{1}{\epsilon^{d+2}}d_{i}^{\frac{p-1-r}{q-1}}|d_{j}^{-\frac{r}{q-1}}f(X_j)-d_{j_s}^{-\frac{r}{q-1}}f(X_{j_{s}})|d_{j}^{\frac{1-p}{q-1}}\frac{\eta\left(\frac{\|X_j-X_{j_s}\|}{\epsilon}\right)}{\tilde{d}_{j}^{1-q/2}\tilde{d}_{j_{s}}^{1-q/2}}\nonumber\\&\qquad|f(X_i)-f(X_{j_1})| \mathbf{1}_{\{G_{n,\epsilon}(X_{i\mathbf{j}})\;\text{is connected}\}}\Bigg), \end{align}\tag{34}\] where we again assign \(\epsilon^{d+2}\) as a normalization factor into the expectation as 27 .

Now, note that for \(j=i\) in the summand on the right-hand side of 34 , we have according to Section 6.1: \[\begin{align} \label{j61i} &\mathbb{E}\Bigg(\frac{1}{\epsilon^{d+2}}d_{i}^{-\frac{r}{q-1}}|d_{i}^{-\frac{r}{q-1}}f(X_i)-d_{j_s}^{-\frac{r}{q-1}}f(X_{j_{s}})|\frac{\eta\left(\frac{\|X_i-X_{j_s}\|}{\epsilon}\right)}{\tilde{d}_{i}^{1-q/2}\tilde{d}_{j_{s}}^{1-q/2}}|f(X_i)-f(X_{j_1})|\nonumber\\&\qquad \mathbf{1}_{\{G_{n,\epsilon}(X_{i\mathbf{j}})\;\text{is connected}\}}\Bigg)\nonumber\\&\lesssim\mathbb{E}\left(\left(\frac{1}{\epsilon^{d+2}}|d_{i}^{-\frac{r}{q-1}}f(X_i)-d_{j_s}^{-\frac{r}{q-1}}f(X_{j_{s}})|\frac{\eta\left(\frac{\|X_i-X_{j_s}\|}{\epsilon}\right)}{\tilde{d}_{i}^{1-q/2}\tilde{d}_{j_{s}}^{1-q/2}}|d_{i}^{-\frac{r}{q-1}}f(X_i)-d_{j_{1}}^{-\frac{r}{q-1}}f(X_{j_{1}})|\right.\right.\nonumber\\&\qquad+(\Delta(n,\epsilon,\eta,g)+\epsilon)\Bigg)\mathbf{1}_{\{G_{n,\epsilon}(X_{i\mathbf{j}})\;\text{is connected}\}}\Bigg)\nonumber\\&\lesssim \mathbb{E}\left(\left(\frac{1}{\epsilon^{d+2}}|d_{i}^{-\frac{r}{q-1}}f(X_i)-d_{j_s}^{-\frac{r}{q-1}}f(X_{j_{s}})|^{2}\frac{\eta\left(\frac{\|X_i-X_{j_s}\|}{\epsilon}\right)}{\tilde{d}_{i}^{1-q/2}\tilde{d}_{j_{s}}^{1-q/2}}+(\Delta(n,\epsilon,\eta,g)+\epsilon)\right)\right.\nonumber\\&\qquad\mathbf{1}_{\{G_{n,\epsilon}(X_{i\mathbf{j}})\;\text{is connected}\}}\Bigg), \end{align}\tag{35}\] where the last inequality is by Cauchy–Schwarz inequality and \(X_1,\ldots,X_{n}\) being i.i.d. data. Then, by integrating out all indices in \(\mathbf{j}\) not equal to \(i\) or \(j_{s}\), it yields that \[\begin{align} \label{k431} &\mathbb{E}\left(\left(\frac{1}{\epsilon^{d+2}}|d_{i}^{-\frac{r}{q-1}}f(X_i)-d_{j_s}^{-\frac{r}{q-1}}f(X_{j_{s}})|^{2}\frac{\eta\left(\frac{\|X_i-X_{j_s}\|}{\epsilon}\right)}{\tilde{d}_{i}^{1-q/2}\tilde{d}_{j_{s}}^{1-q/2}}+(\Delta(n,\epsilon,\eta,g)+\epsilon)\right)\right.\nonumber\\&\qquad\mathbf{1}_{\{G_{n,\epsilon}(X_{i\mathbf{j}})\;\text{is connected}\}}\Bigg)\nonumber\\&\lesssim \left(C\epsilon^{d} g_{\max}V_{d}\right)^{k-1}\mathbb{E}\left(\left(\frac{1}{\epsilon^{d+2}}|d_{i}^{-\frac{r}{q-1}}f(X_i)-d_{j_s}^{-\frac{r}{q-1}}f(X_{j_{s}})|^{2}\frac{\eta\left(\frac{\|X_i-X_{j_s}\|}{\epsilon}\right)}{\tilde{d}_{i}^{1-q/2}\tilde{d}_{j_{s}}^{1-q/2}}\right.\right.\nonumber\\&\qquad+(\Delta(n,\epsilon,\eta,g)+\epsilon)\Bigg)\Bigg). \end{align}\tag{36}\]

Therefore, according to 35 , 36 , 28 and Lemma 1, we obtain \[\begin{align} \label{jifinal} &\mathbb{E}\Bigg(\frac{1}{\epsilon^{d+2}}d_{i}^{-\frac{r}{q-1}}|d_{i}^{-\frac{r}{q-1}}f(X_i)-d_{j_s}^{-\frac{r}{q-1}}f(X_{j_{s}})|\frac{\eta\left(\frac{\|X_i-X_{j_s}\|}{\epsilon}\right)}{\tilde{d}_{i}^{1-q/2}\tilde{d}_{j_{s}}^{1-q/2}}|f(X_i)-f(X_{j_1})|\nonumber\\&\qquad \mathbf{1}_{\{G_{n,\epsilon}(X_{i\mathbf{j}})\;\text{is connected}\}}\Bigg)\nonumber\\&\lesssim \epsilon^{d(k-1)}\left(M^{2}+\Delta(n,\epsilon,\eta,g)+\epsilon\right). \end{align}\tag{37}\] Applying a similar approach to all \(j\neq j_{s}\) and plugging 37 in 34 and 30 , we have \[\begin{align} \mathbb{E}I_{2}&\lesssim \frac{1}{n\epsilon^{2s}}\frac{1}{n^{s}\epsilon^{d(s-1)}}\sum_{k=1}^{s-1}\epsilon^{d(k-1)}\left(M^{2}+\Delta(n,\epsilon,\eta,g)\right)n^{k431}\\&\lesssim \frac{\epsilon^{2}}{n\epsilon^{2s}}\left(M^{2}+\Delta(n,\epsilon,\eta,g)+\epsilon\right)\sum_{k=1}^{s-1}\frac{(n\epsilon^{d})^{k}}{(n\epsilon^{d})^{s}}n. \end{align}\] Note that the above sum is bounded from above when \(k=s-1\) by the assumption \(n\epsilon^{d}\ge 1\). Finally, we conclude that \[\begin{align} \label{ExpectI2} \mathbb{E}I_{2}\lesssim \frac{\epsilon^{2}}{n\epsilon^{2s+d}}\left(M^{2}+\Delta(n,\epsilon,\eta,g)+\epsilon\right). \end{align}\tag{38}\]

Finally, combining 30 , 33 and 38 , we obtain: \[\begin{align} \mathbb{E}\langle L_{w,n,\epsilon}^{s}f,f\rangle_{w,n}&\lesssim M^{2}+(\Delta(n,\epsilon,\eta,g)+\epsilon)+\frac{\epsilon^{2}}{n\epsilon^{2s+d}}\left(M^{2}+\Delta(n,\epsilon,\eta,g)+\epsilon\right)\\&\lesssim M^{2}+(\Delta(n,\epsilon,\eta,g)+\epsilon), \end{align}\] where the last step is by the assumption that \(\epsilon\gtrsim n^{-1/(2(s-1)+d)}\). By Markov’s inequality, we have for any \(\delta\in (0,1)\), \[\begin{align} \label{markovs621} \langle L_{w,n,\epsilon}^{s}f,f\rangle_{w,n}\lesssim \frac{1}{\delta}\left(M^{2}+(\Delta(n,\epsilon,\eta,g)+\epsilon\right), \end{align}\tag{39}\] with probability at least \(1-2\delta\). This bound can be considered as a higher order variant of 29 for \(s>1\).

Now, recall the bound 26 . We have bounded the empirical weighted Sobolev seminorm by 29 and 39 . It remains to bound the eigenvalues \(\lambda_{K+1}\).

According to Lemma 7, we have: \[\begin{align} \label{eigenboundreadytouse} \lambda_{k}=\lambda_{k}(L_{w,n,\epsilon})\gtrsim \lambda_{k}(\mathcal{L}_{w}) \wedge \epsilon^{2},\;\text{for all}\;2\le k\le n, \end{align}\tag{40}\] with probability at least \(1-Cne^{-cn\epsilon^{d}}\) for some constants \(C,c>0\).

For \(s=1\), combining 26 , 29 and 40 , we have with probability at least \(1-\delta-Cne^{-cn\epsilon^{d}}-e^{-K}\) and \(n\) large enough: \[\begin{align} \|\hat{f}-f\|_{w,n}^{2}\lesssim \frac{M^{2}}{\delta\left(\lambda_{K+1}(\mathcal{L}_{w}) \wedge \epsilon^{2}\right)}+\frac{K}{n}. \end{align}\] Furthermore, based on the assumption \(\epsilon\lesssim K^{-1/d}\) and Proposition 6, the above inequality becomes: \[\begin{align} \label{tradeoffres} \|\hat{f}-f\|_{w,n}^{2}\lesssim \frac{M^{2}}{\delta}(K+1)^{-2/d}+\frac{K}{n}. \end{align}\tag{41}\] By balancing the two terms on the right-hand side, we pick \(K=\lfloor M^2n \rfloor^{d/(2+d)}\). Then, it yields that \[\begin{align} \label{finallyminimaxopt} \|\hat{f}-f\|_{w,n}^{2}\lesssim \frac{1}{\delta}M^2(M^2n)^{-2/(2+d)}. \end{align}\tag{42}\] If \(M^2<n^{-1}\), we can take \(K=1\) and obtain from 41 that: \[\begin{align} \|\hat{f}-f\|_{w,n}^{2}\lesssim \frac{1}{n\delta}. \end{align}\] If \(M>n^{1/d}\), we take \(K=n\) and in this case, we actually have \(\hat{f}(X_i)=Y_i\) for \(i=1,\ldots,n\) and \[\begin{align} \|\hat{f}-f\|_{w,n}^{2}=\frac{1}{n}\sum_{i=1}^{n}\varepsilon_{i}^{2}\lesssim C, \end{align}\] with probability at least \(1-e^{-n}\) for some constant \(C\). Combining all above cases depending on choices of \(K\), it yields that bound in Theorem 1 .

For \(s>1\), the proof follows in a similar way by considering 39 instead of 29 . ◻

4.2 Proof of Theorem 2↩︎

Proof of Theorem 2. Recall the construction of the estimator based on Lepski’s procedure: \(\hat{f}_{\mathsf{adapt}}=\hat{f}_{\hat{s},\hat{M}}\) with \(\hat{s},\hat{M}\) given in Section 3.3. Let the event \(\mathcal{E}_{j}\) be that \(\hat{s}=s_{j}\) and suppose \(s=s_{i}\) for the true smooth parameter.

First of all, it suffices to consider \(M\in \mathcal{D}\) by realizing that if \(M\in (M_{j-1},M_{j})\), then \(f\in H^{s}(\mathcal{X},g;M)\) with \(H^{s}(\mathcal{X},g;M_{j-1})\subset H^{s}(\mathcal{X},g;M)\subset H^{s}(\mathcal{X},g;M_{j})\). Now, we also suppose \(M=M_i\) correspondingly and consider bounding the sum: \[\begin{align} \sum_{j=1}^{N_l}\left(\|\hat{f}_{s_j}-f\|_{w,n}^{2}M_i^{-2}(M_i^2 n/\log n )^{2s_i/(2s_i+d)}\mathbf{1}_{\mathcal{E}_{j}}\right), \end{align}\] conditional on the event that the sample points \(X_1,\ldots,X_n\) satisfy 26 and 40 with \(K=\lfloor M_i^2n \rfloor^{d/(2s_i+d)}\). These two statements hold with probability at least \(1-Cne^{-Cn\epsilon^{d}}-e^{-\lfloor M_i^2n \rfloor^{d/(2s_i+d)}}\). As we will see, the fact that this sum does not explode, relies on the fact that the probabilities of the sets \({\mathcal{E}}_j\) get small as \(n \to \infty\).

First, note that by Cauchy-Schwarz inequality, we have \[\begin{align} &\sum_{j61i}^{N_l}\left(\|\hat{f}_{s_j}-f\|_{w,n}^{2}M_i^{-2}(M_i^2 n/\log n )^{2s_i/(2s_i+d)}\mathbf{1}_{\mathcal{E}_{j}}\right)\\&\le \sum_{j61i}^{N_l}\left(\|\hat{f}_{s_j}-\hat{f}_{s_i}+\hat{f}_{s_j}-f\|_{w,n}^{2}M_i^{-2}(M_i^2 n/\log n )^{2s_i/(2s_i+d)}\mathbf{1}_{\mathcal{E}_{j}}\right)\\&\le \sum_{j61i}^{N_l}\left(2c_0^2 \mathbf{1}_{\mathcal{E}_{j}}+2\left(\|\hat{f}_{s_i}-f\|_{w,n}^{2}M_i^{-2}(M_i^2 n/\log n)^{2s_i/(2s_i+d)}\mathbf{1}_{\mathcal{E}_{j}}\right)\right)\\&\le 2c_0^2+2\left(\|\hat{f}_{s_i}-f\|_{w,n}^{2}M_i^{-2}(M_i^2 n/\log n)^{2s_i/(2s_i+d)}\right). \end{align}\] Therefore, according to Theorem 1, we have: for any \(\delta\in(0,1)\), \[\begin{align} \sum_{j61i}^{N_l}\left(\|\hat{f}_{s_j}-f\|_{w,n}^{2}M_i^{-2}(M_i^2 n/\log n )^{2s_i/(2s_i+d)}\mathbf{1}_{\mathcal{E}_{j}}\right)\lesssim \frac{1}{\delta}, \end{align}\] with probability at least \(1-\delta \log^{-2s_i/(2s_i+d)}n-Cne^{-Cn\epsilon^{d}}-e^{-\lfloor M_i^2n \rfloor^{d/(2s_i+d)}}\).

Next, we consider the other part when \(j<i\): \[\begin{align} \label{sumj60i1} \sum_{j=1}^{i-1}\left(\|\hat{f}_{s_j}-f\|_{w,n}^{2}M_i^{-2}(M_i^2 n/\log n )^{2s_i/(2s_i+d)}\mathbf{1}_{\mathcal{E}_{j}}\right). \end{align}\tag{43}\]

By the definition, on the event \(\mathcal{E}_{j}\), there exists \(s'\in \mathcal{B}\) with \(s'<s_i\) such that \(\|\hat{f}_{s_i}-\hat{f}_{s'}\|_{w,n}>c_0 M'^{-2}(M'^2 n/\log n)^{-s'/(2s'+d)}\). This means \(\|\hat{f}_{s_i}-\hat{f}_{s'}\|_{w,n}^2 M'^{-2}(M'^2 n/\log n)^{2s'/(2s'+d)}>c_0^{2}\). By triangle inequality, this implies we have either \(\|\hat{f}_{s_i}-f\|_{w,n}^2 M'^{-2}(M'^2 n/\log n)^{2s'/(2s'+d)}>c_0^2/4\) or \(\|\hat{f}_{s'}-f\|_{w,n}^2 M'^{-2}(M'^2 n/\log n)^{2s'/(2s'+d)}>c_0^2/4\). Then, we have \[\begin{align} \label{PmalE} \mathbb{P}(\mathcal{E}_{j})&\le \sum_{l=1}^{i-1}\left(\mathbb{P}\left(\|\hat{f}_{s_i}-f\|_{w,n}^2 M_l^{-2}(M_l^2 n/\log n)^{2s_l/(2s_l+d)}>c_0^2/4\right)\right.\nonumber\\&\quad\left.+\mathbb{P}\left(\|\hat{f}_{s_l}-f\|_{w,n}^2 M_l^{-2}(M_l^2 n/\log n)^{2s_l/(2s_l+d)}>c_0^2/4\right)\right). \end{align}\tag{44}\] Since \(l<i\), we have \(f\in H^{s_i}(\mathcal{X},g;M_l)\subset H^{s_{l}}(\mathcal{X},g;M_l)\) for all \(l<i\). Therefore, it suffices to focus on the concentration inequality of \(\hat{f}_{s_l}\) to \(f\), i.e., bounding \[\begin{align} \label{j601part1} \mathbb{P}\left(\|\hat{f}_{s_l}-f\|_{w,n}^2 M_l^{-2}(M_l^2 n/\log n)^{2s_l/(2s_l+d)}>c_0^2/4\right). \end{align}\tag{45}\]

Note that the key problem here is the rate of convergence of \(\|\hat{f}_{s_j}-f\|_{w,n}^{2}\) in 43 does not match the rate \((n/\log n)^{2s_i/(2s_i+d)}\) given there. However, this can be dealt with by controlling the probability of the event \(\mathcal{E}_{j}\). The strategy here is we need a better concentration inequality than what has been proven previously as 39 otherwise the probability of the event \(\mathcal{E}_{j}\) will not decay to \(0\). Observe that the concentration 39 : for \(n\) large enough and with probability smaller than \(1-2\delta\), \[\begin{align} \langle L_{w,n,\epsilon}^{s}f,f\rangle_{w,n}\lesssim \delta^{-1} M^2, \end{align}\] is from the application of Markov’s inequality with \[\begin{align} \mathbb{E}\langle L_{w,n,\epsilon}^{s}f,f\rangle_{w,n}\lesssim M^2, \end{align}\] for \(n\) large enough. While bounding the first moment gives a concentration inequality with probability \(1-2\delta\), establishing a higher moment bound, e.g. the second moment, would result in a better concentration inequality with higher probability similar to [19], which fits in our proof technique.

Starting with \(s=1\) and similar to 28 , we have: for \(n\) large enough, \[\begin{align} \label{varianceconcs611} &\mathop{\mathrm{Var}}\langle L_{w,n,\epsilon}f,f \rangle_{w,n}\nonumber\\\lesssim& \mathop{\mathrm{Var}}\left(\frac{1}{2}\frac{1}{n^2\epsilon^{d+2}}\sum_{i,j=1}^{n}(g(X_i)^{-r}f(X_i)-g(X_j)^{-r}f(X_j))^2g(X_{i})^{1-p}\frac{\eta\left(\frac{\|X_i-X_j\|}{\epsilon}\right)}{g(X_i)^{1-q/2}g(X_j)^{1-q/2}}\right). \end{align}\tag{46}\] For \(i,j\in 1,\ldots,n\), let \[V_{ij}:=(g(X_i)^{-r}f(X_i)-g(X_j)^{-r}f(X_j))^2g(X_{i})^{1-p}\frac{\eta\left(\frac{\|X_i-X_j\|}{\epsilon}\right)}{g(X_i)^{1-q/2}g(X_j)^{1-q/2}}.\]

We have: \[\begin{align} &\mathop{\mathrm{Var}}\left(\sum_{i,j=1}^{n}(g(X_i)^{-r}f(X_i)-g(X_j)^{-r}f(X_j))^2g(X_{i})^{1-p}\frac{\eta\left(\frac{\|X_i-X_j\|}{\epsilon}\right)}{g(X_i)^{1-q/2}g(X_j)^{1-q/2}}\right)\\&=\sum_{i,j=1}^{n}\sum_{l,m=1}^{n}\text{Cov}(V_{ij},V_{lm}). \end{align}\] Now, consider the following four scenarios depending on the cardinality of \(\{i,j,l,m\}\).

  • If \(|\{i,j,l,m\}|=4\), since \(V_{ij}\) and \(V_{lm}\) are independent, we have \(\text{Cov}(V_{ij},V_{lm})=0\).

  • If \(|\{i,j,l,m\}|=3\), without loss of generality, say \(i=l\), we have by Lipschitz condition, \[\begin{align} \text{Cov}(V_{ij},V_{im})&\le \mathbb{E}[V_{ij}V_{im}]\\&\lesssim \epsilon^{2d+4}M^{4}. \end{align}\]

  • If \(|\{i,j,l,m\}|=2\), without loss of generality, say \(i=l\) and \(j=m\), similarly, we obtain \[\begin{align} \text{Cov}(V_{ij},V_{ij})&\le \mathbb{E}V_{ij}^2\\&\lesssim \epsilon^{d+4}M^{4}. \end{align}\]

  • If \(|\{i,j,l,m\}|=1\), we have \(V_{ij}=V_{lm}=0\).

Plugging the above results in 46 , it yields that for \(n\) large enough, \[\begin{align} \mathop{\mathrm{Var}}\langle L_{w,n,\epsilon}f,f \rangle_{w,n}\lesssim \frac{1}{4n^{4}\epsilon^{2d+4}}\left(n^{3}\epsilon^{2d+4}M^{4}+n^2\epsilon^{d+4}M^{4}\right)\lesssim n^{-1}M^4, \end{align}\] where the last step follows by the assumption that \(n\epsilon^{d}\ge 1\). Then, by Markov’s inequality, we obtain: for any \(\delta\in (0,1)\), \[\begin{align} \label{markovvariances611} \mathbb{P}\left(\left|\langle L_{w,n,\epsilon}f,f \rangle_{w,n}-\mathbb{E} \langle L_{w,n,\epsilon}f,f \rangle_{w,n}\right|\ge \frac{1}{\delta} M^{2}\right)\lesssim \frac{\delta^{2}}{n}. \end{align}\tag{47}\] Combining 47 and 29 , we conclude that for \(n\) large enough, \[\begin{align} \langle L_{w,n,\epsilon}f,f \rangle_{w,n}\lesssim \frac{1}{\delta}M^2 \end{align}\] holds with probability not less than \(1-\frac{\delta}{n^2}\). Furthermore, following a similar argument in Lemma 6, one can show the above high-probability bound also holds for the case \(s>1\). Thus, under the additional Lipschitz assumption that \(|f_{g}(x)-f_{g}(x')|\le M\|x-x'\|\), we establish a better bound for the empirical weighted Sobolev seminorm: for all \(s\in\mathbb{N}_{+}\) and \(n\) large enough, \[\begin{align} \langle L_{w,n,\epsilon}^s f,f \rangle_{w,n}\lesssim \frac{1}{\delta}M^2, \end{align}\] with probability at least \(1-C\frac{\delta^2}{n}\).

Conditional on the event that the sample points \(X_1,\ldots,X_n\) satisfy 26 and 40 with \(K=\lfloor M^2n \rfloor^{d/(2s+d)}\), following the proof of Theorem 1 to obtain 42 by using the better concentration inequality we derived above instead, we have for \(n\) large enough, \[\begin{align} \|\hat{f}-f\|_{w,n}^{2}\lesssim \frac{1}{\delta}M^2(M^2n)^{-2s/(2s+d)}, \end{align}\] with probability at least \(1-C\delta^2 n^{-1}-Cne^{-Cn\epsilon^{d}}-e^{-\lfloor M^2n \rfloor^{d/(2s+d)}}\) under the minimax optimal setting for \(M\).

Now, returning to our mission 45 , by setting \(\delta^{-1}=c_{0}^2/4\cdot \log^{2s_l/(2s_l+d)} n\), we have: \[\begin{align} &\mathbb{P}\left(\|\hat{f}_{s_l}-f\|_{w,n}^2 M_l^{-2}(M_l^2 n/\log n)^{2s_l/(2s_l+d)}>c_0^2/4\right)\\&\le 16C c_0^{-4} n^{-1}\log^{-2s_l/(2s_l+d)} n+Cne^{-Cn\epsilon^{d}}+e^{-\lfloor M_{\min}^2 n \rfloor^{d/(2s+d)}}. \end{align}\] With 44 , we obtain: \[\begin{align} \mathbb{P}(\mathcal{E}_{j})\le 16C c_0^{-4} n^{-1}\log^{1-2s_{\min}/(2s_{\min}+d)} n+Cn e^{-Cn\epsilon^{d}}\log n +e^{-\lfloor M_{\min}^2 n \rfloor^{d/(2s+d)}}\log n . \end{align}\] Combining the above result with 43 and noting that on \(\mathcal{E}_{j}^{c}\), \(\mathbf{1}_{\mathcal{E}_{j}}=0\), it yields that \[\begin{align} \sum_{j=1}^{i-1}\left(\|\hat{f}_{s_j}-f\|_{w,n}^{2}M_i^{-2}(M_i^2 n/\log n )^{2s_i/(2s_i+d)}\mathbf{1}_{\mathcal{E}_{j}}\right)\lesssim \frac{1}{\delta}, \end{align}\] with probability at least \[1-\delta \log^{-2s_i/(2s_i+d)}n-16C c_0^{-4} n^{-1}\log^{2-2s_{\min}/(2s_{\min}+d)} n-Cn e^{-Cn\epsilon^{d}}\log^2 n -e^{-\lfloor M_{\min}^2 n \rfloor^{d/(2s+d)}}\log^2 n.\] ◻

5 Conclusion↩︎

In this work, we provide adaptive and non-adaptive rates of convergence, in Theorem 1 and 2 respectively, for estimating a true regression function lying belonging to the Sobolev space. Our estimators are based on performing principal components regression based on the eigenvectors of the weighted graph Laplacian matrix, and using Lepski’s method for deriving the adaptive results. Our contributions expand upon the non-adaptive outcome outlined in [1], which was originally established for a particular normalized graph Laplacian. This extension encompasses a broad spectrum of weighted Laplacian matrices commonly employed in practical applications, including the unnormalized Laplacian and the random walk Laplacian among them.

Future works include (i) relaxing the assumption that the density \(g\) is bounded from below, (ii) developing confidence intervals for the estimators by establishing asymptotic normality results and developing related bootstrap procedures, and (iii) developing estimators that are instance-optimal in the sense of [55], i.e., estimators that achieve the best possible rate for a given combination of the true regression function \(f\) and the sampling density \(g\) by adaptively picking the parameters \(p,q\) and \(r\) in the weighted graph Laplacian matrix.

Acknowledgement.↩︎

We gratefully acknowledge support for this project from the National Science Foundation via grant NSF-DMS-2053918.

6 Auxiliary results↩︎

In the subsequent two sections, we introduce some important properties of KDE and eigenvalues of the weighted Laplacian matrices \(L_{w,n,\epsilon}\) and the weighted Laplacian operators \(\mathcal{L}_{w}\) used in the previous proof respectively.

6.1 Property of kernel density estimation↩︎

Consider a Kernel density estimator (KDE) on \(\mathcal{X}\): \[\begin{align} g_{n}(x):=\frac{1}{n\epsilon^{d}}\sum_{j=1}^{n}\eta\left(\frac{\|x-X_j\|}{\epsilon}\right), \end{align}\] where \(\eta\) is a kernel function.

In [3], it has been proven that the above KDE satisfies the following almost sure convergence: \[\begin{align} \|g_n(x)-\mathbb{E}g_{n}(x)\|_{\infty}=O_{a.s.}\left(\sqrt{\frac{|\log \epsilon|}{n\epsilon^{d}}}\right), \end{align}\] given the assumption that the kernel \(\eta\) satisfies the kernel VC-type condition [a4] and see Remark 2 for more details.

As for the bias, it is well-known that there exists a boundary effect on KDE due to the fact that (with probability 1) all the samples lie in the support of the density. However, when we are far enough away from the boundary such that \(B_{x}(\epsilon)\subset \mathcal{X}\), we have \[\begin{align} \left|\mathbb{E}g_{n}(x)-g(x)\right|&=\left|\int_{\mathcal{X}}\frac{1}{\epsilon^d}\eta\left(\frac{\|x-y\|}{\epsilon}\right)g(y)dy-g(x)\right|\\&\le \int_{\|z\|\le 1}\eta(\|z\|)|g(x+\epsilon z)-g(x)|dz\\&\lesssim \epsilon \int_{\mathbb{R}^{d}}\|z\|\eta(\|z\|)dz\lesssim \epsilon, \end{align}\] where the last step is by the assumption that \(g\) is Lipschitz. As a result, for such values of \(x\),\[\begin{align} \|g_n(x)-g(x)\|_{\infty}=O_{a.s.}\left(\sqrt{\frac{|\log \epsilon|}{n\epsilon^{d}}}+\epsilon\right). \end{align}\]

When \(x\) is near the boundary, i.e., \(B_{x}(\epsilon)\not\subset \mathcal{X}\), we have \(X_i \in B_x(\epsilon)\) with probability less than \(C\epsilon\) for some constant \(C>0\). Then: \[\begin{align} \mathbb{E}g_{n}(x)\le g_{\max}\int_{\|z\|\le 1}\eta(\|z\|)dz<\infty, \end{align}\] and \[\begin{align} \mathbb{E}g_{n}(x)= \int_{\{\|z\|\le 1\}\cap\{x+\epsilon z\in\mathcal{X}\} }\eta(\|z\|)g(x+\epsilon z)dz\ge g_{\min}\int_{\{\|z\|\le 1\}\cap\{x+\epsilon z\in\mathcal{X}\} }\eta(\|z\|)dz>0, \end{align}\] under the assumption [a1] on \(\mathcal{X}\). Therefore, we have for all \(x\in\mathcal{X}\), \(g_{n}(x)\) is bounded from above and below a.s. for \(n\) large enough.

By conditioning on \(X_i\) and the law of total probability, we have for all \(i\in[n]\) and \(B_{\epsilon}(X_i)\in\mathcal{X}\), \[\begin{align} \Delta^{-}(n,\epsilon,\eta,g)\le g_{n}(X_i)-g(X_{i})\le \Delta^{+}(n,\epsilon,\eta,g), \end{align}\] almost surely with \[\begin{align} \Delta^{-}(n,\epsilon,\eta,g)&:=-\frac{1}{n}g_{\max}+\frac{\eta(0)}{n\epsilon^{d}}-\frac{n-1}{n}\Delta(n,\epsilon),\\ \Delta^{+}(n,\epsilon,\eta,g)&:=-\frac{1}{n}g_{\min}+\frac{\eta(0)}{n\epsilon^{d}}+\frac{n-1}{n}\Delta(n,\epsilon), \end{align}\] and \[\begin{align} \Delta(n,\epsilon):=\sqrt{\frac{|\log \epsilon|}{n\epsilon^{d}}}+\epsilon. \end{align}\]

Since we are seeking a high-probability bound in Theorems 1, it is not necessarily required to have an exact estimation near the boundary, which happens with probability of the order \(\epsilon\). However, various approaches including data reflection, transformations, boundary kernels and local likelihood, have been proposed for boundary correction.

6.2 Property of eigenvalues↩︎

In this section, we focus on introducing some results on the eigenvalues of the weighted Laplacian \(L_{n,w,\epsilon}\) and the weighted Laplacian operator \(\mathcal{L}_{w}\) based on analysis in [4], [19].

6.2.1 ↩︎

For a probability measure \(G\) defined on \(\mathcal{X}\) and a map \(T:\mathcal{X}\rightarrow \mathcal{X}\), denote by \(T_{\sharp G}\) the push-forward of \(G\) by \(T\), i.e., the measure such that for any Borel subset \(U\subseteq \mathcal{X}\), it holds that \[\begin{align} T_{\sharp G}(U):=G(T^{-1}(U)). \end{align}\] When \(T_{\sharp G}\) is taken as the empirical measure of \(G\) denoted by \(G_{n}\), \(T\) is called the transportation map between \(G\) and \(G_{n}\) and we define the \(\infty\)-transportation distance between \(G\) and \(G_{n}\) as \[\begin{align} \label{ot} d_{\infty}(G,G_{n}):=\underset{T:T_{\sharp G}=G_{n}}{\text{inf}}\|T-\text{Id}\|_{L^{\infty}(G)}, \end{align}\tag{48}\] where \(\text{Id}\) is the identity mapping. We denote by \(\tilde{T}\) the optimal \(\infty\)-optimal transport map (\(\infty\)-OT map) between \(G\) and \(G_{n}\), i.e,, the map that achieves the infimum 48 .

Now, following [19], let \[\begin{align} \tilde{\delta}&:=\max\{n^{-1/d},C\epsilon\}, \end{align}\] where \(C>0\) is some constant not depending on \(n\) and we also let \(\theta>0\) be some constant not depending on \(n\). We present the following result from [19].

Proposition 1 (cf. Proposition 3 of [19]). Under the assumptions [a1] and [a2], with probability greater than \(1-Cne^{-Cn\theta^{2} \tilde{\delta}^{d}}\), there exists a probability measure \(\tilde{G}_{n}\) with density \(\tilde{g}_{n}\) such that \[\begin{align} d_{\infty}(G_{n},\tilde{G}_{n})\le C\tilde{\delta}, \end{align}\] and such that \[\begin{align} \|g-\tilde{g}_{n}\|_{\infty}\le C(\theta+\tilde{\delta}), \end{align}\] where \(C>0\) is some constant not depending on \(n\).

6.2.2 ↩︎

The key procedure adopted in [4] is to construct two maps: a discretization map \(\tilde{\mathcal{P}}:L^{2}(G)\rightarrow L^{2}(\tilde{G}_{n})\) and an interpolation map \(\tilde{\mathcal{I}}:L^{2}(\tilde{G}_{n})\rightarrow L^{2}(G)\), that are "almost" isometries.

For \(X_{i}, i=1,\ldots,n\), define \[\begin{align} \tilde{U}_{i}:=\tilde{T}^{-1}(\{X_{i}\}). \end{align}\] Then, we define the contractive discretization map \(\tilde{\mathcal{P}}:L^{2}(G)\rightarrow L^{2}(\tilde{G}_{n})\) by \[\begin{align} (\tilde{\mathcal{P}}f)(X_i):=n\cdot \int_{\tilde{U}_{i}}f(x)\tilde{g}_{n}(x)dx. \end{align}\] Moreover, the interpolation map \(\tilde{\mathcal{I}}:L^{2}(\tilde{G}_{n})\rightarrow L^{2}(G)\) is given by \[\begin{align} \tilde{\mathcal{I}}u:=\Lambda_{\epsilon-2\tilde{\delta}}(\tilde{\mathcal{P}}^{*}u). \end{align}\] Here, \(\tilde{\mathcal{P}}^{*}=u\circ \tilde{T}\) is the adjoint of \(\tilde{\mathcal{P}}_{n}\), i.e., \[\begin{align} (\tilde{\mathcal{P}}^{*}u)(x)=\sum_{j=1}^{n}u(x_i)\mathbf{1}_{x\in U_{i}}, \end{align}\] and \(\Lambda_{\epsilon-2\tilde{\delta}}\) is a kernel smoothing operator with respect to a kernel \(K\) (defined below) with the bandwidth \(\epsilon-2\tilde{\delta}\). The kernel \(K\) is defined by \[\begin{align} K(x,y):=\frac{1}{\epsilon^{d}}\zeta\left(\frac{\|x-y\|}{\epsilon}\right), \end{align}\] where \[\begin{align} \zeta(t):=\frac{1}{\sigma_1}\int_{t}^{\infty}\eta(s)sds. \end{align}\] Then, define the operator \(\Lambda_{h}\), for \(h>0\), by \[\begin{align} \Lambda_{h}f(x):=\frac{1}{\tau(x)}\int_{\mathcal{X}}K(x,y)f(y)g(y)dy, \end{align}\] where \(\tau(x):=\int_{\mathcal{X}}K(x,y)g(y)dy\) is a normalization factor.

Furthermore, we define the Dirichlet energies: \[\begin{align} b_{w,\epsilon}(u):=\langle L_{w,n,\epsilon}u,u\rangle_{g^{p-r}}, \end{align}\] and \[\begin{align} D_{w}(f):= \left\{ \begin{aligned} &\int_{\mathcal{X}}\|\nabla f_{g}(x)\|^{2}g(x)^{q}dx \qquad \text{if f\in H^{1}(\mathcal{X},g)},\\ &\infty\qquad\qquad\qquad\qquad\qquad \text{o.w.} \end{aligned} \right. \end{align}\] Clearly, when \(w=(p,q,r)=(1,2,0)\), the above Dirichlet energies become the ones associated with the unnormalized Laplacian, i.e., \(w=(p,q,r)=(1,2,0)\): \[\begin{align} b_{\epsilon}(u):=\langle (\tilde{D}-\tilde{W})u,u\rangle, \end{align}\] and \[\begin{align} D_{2}(f):= \left\{ \begin{aligned} &\int_{\mathcal{X}}\|\nabla f(x)\|^{2}g(x)^{2}dx \qquad \text{if f\in H^{1}(\mathcal{X})},\\ &\infty\qquad\qquad\qquad\qquad\qquad \text{o.w.} \end{aligned} \right. \end{align}\]

The following two propositions from [19], whose proof is based on Proposition 1, shows the fact that discretization map \(\tilde{\mathcal{P}}\) and interpolation map \(\tilde{\mathcal{I}}\) are almost isometries.

Proposition 2 (cf. Proposition 4 of [19]). With probability at least \(1-C ne^{-C n \theta^{2} \tilde{\delta}^{d}}\), we have for any \(f\in L^{2}(\mathcal{X})\), \[\begin{align} b_{\epsilon}(\tilde{\mathcal{P}}f)\le C(1+C(\theta+\tilde{\delta}))\left(1+C \frac{\tilde{\delta}}{\epsilon}\right)\sigma_{1}\cdot D_{2}(f), \end{align}\] and for any \(u\in L^{2}(G_{n})\), \[\begin{align} \sigma_1 D_{2}(\tilde{\mathcal{I}}u)\le C(1+C(\theta+\tilde{\delta}))\left(1+C \frac{\tilde{\delta}}{\epsilon}\right)\cdot b_{\epsilon}(u). \end{align}\]

Proposition 3 (cf. Proposition 5 of [19]). With probability at least \(1-C ne^{-C n \theta^{2} \tilde{\delta}^{d}}\), we have for any \(f\in L^{2}(\mathcal{X})\), \[\begin{align} \bigg|\|f\|_{L^{2}(G)}^2-\|\tilde{\mathcal{P}}f\|_{L^{2}(G_{n})}^{2}\bigg|\le C\tilde{\delta}\|f\|_{L^{2}(G)}\sqrt{D_{2}(f)}+C(\theta+\tilde{\delta})\|f\|_{L^{2}(G)}^{2}, \end{align}\] and for any \(u\in L^{2}(G_{n})\), \[\begin{align} \bigg|\|u\|_{L^{2}(G_{n})}^2-\|\tilde{\mathcal{I}}u\|_{L^{2}(G)}^{2}\bigg|\le C\epsilon\|u\|_{L^{2}(G_{n})}\sqrt{b_{\epsilon}(u)}+C(\theta+\tilde{\delta})\|u\|_{L^{2}(G_{n})}^{2}. \end{align}\]

Now, as we consider the Dirichlet energies \(b_{w,\epsilon}(u)\) and \(D_{w}(f)\) for the weighted Laplacian. Note that by the boundedness assumption of the density \(g\), we have there exist constants \(C>0\) and \(C'>0\) such that \[\begin{align} C'\int_{\mathcal{X}}\|\nabla f_{g}(x)\|^{2}g(x)^{q}dx\le \int_{\mathcal{X}}\|\nabla f_{g}(x)\|^{2}g(x)^{2}dx\le C\int_{\mathcal{X}}\|\nabla f_{g}(x)\|^{2}g(x)^{q}dx. \end{align}\] Also, with transformation \(v:=D^{-r/(q-1)}u\) for \(q\neq 1\), we have \[\begin{align} \langle L_{w,n,\epsilon}u,u\rangle_{g^{p-r}}=\langle (D-W)v,v\rangle. \end{align}\] This also holds for \(q=1\) by definition 3 . According to Section 6.1, we obtain that there exist constants \(C>0\) and \(C'>0\) such that for large \(n\), almost surely, \[\begin{align} C'b_{w,\epsilon}(u)\le b_{\epsilon}(u)\le Cb_{w,\epsilon}(u). \end{align}\]

Consequently, following the proof in [19], we present the following propositions parallelling Proposition 2 and 3 associated with the weighted case.

Proposition 4. With probability at least \(1-C ne^{-C n \theta^{2} \tilde{\delta}^{d}}\), we have for any \(f\in L^{2}(\mathcal{X},g^{p-r} )\), \[\begin{align} b_{\epsilon}(\tilde{\mathcal{P}}f)\le C(1+C(\theta+\tilde{\delta}))\left(1+C \frac{\tilde{\delta}}{\epsilon}\right)\sigma_{1}\cdot D_{2}(f), \end{align}\] and for any \(u\in L^{2}(G_{n})\), \[\begin{align} \sigma_1 D_{2}(\tilde{\mathcal{I}}u)\le C(1+C(\theta+\tilde{\delta}))\left(1+C \frac{\tilde{\delta}}{\epsilon}\right)\cdot b_{\epsilon}(u), \end{align}\] where \(C>0\) is some constant not depending on \(n\) or \(f\).

Proposition 5. With probability at least \(1-C ne^{-C n \theta^{2} \tilde{\delta}^{d}}\), we have for any \(f\in L^{2}(\mathcal{X},g^{p-r})\), \[\begin{align} \bigg|\|f\|_{L^{2}(\mathcal{X},g^{p-r})}^2-\|\tilde{\mathcal{P}}f\|_{w,n}^{2}\bigg|\le C\tilde{\delta}\|f\|_{L^{2}(\mathcal{X},g^{p-r})}\sqrt{D_{w}(f)}+C(\theta+\tilde{\delta})\|f\|_{L^{2}(\mathcal{X},g^{p-r})}^{2}+\Delta(n,\epsilon,\eta,g)+\epsilon, \end{align}\] and for any \(u\in L^{2}(G_{n})\), \[\begin{align} \bigg|\|u\|_{w,n}^2-\|\tilde{\mathcal{I}}u\|_{L^{2}(\mathcal{X},g^{p-r})}^{2}\bigg|\le C\epsilon\|u\|_{w,n}\sqrt{b_{w,\epsilon}(u)}+C(\theta+\tilde{\delta})\|u\|_{w,n}^{2}+\Delta(n,\epsilon,\eta,g)+\epsilon, \end{align}\] where \(C>0\) is some constant not depending on \(n\) or \(f\) and \[\begin{align} \Delta(n,\epsilon,\eta,g)&=\frac{1}{n}g_{\max}+\frac{\eta(0)}{n\epsilon^{d}}+\frac{n-1}{n}\Delta(n,\epsilon),\\ \Delta(n,\epsilon)&:=\sqrt{\frac{|\log \epsilon|}{n\epsilon^{d}}}+\epsilon. \end{align}\]

Also, we state the following Weyl’s law whose proof follows [56].

Proposition 6 (Weyl’s law). There exist constants \(C,C'>0\) such that \[\begin{align} C'l^{2/d}\le \lambda_{l}(\mathcal{L}_{w})\le Cl^{2/d}, \end{align}\] for all \(l\ge 2\).

Therefore, by following [19] except that we replace Propositions 2 and 3 by Propositions 4 and 5, we obtain the following bound for the eigenvalues.

Lemma 7. Under the assumptions [a1] and [a2], there exist constant \(C,C'>0\) and \(N>0\) such that for \(n\ge N\) and \(C(\log n/n)^{1/d}\le \epsilon\le C\), with probability larger than \(1-Cne^{-Cn\epsilon^{d}}\), it holds that \[\begin{align} C'\min\{l^{2/d},\epsilon^{-2}\}\le \lambda_{l}(L_{w,n,\epsilon})\le C\min\{l^{2/d},\epsilon^{-2}\}, \end{align}\] for all \(2\le l\le n\).

References↩︎

[1]
Alden Green, Sivaraman Balakrishnan, and Ryan J Tibshirani. . Information and Inference: A Journal of the IMA, 12(3):2423–2502, 2023.
[2]
Franca Hoffmann, Bamdad Hosseini, Assad A Oberai, and Andrew M Stuart. . Applied and Computational Harmonic Analysis, 56:189–249, 2022.
[3]
Evarist Giné and Armelle Guillou. Rates of strong uniform consistency for multivariate kernel density estimators. In Annales de l’Institut Henri Poincare (B) Probability and Statistics, volume 38, pages 907–921. Elsevier, 2002.
[4]
Jeff Calder and Nicolas Garcia Trillos. . Applied and Computational Harmonic Analysis, 60:123–175, 2022.
[5]
Yair Weiss. . In Proceedings of the seventh IEEE international conference on computer vision, volume 2, pages 975–982. IEEE, 1999.
[6]
Jianbo Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888–905, August 2000.
[7]
Andrew Y. Ng, Michael I. Jordan, and Yair Weiss. . In Neural Information Processing Systems: Natural and Synthetic, NIPS’01, pages 849–856, January 2001.
[8]
Ulrike Von Luxburg. A tutorial on spectral clustering. Statistics and computing, 17:395–416, 2007.
[9]
Jian Sun, Maks Ovsjanikov, and Leonidas Guibas. A concise and provably informative multi-scale signature based on heat diffusion. In Computer graphics forum, volume 28, pages 1383–1392. Wiley Online Library, 2009.
[10]
Mathieu Andreux, Emanuele Rodolà, Mathieu Aubry, and Daniel Cremers. Anisotropic Laplace-Beltrami Operators for Shape Analysis. In Lourdes Agapito, Michael M. Bronstein, and Carsten Rother, editors, Computer Vision - ECCV 2014 Workshops, Lecture Notes in Computer Science, pages 299–312, 2015.
[11]
David B Dunson, Hau-Tieng Wu, and Nan Wu. . Applied and Computational Harmonic Analysis, 55:282–336, 2021.
[12]
Sridhar Mahadevan and Mauro Maggioni. . Journal of Machine Learning Research, 8(10), 2007.
[13]
Yifan Wu, George Tucker, and Ofir Nachum. . In International Conference on Learning Representations, 2019.
[14]
Mikhail Belkin and Partha Niyogi. . Neural computation, 15(6):1373–1396, 2003.
[15]
Ronald R Coifman and Stéphane Lafon. Diffusion maps. Applied and computational harmonic analysis, 21(1):5–30, 2006.
[16]
Mikhail Belkin, Partha Niyogi, and Vikas Sindhwani. . Journal of machine learning research, 7(11), 2006.
[17]
Yu-Xiang Wang, James Sharpnack, Alex Smola, and Ryan Tibshirani. Trend filtering on graphs. In Artificial Intelligence and Statistics, pages 1042–1050. PMLR, 2015.
[18]
Yongwan Chun, Daniel A Griffith, Monghyeon Lee, and Parmanand Sinha. Eigenvector selection with stepwise regression techniques to construct eigenvector spatial filters. Journal of Geographical Systems, 18:67–85, 2016.
[19]
Alden Green, Sivaraman Balakrishnan, and Ryan Tibshirani. . In International Conference on Artificial Intelligence and Statistics, pages 2602–2610. PMLR, 2021.
[20]
Olivier Bousquet, Olivier Chapelle, and Matthias Hein. Measure based regularization. Advances in Neural Information Processing Systems, 16, 2003.
[21]
John Rice. Bandwidth choice for nonparametric regression. The Annals of Statistics, pages 1215–1230, 1984.
[22]
Nicolás Garcı́a Trillos, Ryan Murray, and Matthew Thorpe. . arXiv preprint arXiv:2209.02305, 2022.
[23]
Olympio Hacquard, Krishnakumar Balasubramanian, Gilles Blanchard, Clément Levrard, and Wolfgang Polonik. Topologically penalized regression on manifolds. The Journal of Machine Learning Research, 23(1):7233–7271, 2022.
[24]
Xiaojin Zhu, Zoubin Ghahramani, and John D Lafferty. . In Proceedings of the 20th International conference on Machine learning (ICML-03), pages 912–919, 2003.
[25]
Xueyuan Zhou and Nathan Srebro. Error analysis of laplacian eigenmaps for semi-supervised learning. In Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, pages 901–908. JMLR Workshop and Conference Proceedings, 2011.
[26]
Ann B Lee and Rafael Izbicki. A spectral series approach to high-dimensional nonparametric regression. 2016.
[27]
Lee H Dicker, Dean P Foster, and Daniel Hsu. Kernel ridge vs. principal component regression: Minimax bounds and the qualification of regularization operators. 2017.
[28]
Nicolas Garcia Trillos and Ryan W Murray. . SIAM Journal on Mathematics of Data Science, 2(3):705–739, 2020.
[29]
Mikhail Belkin and Partha Niyogi. . In International Conference on Computational Learning Theory, pages 486–500. Springer, 2005.
[30]
Matthias Hein, Jean-Yves Audibert, and Ulrike Von Luxburg. . In International Conference on Computational Learning Theory, pages 470–485. Springer, 2005.
[31]
Evarist Giné and Vladimir Koltchinskii. . Lecture Notes-Monograph Series, pages 238–259, 2006.
[32]
Matthias Hein, Jean-Yves Audibert, and Ulrike von Luxburg. . Journal of Machine Learning Research, 8(6), 2007.
[33]
Ulrike von Luxburg, Mikhail Belkin, and Olivier Bousquet. Consistency of spectral clustering. The Annals of Statistics, pages 555–586, 2008.
[34]
Lorenzo Rosasco, Mikhail Belkin, and Ernesto De Vito. On learning with integral operators. Journal of Machine Learning Research, 11(2), 2010.
[35]
Nicolas Garcia Trillos and Dejan Slepčev. A variational approach to the consistency of spectral clustering. Applied and Computational Harmonic Analysis, 45(2):239–281, 2018.
[36]
Zuoqiang Shi. . arXiv preprint arXiv:1507.00151, 2015.
[37]
Nicolás Garcı́a Trillos, Moritz Gerlach, Matthias Hein, and Dejan Slepcev. . Foundations of Computational Mathematics, 20(4):827–887, 2020.
[38]
Frédéric Chazal, Ilaria Giulini, and Bertrand Michel. . Advances in Neural Information Processing Systems, 29, 2016.
[39]
Claire Lacour and Pascal Massart. . Stochastic Processes and their Applications, 126(12):3774–3789, 2016.
[40]
Mikhail Belkin, Qichao Que, Yusu Wang, and Xueyuan Zhou. . In Conference on learning theory, pages 36–1. JMLR Workshop and Conference Proceedings, 2012.
[41]
Hans Triebel. Theory of Function Spaces. Springer–Modern Birkhäuser Classics, 1983.
[42]
Lawrence C Evans. Partial differential equations, volume 19. American Mathematical Society, 2022.
[43]
László Györfi, Michael Köhler, Adam Krzyżak, and Harro Walk. A distribution-free theory of nonparametric regression, volume 1. Springer, 2002.
[44]
Larry Wasserman. All of nonparametric statistics. Springer Science & Business Media, 2006.
[45]
Alexandre B. Tsybakov. Introduction to Nonparametric Estimation. Springer, 2008.
[46]
Deborah Nolan and David Pollard. U-processes: Rates of convergence. The Annals of Statistics, 15, 1987.
[47]
Evarist Giné and Richard Nickl. Mathematical foundations of infinite-dimensional statistical models. Cambridge university press, 2021.
[48]
OV Lepskii. . Theory of Probability & Its Applications, 35(3):454–466, 1991.
[49]
Lucien Birgé. . Lecture Notes-Monograph Series, pages 113–133, 2001.
[50]
Michael Chichignoud, Johannes Lederer, and Martin J Wainwright. . The Journal of Machine Learning Research, 17(1):8162–8181, 2016.
[51]
Pierre C Bellec, Guillaume Lecué, and Alexandre B Tsybakov. . The Annals of Statistics, 46(6B):3603–3642, 2018.
[52]
Krishnakumar Balasubramanian, Tong Li, and Ming Yuan. On the optimality of kernel-embedding based goodness-of-fit tests. The Journal of Machine Learning Research, 22(1):1–45, 2021.
[53]
Giovanni Leoni. A first course in Sobolev spaces. American Mathematical Soc., 2017.
[54]
Beatrice Laurent and Pascal Massart. Adaptive estimation of a quadratic functional by model selection. Annals of Statistics, pages 1302–1338, 2000.
[55]
M Hoffman and Oleg Lepski. Random rates in anisotropic regression (with a discussion and a rejoinder by the authors). The Annals of Statistics, 30(2):325–396, 2002.
[56]
Matthew M Dunlop, Dejan Slepčev, Andrew M Stuart, and Matthew Thorpe. Large data and zero noise limits of graph-based semi-supervised learning algorithms. Applied and Computational Harmonic Analysis, 49(2):655–697, 2020.

  1. This procedure is refered to as PCR-LE in [1].↩︎

  2. If there is additional information, like \(s>10\), one can pick \(s_{\min}=10\). Hence, we present out result with a generic \(s_{\min}\).↩︎

  3. We remark here that the factor 2 is missing in [1].↩︎