Optunity
stable
  • Installing Optunity
  • User Guide
    • Solver overview
      • Grid Search
      • Random Search
      • Particle Swarm Optimization
      • Nelder-Mead simplex
      • CMA-ES
      • Tree-structured Parzen Estimator
      • Sobol sequences
    • Cross-validation
    • Quality metrics
    • Domain constraints
    • Structured search spaces
    • Terminology
      • Installing Optunity
      • Solver overview
        • Grid Search
        • Random Search
        • Particle Swarm Optimization
        • Nelder-Mead simplex
        • CMA-ES
        • Tree-structured Parzen Estimator
        • Sobol sequences
      • Cross-validation
      • Domain constraints
      • Structured search spaces
  • Examples
  • Notebooks
  • Using Other Environments
  • Optunity API
Optunity
  • Docs »
  • User Guide »
  • Solver overview »
  • Random Search
  • Edit on GitHub

Random SearchΒΆ

This solver is implemented in optunity.solvers.RandomSearch. It as available in optunity.make_solver() as ‘random search’.

This strategy consists of testing a predefined number of randomly sampled hyperparameter tuples. Sampling is done uniform at random within specified box constraints.

This solver implements the search strategy described in [RAND].

[RAND]Bergstra, James, and Yoshua Bengio. Random search for hyper-parameter optimization. The Journal of Machine Learning Research 13.1 (2012): 281-305
Next Previous

© Copyright 2014, Marc Claesen, Jaak Simm and Dusan Popovic. Revision 51e4a94a.

Built with Sphinx using a theme provided by Read the Docs.