Computing optimal discrete readout weights in reservoir computing is NP-hard.
Fatemeh HadaeghiHerbert JaegerPublished in: Neurocomputing (2019)
Keyphrases
- np hard
- optimal solution
- reservoir computing
- worst case
- greedy heuristic
- dynamic programming
- minimum cost
- recurrent neural networks
- scheduling problem
- lower bound
- data sets
- weighted sum
- upper bound
- np complete
- decision problems
- approximation algorithms
- relative importance
- weighting scheme
- np hardness
- optimal weights
- greedy algorithm
- integer programming
- optimal design
- databases