Sciweavers

402 search results - page 1 / 81
» Random Search for Hyper-Parameter Optimization
Sort
View
JMLR
2012
11 years 7 months ago
Random Search for Hyper-Parameter Optimization
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
James Bergstra, Yoshua Bengio
CN
2007
148views more  CN 2007»
13 years 4 months ago
Optimizing random walk search algorithms in P2P networks
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
Nabhendra Bisnik, Alhussein A. Abouzeid
GECCO
2006
Springer
153views Optimization» more  GECCO 2006»
13 years 8 months ago
On the local performance of simulated annealing and the (1+1) evolutionary algorithm
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
Thomas Jansen, Ingo Wegener
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
13 years 6 months ago
Oblivious Randomized Direct Search for Real-Parameter Optimization
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
Jens Jägersküpper