The Goldenshluger-Lepski Method for Constrained Least-Squares Estimators over RKHSs

11/02/2018
by   Stephen Page, et al.
0

We study an adaptive estimation procedure called the Goldenshluger-Lepski method in the context of reproducing kernel Hilbert space (RKHS) regression. Adaptive estimation provides a way of selecting tuning parameters for statistical estimators using only the available data. This allows us to perform estimation without making strong assumptions about the estimand. In contrast to procedures such as training and validation, the Goldenshluger-Lepski method uses all of the data to produce non-adaptive estimators for a range of values of the tuning parameters. An adaptive estimator is selected by performing pairwise comparisons between these non-adaptive estimators. Applying the Goldenshluger-Lepski method is non-trivial as it requires a simultaneous high-probability bound on all of the pairwise comparisons. In the RKHS regression context, we choose our non-adaptive estimators to be clipped least-squares estimators constrained to lie in a ball in an RKHS. Applying the Goldenshluger-Lepski method in this context is made more complicated by the fact that we cannot use the L^2 norm for performing the pairwise comparisons as it is unknown. We use the method to address two regression problems. In the first problem the RKHS is fixed, while in the second problem we adapt over a collection of RKHSs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/04/2018

On approximate least squares estimators of parameters on one-dimensional chirp signal

Chirp signals are quite common in many natural and man-made systems like...
research
03/22/2016

Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons

We study methods for aggregating pairwise comparison data in order to es...
research
04/30/2020

Adaptive Robust Kernels for Non-Linear Least Squares Problems

State estimation is a key ingredient in most robotic systems. Often, sta...
research
05/10/2021

Adaptive estimation in symmetric location model under log-concavity constraint

We revisit the problem of estimating the center of symmetry θ of an unkn...
research
09/09/2019

Convergence of least squares estimators in the adaptive Wynn algorithm for a class of nonlinear regression models

The paper continues the authors' work on the adaptive Wynn algorithm in ...
research
09/17/2023

On adaptive kernel intensity estimation on linear networks

In the analysis of spatial point patterns on linear networks, a critical...
research
03/29/2018

Efficient First-Order Algorithms for Adaptive Signal Denoising

We consider the problem of discrete-time signal denoising, focusing on a...

Please sign up or login with your details

Forgot password? Click here to reset