Optimal Function-on-Scalar Regression over Complex Domains

02/19/2019
by   Matthew Reimherr, et al.
0

In this work we consider the problem of estimating function-on-scalar regression models when the functions are observed over multi-dimensional or manifold domains and with potentially multivariate output. We establish the minimax rates of convergence and present an estimator based on reproducing kernel Hilbert spaces that achieves the minimax rate. To better interpret the derived rates, we extend well-known links between RKHS and Sobolev spaces to the case where the domain is a compact Riemannian manifold. This is accomplished using an interesting connection to Weyl's Law from partial differential equations. We conclude with a numerical study and an application to 3D facial imaging.

READ FULL TEXT
research
08/26/2021

Learning Partial Differential Equations in Reproducing Kernel Hilbert Spaces

We propose a new data-driven approach for learning the fundamental solut...
research
01/01/2020

On the Improved Rates of Convergence for Matérn-type Kernel Ridge Regression, with Application to Calibration of Computer Models

Kernel ridge regression is an important nonparametric method for estimat...
research
06/13/2020

Sample complexity and effective dimension for regression on manifolds

We consider the theory of regression on a manifold using reproducing ker...
research
11/14/2021

Minimax Optimal Regression over Sobolev Spaces via Laplacian Eigenmaps on Neighborhood Graphs

In this paper we study the statistical properties of Principal Component...
research
10/18/2021

Kernel-based estimation for partially functional linear model: Minimax rates and randomized sketches

This paper considers the partially functional linear model (PFLM) where ...
research
09/15/2020

Minimax optimal estimator in the stochastic inverse problem for exponential Radon transform

In this article, we consider the problem of inverting the exponential Ra...
research
11/25/2020

Minimax Estimation of Distances on a Surface and Minimax Manifold Learning in the Isometric-to-Convex Setting

We start by considering the problem of estimating intrinsic distances on...

Please sign up or login with your details

Forgot password? Click here to reset