Vyacheslav A. Vasiliev
Vyacheslav A. Vasiliev has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
Tatiana V. Dogadova
Natl Res Tomsk State Univ, Dept High Math & Math Modelling, Tomsk, Russia
2 shared publications- Uwe Küchler
Humboldt-Universität zu Berlin
2 shared publications - A. Malyarenko
Tomsk State University, Tomsk, Russia
1 shared publication D. N. Politis
University of California, San Diego
1 shared publicationDimitris N. Politis
Department of Mathematics , University of California , San Diego , California , USA
1 shared publication- Dimitris N. Politis
Department of Mathematics and Halicioglu Data Science Institute University of California San Diego La Jolla 92093 CA USA
1 shared publication
Latest Publications
- Open Access
Estimating Smoothness and Optimal Bandwidth for Probability Density Functions
The properties of non-parametric kernel estimators for probability density function from two special classes are investigated. Each class is parametrized with distribution smoothness parameter. One of the classes was introduced by Rosenblatt, another one is introduced in this paper. For the case of the known smoothness parameter, the rates of mean square convergence of optimal (on the bandwidth) density estimators are found. For the case of unknown smoothness parameter, the estimation procedure of the parameter is developed and almost surely convergency is proved. The convergence rates in the almost sure sense of these estimators are obtained. Adaptive estimators of densities from the given class on the basis of the constructed smoothness parameter estimators are presented. It is shown in examples how parameters of the adaptive density estimation procedures can be chosen. Non-asymptotic and asymptotic properties of these estimators are investigated. Specifically, the upper bounds for the mean square error of the adaptive density estimators for a fixed sample size are found and their strong consistency is proved. The convergence of these estimators in the almost sure sense is established. Simulation results illustrate the realization of the asymptotic behavior when the sample size grows large.
Open AccessEstimating Smoothness and Optimal Bandwidth for Probability Density Functions
The properties of non-parametric kernel estimators for probability density function from two special classes are investigated. Each class is parametrized with distribution smoothness parameter. One of the classes was introduced by Rosenblatt, another one is introduced in this paper. For the case of the known smoothness parameter, the rates of mean square convergence of optimal (on the bandwidth) density estimators are found. For the case of unknown smoothness parameter, the estimation procedure of the parameter is developed and almost surely convergency is proved. The convergence rates in the almost sure sense of these estimators are obtained. Adaptive estimators of densities from the given class on the basis of the constructed smoothness parameter estimators are presented. It is shown in examples how parameters of the adaptive density estimation procedures can be chosen. Non-asymptotic and asymptotic properties of these estimators are investigated. Specifically, the upper bounds for the mean square error of the adaptive density estimators for a fixed sample size are found and their strong consistency is proved. The convergence of these estimators in the almost sure sense is established. Simulation results illustrate the realization of the asymptotic behavior when the sample size grows large.
- 1 January 2018
- Published by Springer Nature
- p. 159-169
Adaptive Estimation of Heavy Tail Distributions with Application to Hall Model
- 1 January 2018
- Published by Springer Nature
- p. 159-169
Adaptive Estimation of Heavy Tail Distributions with Application to Hall Model
- Open Access
- 1 March 2017
- Published by Tomsk State University in Vestnik Tomskogo Gosudarstvennogo Universiteta. Upravlenie, Vychislitel'naya Tekhnika i Informatika
- No. 38,p. 17-23
Adaptive prediction of stochastic differential equations with unknown parameters
- 1 March 2017
- Published by Tomsk State University in Vestnik Tomskogo Gosudarstvennogo Universiteta. Upravlenie, Vychislitel'naya Tekhnika i Informatika
- No. 38,p. 17-23
Open AccessAdaptive prediction of stochastic differential equations with unknown parameters
- 3 April 2015
- Published by Taylor & Francis in Sequential Analysis
- Vol. 34 (2) , 211-234
On Optimal Adaptive Prediction of Multivariate Autoregression
The problem of asymptotic efficiency of adaptive one-step predictors for a stable multivariate first-order autoregressive process (AR(1)) with unknown parameters is considered. The predictors are based on the truncated estimators of the dynamic matrix parameter. The truncated estimation method is a modification of the truncated sequential estimation method that makes it possible to obtain estimators of ratio-type functionals with a given accuracy by samples of fixed size. The criterion of optimality is based on the loss function, defined as a sum of sample size and squared prediction error's sample mean. The cases of known and unknown variance of the noise model are studied. In the latter case the optimal sample size is a special stopping time. The simulation results are given.
- 3 April 2015
- Published by Taylor & Francis in Sequential Analysis
- Vol. 34 (2) , 211-234
On Optimal Adaptive Prediction of Multivariate Autoregression
The problem of asymptotic efficiency of adaptive one-step predictors for a stable multivariate first-order autoregressive process (AR(1)) with unknown parameters is considered. The predictors are based on the truncated estimators of the dynamic matrix parameter. The truncated estimation method is a modification of the truncated sequential estimation method that makes it possible to obtain estimators of ratio-type functionals with a given accuracy by samples of fixed size. The criterion of optimality is based on the loss function, defined as a sum of sample size and squared prediction error's sample mean. The cases of known and unknown variance of the noise model are studied. In the latter case the optimal sample size is a special stopping time. The simulation results are given.
- 11 October 2014
- Published by Springer Nature
- p. 347-356
Guaranteed Estimation of Logarithmic Density Derivative by Dependent Observations
- 11 October 2014
- Published by Springer Nature
- p. 347-356
Guaranteed Estimation of Logarithmic Density Derivative by Dependent Observations
- 3 July 2013
- Published by Taylor & Francis in Sequential Analysis
- Vol. 32 (3) , 243-266
Non-Parametric Sequential Estimation of a Regression Function Based on Dependent Observations
This article presents a sequential estimation procedure for an unknown regression function. Observed regressors and noises of the model are supposed to be dependent and form sequences of dependent numbers. Two types of estimators are considered. Both estimators are constructed on the basis of Nadaraya-Watson kernel estimators. First, sequential estimators with given bias and mean square error are defined. According to the sequential approach the duration of observations is a special stopping time. Then on the basis of these estimators of a regression function, truncated sequential estimators on a time interval of a fixed length are constructed. At the same time, the variance of these estimators is controlled by a (non-asymptotic) bound. In addition to nonasymptotic properties, the limiting behavior of presented estimators is investigated. It is shown, in particular, that by the appropriate chosen bandwidths both estimators have optimal (as compared to the case of independent data) rates of convergence of Nadaraya-Watson kernel estimators.
- 3 July 2013
- Published by Taylor & Francis in Sequential Analysis
- Vol. 32 (3) , 243-266
Non-Parametric Sequential Estimation of a Regression Function Based on Dependent Observations
This article presents a sequential estimation procedure for an unknown regression function. Observed regressors and noises of the model are supposed to be dependent and form sequences of dependent numbers. Two types of estimators are considered. Both estimators are constructed on the basis of Nadaraya-Watson kernel estimators. First, sequential estimators with given bias and mean square error are defined. According to the sequential approach the duration of observations is a special stopping time. Then on the basis of these estimators of a regression function, truncated sequential estimators on a time interval of a fixed length are constructed. At the same time, the variance of these estimators is controlled by a (non-asymptotic) bound. In addition to nonasymptotic properties, the limiting behavior of presented estimators is investigated. It is shown, in particular, that by the appropriate chosen bandwidths both estimators have optimal (as compared to the case of independent data) rates of convergence of Nadaraya-Watson kernel estimators.
- 1 June 2013
- Published by Springer Nature in Annals of the Institute of Statistical Mathematics
- Vol. 66 (1) , 141-163
A truncated estimation method with guaranteed accuracy
- 1 June 2013
- Published by Springer Nature in Annals of the Institute of Statistical Mathematics
- Vol. 66 (1) , 141-163
A truncated estimation method with guaranteed accuracy
- 27 October 2010
- Published by Springer Nature in Metrika
- Vol. 75 (3) , 403-424
On parameter estimation of partly observed bilinear discrete-time stochastic systems
- 27 October 2010
- Published by Springer Nature in Metrika
- Vol. 75 (3) , 403-424
On parameter estimation of partly observed bilinear discrete-time stochastic systems
- 1 January 2009
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 42 (10) , 892-897
On sequential parameter estimation of stochastic delay differential equations by noisy observations
- 1 January 2009
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 42 (10) , 892-897
On sequential parameter estimation of stochastic delay differential equations by noisy observations