Computing optimal discrete readout weights in reservoir computing is NP-hard

Fatemeh Hadaeghi, Herbert Jaeger

We show NP-hardness of a generalized quadratic programming problem, which we called Unconstrained N-ary Quadratic Programming (UNQP). This problem has recently become practically r…