A Newton-Raphson version of the multivariate Robbins-Monro procedure
To find the unique \(\theta\) such that \(f(\theta)=0\), \(f:R^ k\to R^ k,\) the Robbins-Monro procedure \(X_{n+1}=X_ n-an^{-1}B_ nD_ nf_ n\) is introduced, where \(f_ n\) is an estimate of \(f(X_ n)\), \(D_ n\) is an estimate of the derivative \(D(X_ n)\) of f at \(X_ n\), \(B_ n\) is an estimate of \([D^ t(\theta)D(\theta)]^{-1}\), and a is a constant. The basic result is that \(f(X_ n)\to 0\) a.s., and under additional assumptions a.s. convergence of \(X_ n\) to \(\theta\) and asymptotic normality of \(X_ n\) are established.
- A new sequential design based on the Robbins-Monro procedure
- Stochastic approximation: from statistical origin to big-data, multidisciplinary applications
- Fundamental design principles for reinforcement learning algorithms
- Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization
- A gradient method for unconstrained optimization in noisy environment
- Asymptotic Properties of Some Projection-based Robbins-Monro Procedures in a Hilbert Space
- scientific article; zbMATH DE number 4157849 (Why is no real title available?)
- Adaptive random search for continuous simulation optimization
- Sequential Estimation in Stochastic Approximation Problem with Autoregressive Errors in Observations
- Newton-based stochastic optimization using \(q\)-Gaussian smoothed functional algorithms
- Multidimensional stochastic approximation
- Smoothed functional algorithms for stochastic optimization using q-Gaussian distributions
- LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums
- Efficient Robbins–Monro procedure for multivariate binary data
- Stochastic approximation algorithms: overview and recent trends.
- Permutation-based multiple testing corrections for P -values and confidence intervals for cluster randomized trials
- Online estimation and inference for robust policy evaluation in reinforcement learning
- A penalized criterion for selecting the number of clusters for K-medians
- The ODE method for asymptotic statistics in stochastic approximation and reinforcement learning
- Regression estimation by local polynomial fitting for multivariate data streams
- Non-asymptotic confidence bounds for stochastic approximation algorithms with constant step size
- Computing highly accurate confidence limits from discrete data using importance sampling
- Efficient and fast estimation of the geometric median in Hilbert spaces with an averaged stochastic gradient algorithm
- Randomized Newton-Raphson
This page was built for publication: A Newton-Raphson version of the multivariate Robbins-Monro procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061434)
