English
Related papers

Related papers: On-line tracking of a smooth regression function

200 papers

We want to recover the regression function in the single-index model. Using an aggregation algorithm with local polynomial estimators, we answer in particular to the second part of Question~2 from Stone (1982) on the optimal convergence…

Statistics Theory · Mathematics 2007-12-04 Stéphane Gaïffas , Guillaume Lecué

We propose to smooth the entire objective function, rather than only the check function, in a linear quantile regression context. Not only does the resulting smoothed quantile regression estimator yield a lower mean squared error and a more…

Econometrics · Economics 2019-08-16 Marcelo Fernandes , Emmanuel Guerre , Eduardo Horta

We introduce a new method to prove lower estimates for the approximation error of general linear operators with smooth range in terms of classical moduli of smoothness and related $K$-functionals. In addition, we explicitly show how to…

Classical Analysis and ODEs · Mathematics 2017-06-05 Johannes Nagler

In this work, we consider a distributed multi-agent stochastic optimization problem, where each agent holds a local objective function that is smooth and convex, and that is subject to a stochastic process. The goal is for all agents to…

Optimization and Control · Mathematics 2022-10-12 Elissa Mhanna , Mohamad Assaad

The proposed smooth blockwise iterative thresholding estimator (SBITE) is a model selection technique defined as a fixed point reached by iterating a likelihood gradient-based thresholding function. The smooth James-Stein thresholding…

Methodology · Statistics 2011-10-06 Sylvain Sardy

We propose a new estimator for the high-dimensional linear regression model with observation error in the design where the number of coefficients is potentially larger than the sample size. The main novelty of our procedure is that the…

Methodology · Statistics 2019-09-09 Alexandre Belloni , Abhishek Kaul , Mathieu Rosenbaum

We propose an online parametric estimation method of stochastic differential equations with discrete observations and misspecified modelling based on online gradient descent. Our study provides uniform upper bounds for the risks of the…

Statistics Theory · Mathematics 2022-10-18 Shogo Nakakita

In the framework of nonparametric multivariate function estimation we are interested in structural adaptation. We assume that the function to be estimated has the "single-index" structure where neither the link function nor the index vector…

Statistics Theory · Mathematics 2013-04-30 Oleg Lepski , Nora Serdyukova

Online (also called "recursive" or "adaptive") estimation of fixed model parameters in hidden Markov models is a topic of much interest in times series modelling. In this work, we propose an online parameter estimation algorithm that…

Computation · Statistics 2011-02-16 Olivier Cappé

An effective two-stage method for an estimation of parameters of the linear regression is considered. For this purpose we introduce a certain quasi-estimator that, in contrast to usual estimator, produces two alternative estimates. It is…

Statistics Theory · Mathematics 2010-10-06 Anatoly Gordinsky

In this paper, we discuss the problem of minimizing the sum of two convex functions: a smooth function plus a non-smooth function. Further, the smooth part can be expressed by the average of a large number of smooth component functions, and…

Machine Learning · Computer Science 2016-11-17 Luo Luo , Zihao Chen , Zhihua Zhang , Wu-Jun Li

In the nonparametric regression setting, we construct an estimator which is a continuous function interpolating the data points with high probability, while attaining minimax optimal rates under mean squared risk on the scale of H\"older…

Statistics Theory · Mathematics 2022-06-28 Julien Chhor , Suzanne Sigalla , Alexandre B. Tsybakov

In this paper we propose a model-based approach to the design of online optimization algorithms, with the goal of improving the tracking of the solution trajectory (trajectories) w.r.t. state-of-the-art methods. We focus first on quadratic…

Optimization and Control · Mathematics 2023-07-24 Nicola Bastianello , Ruggero Carli , Sandro Zampieri

Online nonparametric estimators are gaining popularity due to their efficient computation and competitive generalization abilities. An important example includes variants of stochastic gradient descent. These algorithms often take one…

Statistics Theory · Mathematics 2025-07-08 Tianyu Zhang , Jing Lei

Gradient information on the sampling distribution can be used to reduce the variance of Monte Carlo estimators via Stein's method. An important application is that of estimating an expectation of a test function along the sample path of a…

Statistics Theory · Mathematics 2017-12-29 Chris J. Oates , Jon Cockayne , François-Xavier Briol , Mark Girolami

The method of stable random projections is a tool for efficiently computing the $l_\alpha$ distances using low memory, where $0<\alpha \leq 2$ is a tuning parameter. The method boils down to a statistical estimation task and various…

Machine Learning · Computer Science 2008-12-18 Ping Li

We study a high-dimensional regression setting under the assumption of known covariate distribution. We aim at estimating the amount of explained variation in the response by the best linear function of the covariates (the signal level). In…

Statistics Theory · Mathematics 2022-05-12 Ilan Livne , David Azriel , Yair Goldberg

In the common partially linear single-index model we establish a Bahadur representation for a smoothing spline estimator of all model parameters and use this result to prove the joint weak convergence of the estimator of the index link…

Statistics Theory · Mathematics 2024-07-03 Jiajun Tang , Holger Dette

We study online estimation in latent-variable models by recasting the problem as tracking a moving empirical equilibrium. Standard online EM and stochastic approximation analyses primarily study convergence toward the population parameter…

Machine Learning · Computer Science 2026-05-12 ZhiMing Li , Yue Song

We propose an adaptive algorithm for tracking of historical volatility. The algorithm is built under the assumption that the historical volatility function belongs to the Stone-Ibragimov-Khasminskii class of $k$ times differentiable…

Probability · Mathematics 2007-06-13 L. Goldentayer , F. Klebaner , R. Liptser