Upper bounds on the maximum admissible level of noise in zeroth-order optimisation
From MaRDI portal
(Redirected from Publication:6441865)
Abstract: In this paper, based on information-theoretic upper bound on noise in convex Lipschitz continuous zeroth-order optimisation, we provide corresponding upper bounds for strongly-convex and smooth classes of problems using non-constructive proofs through optimal reductions. Also, we show that based on one-dimensional grid-search optimisation algorithm one can construct algorithm for simplex-constrained optimisation with upper bound on noise better than that for ball-constrained and asymptotic in dimensionality case.
This page was built for publication: Upper bounds on the maximum admissible level of noise in zeroth-order optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6441865)
