Sequential Estimation in Stochastic Approximation Problem with Autoregressive Errors in Observations
Stochastic approximation methods are known as iterative algorithms for finding a root of a function in the case when functional values can be determined only with a random error. These methods are employed in many applications. Mathematical properties of the above mentioned methods have been investigated, first, under the assumption that the observed errors can be modelled as a sequence of independent identically distributed random variables. Later, the methods have been investigated in the case of stationary processes as a noise, which can describe the situation of correlated observations. The asymptotic theory for the stationary noise is now already well developed. However, other problems have appeared in applications. Especially, there has arisen a serious problem in the case of autoregressive sequences with unknown parameters. It is a problem of uniform convergence of algorithms with respect to these unknown parameters. The aim of the authors is to deal just with this problem. In detail, they construct adaptive iterative procedures which converge uniformly (in some sense) with respect to the nuisance parameters.
- A new dynamic stochastic approximation procedure
- A Newton-Raphson version of the multivariate Robbins-Monro procedure
- A Stochastic Approximation Method
- Adaptive design and stochastic approximation
- Asymptotic Distribution of Stochastic Approximation Procedures
- Estimators with prescribed Precision in Stochastic regression models
- General convergence results for stochastic approximations via weak convergence theory
- scientific article; zbMATH DE number 777603 (Why is no real title available?)
- On Asymptotic Normality in Stochastic Approximation
- On guaranteed estimation of the mean of an autoregressive process
- On sequential estimation of an autoregressive parameter
- Stochastic approximation with dependent noise
- Strong convergence of a stochastic approximation algorithm
- Edgeworth expansions for stochastic approximation theory
- Asymptotic properties of quasi-optimal algorithms of stochastic approximation under unknown density of noise
- Estimation of the minimum point of an unknown function observed in the presence of dependent noise
- Estimation of regression parameters with arbitrary noise
- scientific article; zbMATH DE number 4130299 (Why is no real title available?)
- scientific article; zbMATH DE number 4043678 (Why is no real title available?)
- Stochastic approximation, with applications.
- Sequential estimation in a subclass of exponential family under weighted squared error loss
- On a discrete stochastic approximation and its application to data analysis
- Stochastic approximation and compound delayed observations with independent random time delay distribution
- scientific article; zbMATH DE number 903864 (Why is no real title available?)
- Polyak's method based on the stochastic Lyapunov function for justifying the consistency of estimates produced by a stochastic approximation search algorithm under an unknown-but-bounded noise
This page was built for publication: Sequential Estimation in Stochastic Approximation Problem with Autoregressive Errors in Observations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429468)