Pages that link to "Item:Q813364"
From MaRDI portal
The following pages link to Approximate implementations of pure random search in the presence of noise (Q813364):
Displaying 10 items.
- Analysis of runtime of optimization algorithms for noisy functions over discrete codomains (Q888426) (← links)
- Simple and cumulative regret for continuous noisy optimization (Q905845) (← links)
- Adaptive search with stochastic acceptance probabilities for global optimization (Q943781) (← links)
- Recurrent search optimization algorithms in the presence of relative noise. II: Optimal search procedures (Q1107447) (← links)
- Towards pure adaptive search (Q1905968) (← links)
- On similarities between two models of global optimization: Statistical models and radial basis functions (Q1959246) (← links)
- Surrogate-assisted bounding-box approach for optimization problems with tunable objectives fidelity (Q2010110) (← links)
- A direct search algorithm for optimization with noisy function evaluations (Q2706357) (← links)
- Adaptive random search for continuous simulation optimization (Q3588809) (← links)
- Random Search in the Presence of Noise, with Application to Machine Learning (Q4713082) (← links)
