Computing optimal discrete readout weights in reservoir computing is NP-hard.
Fatemeh HadaeghiHerbert JaegerPublished in: CoRR (2018)
Keyphrases
- np hard
- reservoir computing
- optimal solution
- worst case
- optimal weights
- recurrent neural networks
- special case
- linear combination
- multiscale
- minimum cost
- approximation algorithms
- linear programming
- computational complexity
- greedy heuristic
- lower bound
- np complete
- closely related
- scheduling problem
- dynamic programming
- optimal control
- relative importance
- weighted average
- decision variables
- artificial neural networks
- finding the optimal solution