Lower rate of convergence for locating a maximum of a function
From MaRDI portal
Publication:1106585
DOI10.1214/AOS/1176350965zbMath0651.62034OpenAlexW2095355498MaRDI QIDQ1106585
Publication date: 1988
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1176350965
Related Items (16)
Algorithm portfolios for noisy optimization ⋮ Stochastic approximation of global minimum points ⋮ Online estimation of hazard rate under random censoring ⋮ The multivariate Révész's online estimator of a regression function and its averaging ⋮ Bayesian mode and maximum estimation and accelerated rates of contraction ⋮ Estimation and inference for minimizer and minimum of convex functions: optimality, adaptivity and uncertainty principles ⋮ Simple and cumulative regret for continuous noisy optimization ⋮ Online estimation of integrated squared density derivatives ⋮ Accelerated randomized stochastic optimization. ⋮ A companion for the Kiefer-Wolfowitz-Blum stochastic approximation algorithm ⋮ A compact law of the iterated logarithm for online estimator of hazard rate under random censoring ⋮ Recursive estimators of integrated squared density derivatives ⋮ Optimal two-stage procedures for estimating location and size of the maximum of a multivariate regression function ⋮ Unnamed Item ⋮ Complete cubic spline estimation of non-parametric regression functions ⋮ The stochastic approximation method for the estimation of a multivariate probability density
This page was built for publication: Lower rate of convergence for locating a maximum of a function