Random Search in the Presence of Noise, with Application to Machine Learning

DOI10.1137/0911041zbMath0742.65053OpenAlexW2013447616MaRDI QIDQ4713082

No author found.

Publication date: 25 June 1992

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0911041

zbMATH Keywords

optimizationconvergenceglobal minimummachine learningrandom search8-puzzle problemssequential noisy measurements

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Learning and adaptive systems in artificial intelligence (68T05) Stochastic programming (90C15)

Related Items (9)

A stochastically quasi-optimal search algorithm for the maximum of the simple random walk ⋮ An Asymptotically Optimal Set Approach for Simulation Optimization ⋮ Search for the maximum of a random walk ⋮ A decision model and methodology for the AIDS epidemic ⋮ Machine learning for optimal blackjack counting strategies ⋮ A statistical foundation for machine learning, with application to Go- Moku ⋮ Almost surely convergent global optimziation algorithm using noise-corrupted observations ⋮ Sequential design with applications to the trim-loss problem ⋮ Nonparametric bandit methods

This page was built for publication: Random Search in the Presence of Noise, with Application to Machine Learning