Nonparametric sequential estimation for diffusion processes based on discrete data
Serguei PERGAMENCHTCHIKOV
In this talk we study the nonparametric estimation problem for the stochastic differential equation defined as \[ \mathrm{d} y_{t}=S(y_{t})\,\mathrm{d} t +\,b(y_{t}) \,\mathrm{d} W_{t}\,, \quad 0\le t\le T\,, \] where \((W_{t})_{t\ge 0}\) is the standard Wiener process, \(S(\cdot)\) is unknown drift function and \(b(\cdot)\) is unknown diffusion coefficient. The problem is to estimate the function \(S(\cdot)\) on the basis of the discrete observations \[ (y_{t_{j}})_{1\le j\le N}\,,\quad t_{j}=j\delta\,, \] where \(\delta\in(0,1)\) is the frequency and \(N\) is the sample size.
Note that, for the complete data this problem is well known (see, for example, in [6] and the references therein). For weighted integral risks for such problems the efficient estimation methods were developed in [1] and the sharp lower bound for the minimax risk is found. In [4] the efficient estimation problems are studied for the usual quadratic risks.
In this talk we study the drift estimation problem on the basis of the discrete data motivated by the big data analysis for the diffusion models ([2,3,5]). To this end, on the basis of sequential analysis methods we develop model selection procedures, for which we show non asymptotic sharp oracle inequalities. Through the obtained inequalities we show that the constructed model selection procedures are asymptotically efficient in adaptive setting, i.e. in the case when the model regularity is unknown. For the first time for such problems, it is found in the explicit form the celebrated Pinsker constant, which provides the sharp lower bound for the minimax squared accuracy normalized with the optimal convergence rate. Then one shows that the asymptotic quadratic risk for the model selection procedure asymptotically coincides with the obtained lower bound, i.e., this means that the constructed procedure is efficient. Finally, on the basis of the constructed model selection procedures in the framework of the big data models, we provide efficient estimation without using the parameter dimension or any sparse conditions.
The talk is based on a joint work with Leonid Galtchouk.
References
[1] Dalalyan, A.S. and Kutoyants, Yu.A. (2002) Asymptotically efficient trend coefficient estimation for ergodic diffusion. Mathematical Methods of Statistics 11(4):402–427.
[2] De Gregorio, A. and Iacus, S.M. (2012) Adaptive LASSO-type estimation for multivariate diffusion processes. Econometric Theory 28(4):838–860. https://doi.org/10.1017/S0266466611000806
[3] Fujimori, K. (2019) The Danzing selector for a linear model of diffusion processes. Statistical Inference for Stochastic Processes 22(3):475–498. https://doi.org/10.1007/s11203-018-9191-y
[4] Galtchouk, L.I. and Pergamenchtchikov, S.M. (2011) Adaptive sequential estimation for ergodic diffusion processes in quadratic metric. Journal of Nonparametric Statistics 23(2):255–285. https://doi.org/10.1080/10485252.2010.544307
[5] Galtchouk, L.I. and Pergamenchtchikov, S.M. (2022) Adaptive efficient analysis for big data ergodic diffusion models. Statistical Inference for Stochastic Processes 25(1):127–158. https://doi.org/10.1007/s11203-021-09241-9
[6] Kutoyants, Yu.A. (2004) Statistical Inferences for Ergodic Diffusion Processes. Springer, London. https://doi.org/10.1007/978-1-4471-3866-2