LOW RANK ESTIMATION OF SMOOTH KERNELS ON GRAPHS

Let (V, A) be a weighted graph with a finite vertex set V, with a symmetric matrix of nonnegative weights A and with Laplacian .. Let S * : V . V . . be a symmetric kernel defined on the vertex set V. Consider n i.i.d. observations (X j , X. j , Y j ), j = 1,..., n, where X j , X. j are independent random vertices sampled from the uniform distribution in V and Y j . . is a real valued response variable such that ..(Y j |X j , X. j ) = S * (X j , X. j ), j = 1,..., n. The goal is to estimate the kernel S * based on the data (X 1 , X. 1 , Y 1 ),..., (X n , X. n , Y n ) and under the assumption that S * is low rank and, at the same time, smooth on the graph (the smoothness being characterized by discrete Sobolev norms defined in terms of the graph Laplacian). We obtain several results for such problems including minimax lower bounds on the L 2 -error and upper bounds for penalized least squares estimators both with nonconvex and with convex penalties.