Abstract
The problem considered is that of approximating the root of a function under the assumption that the observation noise is modelled as a stationary autoregressive process with unknown (nuisance) parameters. An example is given which shows that in this case the estimate provided by the usual Robbins–Monro algorithm can be arbitrarily far away from the root after any fixed number of iterations. The article proposes an adaptive stochastic approximation procedure for estimating the root uniformly in the nuisance parameters in asymptotic and non-asymptotic settings. In the asymptotic setting the procedure ensures convergence in the mean of the first order to the root of a function. In the non-asymptotic statement some additional conditions are imposed on the function, the proposed scheme ensures estimating the root with a prescribed mean absolute error uniformly in the nuisance parameters.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.