Random Search in the Presence of Noise, with Application to Machine Learning
From MaRDI portal
Recommendations
- Approximate implementations of pure random search in the presence of noise
- scientific article; zbMATH DE number 3926670
- Recurrent search optimization algorithms in the presence of relative noise. II: Optimal search procedures
- Understanding the role of noise in stochastic local search: analysis and experiments
- Stochastic approximation search algorithms with randomization at the input
- Mathematical methods of randomized machine learning
- Sample-efficient strategies for learning in the presence of noise
- A randomized stochastic approximation algorithm for self-learning
- scientific article; zbMATH DE number 6276119
Cited in
(10)- 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
- A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
- Almost surely convergent global optimziation algorithm using noise-corrupted observations
- Theory for automatic learning under partially observed Markov-dependent noise
- Sequential design with applications to the trim-loss problem
- Search for the maximum of a random walk
- An Asymptotically Optimal Set Approach for Simulation Optimization
- Nonparametric bandit methods
This page was built for publication: Random Search in the Presence of Noise, with Application to Machine Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713082)
