{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/bayesian-optimization-of-hyper-parameters-in","title":"Bayesian optimization of hyper-parameters in reservoir computing","arxiv_id":"1611.05193","date":"2016-11-16","proceeding":null,"authors":["Jan Yperman","Thijs Becker"],"abstract":"We describe a method for searching the optimal hyper-parameters in reservoir\ncomputing, which consists of a Gaussian process with Bayesian optimization. It\nprovides an alternative to other frequently used optimization methods such as\ngrid, random, or manual search. In addition to a set of optimal\nhyper-parameters, the method also provides a probability distribution of the\ncost function as a function of the hyper-parameters. We apply this method to\ntwo types of reservoirs: nonlinear delay nodes and echo state networks. It\nshows excellent performance on all considered benchmarks, either matching or\nsignificantly surpassing results found in the literature. In general, the\nalgorithm achieves optimal results in fewer iterations when compared to other\noptimization methods. We have optimized up to six hyper-parameters\nsimultaneously, which would have been infeasible using, e.g., grid search. Due\nto its automated nature, this method significantly reduces the need for expert\nknowledge when optimizing the hyper-parameters in reservoir computing. Existing\nsoftware libraries for Bayesian optimization, such as Spearmint, make the\nimplementation of the algorithm straightforward. A fork of the Spearmint\nframework along with a tutorial on how to use it in practice is available at\nhttps://bitbucket.org/uhasseltmachinelearning/spearmint/","url_abs":"http://arxiv.org/abs/1611.05193v3","url_pdf":"http://arxiv.org/pdf/1611.05193v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"bayesian-optimization-of-hyper-parameters-in","repo_url":"https://bitbucket.org/uhasseltmachinelearning/spearmint","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"bayesian-optimization-of-hyper-parameters-in","repo_url":"https://github.com/rednotion/parallel_esn_web","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"}],"methods":[{"method_slug":"gaussian-process","method_name":"Gaussian Process"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"bitbucket.org/uhasseltmachinelearning/spearmint","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"rednotion/parallel_esn_web","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f208aea4bf71073d6dac6e1ab702af10c6b82c9f7b8f2f6a57444e15f510bf2c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}