Learning the smoothness of noisy curves with application to online curve estimation

8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Combining information both within and across trajectories, we propose a simple estimator for the local regularity of the trajectories of a stochastic process. Independent trajectories are measured with errors at randomly sampled time points. The proposed approach is model-free and applies to a large class of stochastic processes. Non-asymptotic bounds for the concentration of the estimator are derived. Given the estimate of the local regularity, we build a nearly optimal local polynomial smoother from the curves from a new, possibly very large sample of noisy trajectories. We derive non-asymptotic pointwise risk bounds uniformly over the new set of curves. Our estimates perform well in simulations, in both cases of differentiable or non-differentiable trajectories. Real data sets illustrate the effectiveness of the new approaches.

Cite

CITATION STYLE

APA

Golovkine, S., Klutchnikoff, N., & Patilea, V. (2022). Learning the smoothness of noisy curves with application to online curve estimation. Electronic Journal of Statistics, 16(1), 1485–1560. https://doi.org/10.1214/22-EJS1997

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free