Pith. sign in

REVIEW 1 cited by

Bayesian optimization of hyper-parameters in reservoir computing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1611.05193 v3 pith:LLHWNN73 submitted 2016-11-16 cs.LG

classification cs.LG
keywords hyper-parametersoptimizationmethodbayesiancomputingoptimalreservoirspearmint
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We describe a method for searching the optimal hyper-parameters in reservoir computing, which consists of a Gaussian process with Bayesian optimization. It provides an alternative to other frequently used optimization methods such as grid, random, or manual search. In addition to a set of optimal hyper-parameters, the method also provides a probability distribution of the cost function as a function of the hyper-parameters. We apply this method to two types of reservoirs: nonlinear delay nodes and echo state networks. It shows excellent performance on all considered benchmarks, either matching or significantly surpassing results found in the literature. In general, the algorithm achieves optimal results in fewer iterations when compared to other optimization methods. We have optimized up to six hyper-parameters simultaneously, which would have been infeasible using, e.g., grid search. Due to its automated nature, this method significantly reduces the need for expert knowledge when optimizing the hyper-parameters in reservoir computing. Existing software libraries for Bayesian optimization, such as Spearmint, make the implementation of the algorithm straightforward. A fork of the Spearmint framework along with a tutorial on how to use it in practice is available at https://bitbucket.org/uhasseltmachinelearning/spearmint/

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Tri-Learn Graph Fusion Network for Attributed Graph Clustering

    cs.LG 2025-07 reject novelty 4.0 of 10

    Tri-GFN fuses AE, GCN, and Graph Transformer features with dual self-supervision and reports improved attributed-graph clustering on seven benchmarks.

Pith tools