MétaCan
Menu
Back to cohort
Record W2760804696 · doi:10.1109/cjece.2017.2703093

ZIZO: A Novel Zoom-In–Zoom-Out Search Algorithm for the Global Parameters of Echo-State Networks

2017· article· en· W2760804696 on OpenAlexvenueno aff
Guodong Wang, Mohamed Amin Ben Sassi, Radu Grosu

Bibliographic record

VenueCanadian Journal of Electrical and Computer Engineering · 2017
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks and Reservoir Computing
Canadian institutionsnot available
Fundersnot available
KeywordsZoomComputer scienceEcho state networkAlgorithmEcho (communications protocol)Recurrent neural networkRepresentation (politics)State (computer science)Sampling (signal processing)Artificial intelligenceArtificial neural networkComputer vision

Abstract

fetched live from OpenAlex

Echo-state networks (ESNs) are a distinct architecture for recurrent neural networks (RNNs). The great advantage of ESN is that they offer an easy way to train the RNN. To make full use of ESN, one needs to first identify their global (hyper) parameters. These are input scaling, leaking rate (for leaky ESN), spectral radius, and the size of the ESN. The most recommended way to get their optimal (or suboptimal) values is by trial-and-error. However, in practice, this method has a very low efficiency. In order to tackle this problem, we propose a novel “zoom-in-zoom-out” (ZIZO) algorithm for generating the global parameters automatically. The proposed technique consists of two major parts. First, we generate random ranges for the parameters of ESNs. Then, based on bootstrap-sampling, we search the optimal solution within the fixed specific ranges. To evaluate the proposed method, we use two different data sets, which are collected from the literature. The obtained results demonstrate the efficiency and accuracy of ZIZO.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.007
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0040.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.016
GPT teacher head0.226
Teacher spread0.210 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2017
Admission routes1
Has abstractyes

Explore more

Same venueCanadian Journal of Electrical and Computer EngineeringSame topicNeural Networks and Reservoir ComputingFrench-language works237,207